Lecture Notes in Computer Science 8752
Total Page：16
File Type：pdf, Size：1020Kb
Lecture Notes in Computer Science 8752 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany More information about this series at http://www.springer.com/series/7407 Pierrick Legrand • Marc-Michel Corsini Jin-Kao Hao • Nicolas Monmarché Evelyne Lutton • Marc Schoenauer (Eds.) Artificial Evolution 11th International Conference, Evolution Artificielle, EA 2013 Bordeaux, France, October 21–23, 2013 Revised Selected Papers 123 Editors Pierrick Legrand Nicolas Monmarché INRIA Bordeaux sud-ouest, Equipe CQFD, Laboratoire d’Informatique de Institut de Mathématiques de Bordeaux l’Université de Tours, (IMB), UMR CNRS 5251, Ecole Polytechnique de l’Université Université de Bordeaux, de Tours, 3ter place de la victoire, 33076 Bordeaux, 64 avenue Jean Portalis, 37200 Tours, France France Marc-Michel Corsini Evelyne Lutton Université de Bordeaux, INRA, UMR 782 GMPA, 3ter place de la victoire, 33076 Bordeaux, 1 Av. Brétignière, France 78850, Thirverval-Grignon, France Jin-Kao Hao LERIA, Marc Schoenauer Université d’Angers, Equipe TAO, INRIA Futurs, LRI, 2 Bd Lavoisier, 49045 Angers Cedex 01, Université de Paris-Sud, France Bât 490, 91405 Orsay cedex, France ISSN 0302-9743 ISSN 1611-3349 (electronic) ISBN 978-3-319-11682-2 ISBN 978-3-319-11683-9 (eBook) DOI 10.1007/978-3-319-11683-9 Library of Congress Control Number: 2014953268 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues Springer Cham Heidelberg New York Dordrecht London © Springer International Publishing Switzerland 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Artificial Evolution 2013, Presented by W.B. Langdon It was my pleasure, as an invited speaker at Arti- ficial Evolution 2013 Bordeaux, to be invited by Pierrick Legrand to contribute this view of the conference. First, let me thank Pierrick and the whole EA 2013 conference in general for their kind invitation and wonderful hospitality. Although I saw most of the posters and presenta- tions, it is impossible to treat them all fairly, for that, I must direct you to the individual papers, instead this will be a personal view For me the conference started in bright sun- shine, with registration in the newly completed Inria building in Bordeaux. All the sessions were held in the Ada Lovelace room. The first session concerned solving discrete problems with presen- tations by Rym Nesrine Guibadj on a delivery van route application and then Olivier Gach on detecting clusters in potentially small world neighbor connectivity graphs. During the conference several presenters said they used Pascal which provoked discussion about its merits versus the wisdom of more main- stream languages such as C and Java. The second part of the session contained pre- sentations by Ines Sghir and Fazia Aiboud. Although they continued the discrete mathematics theme, Fazia’s talk on cellular automata was motivated by the desire to model living cells within human organs. Arnaud Liefooghe’s presentation continued the discrete mathematics theme from the first session and included enumerating many benchmarks looking for features to explain their difficulty for multi-objective solvers. Sandra Astete Morales showed new proofs for the speed at which EAs will approach an optimum in continuous problems where in the neighborhood of the optimum the objective function falls as the square of the distance from it. Notice that finding the exact optimum is hard without additional assumptions as the guidance the objective function provides dies toward zero as the optimum is approached. Optima of continuous problems can often be represented by the first few terms of a Taylor expansion and thus often have this sphere x2-like property. I wondered if tighter bounds might be found by using the fact that Sandra’s theorems assumed Gaussian noise, whose variances can be simply summed. Charlie Vanaret’s Charibde program married differential evolution with branch and bound to manage the problem in applications with many dimensions that branch and bound potentially needs to keep track of an exponentially large number of options which must still be explored. VI Artificial Evolution 2013, Presented by W.B. Langdon The final session on Monday returned to evolving solutions for applications. Hoang Luong presented his work on using genetic algorithms to optimally plan extensions to the Dutch electricity distribution network (10–50 KV) on the assumption that demand for electricity will continue to grow in parts of the Netherlands. Then, Laetitia Jourdan presented work by Khedidja Seridi on using ParadisEO to try to attribute diseases, particularly human diseases, to genetic mutations (SNPs). In the evening, Inria and the conference were opened to both the conference attendees and the members of the public for an exhibition of more than 30 evolved art pieces by 13 international artists. Many of these were visually stunning colored pictures but they also included fashionable textiles and tapestries. The exhibit commenced with Emmanuel Cayla elaborating on how he used the Evelyne Lutton’s ArtiE-Fract soft- ware to interactively evolve mathematical fractal patterns and then used the tool to build on these to give vent to his artistic desires. Evelyne Lutton provided a real-time translation from French to English. Tuesday morning we started with a nice presentation by Federic Kruger on using computer graphics hardware (GPU) within the EASEA platform to evolve predictions for electricity demand in Strasbourg. This was closely followed by Alberto Tonda’s description of using evolutionary computation and user interaction to control which variables cause others (the direction of inference) in Bayesian networks. Alberto’s target was Bayesian networks for use in the French food industry, particularly the creation of learning networks for cheese ripening and biscuit baking. Prof. Jean Louis Deneubourg from the Université libre de Bruxelles’ unit of social ecology (USE) gave a wonderful invited talk including the mathematical scaling laws observed in social animals, particularly cockroaches. The poster session included new nature inspired algorithms and new approaches to new delivery van scheduling problems. After lunch we were treated to Christian Blum’s description of using ant colony optimization (ACO) in combination with beam search applied to the problem of finding the longest repetition-free subsequence in Bioinformatics strings. No trip to Bordeaux would be complete without a visit to the wine country. Tuesday evening we were whisked through the Bordeaux region to St. Emillion. First, a very informative tour of the town itself, in which our guide pointed out the ancient forti- fication constructed under the orders of John “Lackland” (known in England as King John, 1166–1216) who then, but not for much longer, ruled this part of France. Since St. Emillion was claimed both by the King of France and that of England, the people of Saint Emillion tactfully refer to it as “the King’s tower” without saying which king. After an unnoticed incident with the first bus, we moved