Evolutionary Algorithms and Other Randomized Search Heuristics
In our description of evolutionary algorithms we make use of terms that stem from biology, hinting at the roots of evolutionary algorithms. We adhere to these standard notions as long as they do not collide with standard notions in computer science. Evolu
- PDF / 2,495,232 Bytes
- 262 Pages / 439.36 x 666.15 pts Page_size
- 78 Downloads / 183 Views
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: http://www.springer.com/series/4190
Thomas Jansen
Analyzing Evolutionary Algorithms The Computer Science Perspective
123
Thomas Jansen Department of Computer Science University College Cork Cork Ireland Series Editors G. Rozenberg (Managing Editor) Th. B¨ack, J.N. Kok, H.P. Spaink Leiden Center for Natural Computing Leiden University Leiden, The Netherlands A.E. Eiben Vrije Universiteit Amsterdam The Netherlands
ISSN 1619-7127 Natural Computing Series ISBN 978-3-642-17338-7 DOI 10.1007/978-3-642-17339-4 Springer Heidelberg New York Dordrecht London
ISBN 978-3-642-17339-4 (eBook)
Library of Congress Control Number: 2012954385 ACM Computing Classification: F.2, F.1, G.1, I.2 c Springer-Verlag Berlin Heidelberg 2013 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)
I dedicate this book to Ingo Wegener, my Doktorvater.
Preface
Evolutionary algorithms are general randomized search heuristics, inspired by the concept of natural evolution. They are easy to implement and easy to apply, thought
Data Loading...
