Evolutionary Algorithms The Role of Mutation and Recombination
Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in
- PDF / 54,459,702 Bytes
- 224 Pages / 441.96 x 668.04 pts Page_size
- 86 Downloads / 199 Views
Advisory Board: S. Amari G. Brassard M. Conrad K.A. De Jong C.e.A.M. Gielen T. Head L. Kari L. Landweber T. Martinetz Z. Michalewicz M.e. Mozer E. Oja J. Reif H. Rubin A. Salomaa M. Schoenauer H.-P. Schwefel D. Whitley E. Winfree J.M. Zurada
Springer-Verlag Berlin Heidelberg GmbH
William M. Spears
Evolutionary Algorithms The Role of Mutation and Recombination With 55 Figures and 23 Tables
Springer
Author Dr. William M. Spears AI Center - Code 5514 Naval Research Laboratory 4555 Overlook Avenue, S.w. Washington, DC 20375, USA [email protected]
Series Editors G. Rozenberg (Managing Editor) Th. Back, A.E. Eiben, J.N. Kok, H.P. Spaink Leiden Center for Natural Computing Leiden University Niels Bohrweg 1 2333 CA Leiden, The Netherlands [email protected] Library of Congress Cataloging-in-Publication Data Spears, William M., 1962Evolutionary algorithms: the role of mutation and recombination/William M. Spears. p.cm. - (Natural computing series) Includes bibliographical references and index. ISBN 978-3-642-08624-3 ISBN 978-3-662-04199-4 (eBook) DOI 10.1007/978-3-662-04199-4 I. Evolutionary programming (Computer science) 2. Computer algorithms. I. Title. II. Series. QA76.618. S64 2000 005.I-dc21
00-037327
ACM Computing Classification (1998): El.1, E2.2, 1.2.8, I.2.6, J.3 ISBN 978-3-642-08624-3 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-Verlag Berlin Heidelberg GmbH. Violations are liable for prosecution under the German Copyright Law. © Springer-Verlag Berlin Heidelberg 2000
Originally published by Springer-Verlag Berlin Heidelberg New York in 2000 Softcover reprint of the hardcover 1st edition 2000 The use of general descriptive 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: Klinkel + Lopka, Werbeagentur, Heidelberg Typesetting: Camera ready by the author SPIN 10755186 45/3142SR - 5 4 3 2 I 0 - Printed on acid-free paper
For Diana
Preface
Despite decades of work in evolutionary algorithms (EAs), much uncertainty remains about the advantages and disadvantages of using recombination or mutation. This book provides a theoretical and empirical study of recombination and mutation in EAs, in order to better characterize the roles of these operators. The main theme of the book is as follows. First, a static, component-wise analysis of recombination and mutation is performed. This analysis highlights some of the strengths and weaknesses of both operat
