Parallel Problem Solving from Nature — PPSN VII

7th International Conference Granada, Spain, September 7–11, 2002 Proceedings

  • Juan Julián Merelo Guervós
  • Panagiotis Adamidis
  • Hans-Georg Beyer
  • Hans-Paul Schwefel
  • José-Luis Fernández-Villacañas

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2439)

Table of contents

  1. Front Matter
    Pages I-XXIII
  2. Evolutionary Algorithms Theory

  3. Representation/Codification Issues

  4. Variation Operators: Analysis, New Techniques

    1. Hernán E. Aguirre, Kiyoshi Tanaka
      Pages 111-121
    2. Dirk Büche, Gianfranco Guidati, Peter Stoll, Petros Koumoutsakos
      Pages 122-131
    3. C. Hervás-Martínez, D. Ortiz-Boyer, N. García-Pedrajas
      Pages 153-161
    4. Márk Jelasity, Mike Preuβ, A. E. Eiben
      Pages 172-183
    5. D. Ortiz-Boyer, C. Hervás-Martínez, N. García-Pedrajas
      Pages 184-193
    6. Thomas Philip Runarsson
      Pages 194-203

About these proceedings


We are proud to introduce the proceedings of the Seventh International C- ference on Parallel Problem Solving from Nature, PPSN VII, held in Granada, Spain, on 7–11 September 2002. PPSN VII was organized back-to-back with the Foundations of Genetic Algorithms (FOGA) conference, which took place in Torremolinos, Malaga, Spain, in the preceding week. ThePPSNseriesofconferencesstartedinDortmund,Germany[1].Fromthat pioneering meeting, the event has been held biennially, in Brussels, Belgium [2], Jerusalem, Israel [3], Berlin, Germany [4], Amsterdam, The Netherlands [5], and Paris, France [6]. During the Paris conference, several bids to host PPSN 2002 were put forward; it was decided that the conference would be held in Granada with Juan J. Merelo Guerv´ os as General Chairman. The scienti?c content of the PPSN conference focuses on problem-solving paradigms gleaned from natural models, with an obvious emphasis on those that display an innate parallelism, such as evolutionary algorithms and ant-colony optimization algorithms. The majority of the papers, however, concentrate on evolutionary and hybrid algorithms, as is shown in the contents of this book and itspredecessors.Thiseditionoftheconferenceproceedingshasalargesectionon applications,betheytoclassicalproblemsortoreal-worldengineeringproblems, which shows how bioinspired algorithms are extending their use in the realms of business and enterprise.


Algorithms Automat algorithm automata coevolution evolution evolutionary algorithm learning optimization

Editors and affiliations

  • Juan Julián Merelo Guervós
    • 1
  • Panagiotis Adamidis
    • 2
  • Hans-Georg Beyer
    • 3
  • Hans-Paul Schwefel
    • 3
  • José-Luis Fernández-Villacañas
    • 4
  1. 1.Escuela Técnica Superior de Ingeniería InformáticaGranadaSpain
  2. 2.Department of InformaticsTechnological Educational Institute of ThessalonikiThessalonikiGreece
  3. 3.Department of Informatics XIUniversity of DortmundDortmundGermany
  4. 4.Department of Signal Theory and CommunicationsUniversidad Carlos IIIMadridSpain

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-44139-7
  • Online ISBN 978-3-540-45712-1
  • Series Print ISSN 0302-9743
  • About this book