Formal Memetic Algorithms

A formal, representation-independent form of a memetic algorithm—a genetic algorithm incorporating local search—is introduced. A generalised form of N-point crossover is defined together with representation-independentpatching and hill-climbing operators. The resulting formal algorithm is then constructed and tested empirically on the travelling sales-rep problem. Whereas the genetic algorithms tested were unable to make good progress on the problems studied, the memetic algorithms performed very well.

[1]  Emile H. L. Aarts,et al.  Parallel Local Search and the Travelling Salesman Problem , 1992, Parallel Problem Solving from Nature.

[2]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[3]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[4]  Eugene L. Lawler,et al.  The travelling salesman problem (A guided tour of combinatorial optimisation ), edited by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys. Pp 465. £39·95. 1985. ISBN 0-471-90413-9 (Wiley) , 1986, The Mathematical Gazette.

[5]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[8]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[9]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[10]  R. Lewontin.  ‘The Selfish Gene’ , 1977, Nature.

[11]  Patrick D. Surry,et al.  RPL2: A Language and Parallel Framework for Evolutionary Computing , 1994, PPSN.

[12]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[13]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[14]  Pablo Moscato.  A memetic approach for the travelling salesman problem implementation of a computational ecology for , 1992 .

[15]  Nicholas J. Radcliffe,et al.  Genetic Set Recombination , 1992, FOGA.

[16]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[17]  Patrick D. Surry,et al.  Fitness Variance of Formae and Performance Prediction , 1994, FOGA.

[18]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[19]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .