Bioinspired Computation in Combinatorial Optimization Algorithms and

Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational comp

  • PDF / 3,031,203 Bytes
  • 215 Pages / 439.37 x 666.142 pts Page_size
  • 16 Downloads / 253 Views

DOWNLOAD

REPORT


Advisory Board: S. Amari G. Brassard K.A. De Jong C.C.A.M. Gielen T. Head L. Kari L. Landweber T. Martinetz Z. Michalewicz M.C. Mozer E. Oja G. P˘aun J. Reif H. Rubin A. Salomaa M. Schoenauer H.-P. Schwefel C. Torras D. Whitley E. Winfree J.M. Zurada

For further volumes: www.springer.com/series/4190

Frank Neumann

r

Carsten Witt

Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity

Dr. Frank Neumann Max Planck Institute for Informatics Dept. of Algorithms and Complexity Campus E14 66123 Saarbrücken Germany [email protected]

Dr. Carsten Witt Technical University of Denmark Dept. of Informatics and Mathematical Modelling Richard Petersens Plads 2800 Kgs. Lyngby Denmark [email protected]

Series Editors G. Rozenberg (Managing Editor) [email protected] Th. Bäck, J.N. Kok, H.P. Spaink Leiden Center for Natural Computing Leiden University Niels Bohrweg 1 2333 CA Leiden, The Netherlands A.E. Eiben Vrije Universiteit Amsterdam The Netherlands

ISSN 1619-7127 ISBN 978-3-642-16543-6 e-ISBN 978-3-642-16544-3 DOI 10.1007/978-3-642-16544-3 Springer Heidelberg Dordrecht London New York ACM Computing Classification (1998): F.2, G.1, G.2, I.2 © Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, 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. Cover design: KünkelLopka GmbH, Heidelberg Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)

To Aneta, Linda, Michelle and Ying

Foreword

Bioinspired computing is successful in practice. Over the past decade a body of theory for bioinspired computing has been developed. The authors have contributed significantly to this body and give a highly readable account of it. (Kurt Mehlhorn, Max Planck Institute for Informatics, and Saarland University, Germany) Bioinspired algorithms belong to the most powerful methods used to tackle real world optimization problems. This book gives such algorithms a solid foundation. It presents some of the most exciting results that have been obtained in bioinspired computing in the last decade. (Zbigniew Michalewicz, University of Adelaide, Australia) This book presents a most welcome theoretical computer science approach and perspective to the design and analysis of discrete ev