Formal memetic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 865 LNCS, Issue , 1994, Pages 1-16

  Radcliffe, Nicholas J ^a   Surry, Patrick D ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HILL-CLIMBING OPERATORS; LOCAL SEARCH; MEMETIC ALGORITHMS;

GENETIC ALGORITHMS;

EID: 84978316287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58483-8_1     Document Type: Conference Paper

References (17)

1. D. H. Ackley, 1987. A connectionist machine for genetic hillclimbing. Kluwer Academic Press, Boston.
2. Thomas Bäck, Frank Hoffmeister, and Hans-Paul Schwefel, 1991. A survey of evolution strategies. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo).
3. Lawrence Davis, 1991. Handbook of Genetic Algorithms. Van Nostrand Reinhold (New York).
4. Richard Dawkins, 1976. The Selfish Gene. Oxford University Press (Oxford).
5. Martina Gorges-Schleuter, 1989. ASPARAGOS: an asynchronous parallel genetic optimization strategy. In Proceedings of the Third International Conference on Genetic Algorithms, pages 422-427. Morgan Kaufmann (San Mateo).
6. John H. Holland, 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press (Ann Arbor).
7. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, 1985. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimisation. Wiley.
8. Pablo Moscato and Michael G. Norman, 1992. A “memetic” approach for the travelling salesman problem - implementation of a computational ecology for combinatorial optimisation on message-passing systems. In Proceedings of the International Conference on Parallel Computing and Transputer Applications. IOS Press (Amsterdam).
9. H. Mühlenbein, 1989. Parallel genetic algorithms, population genetics and combinatorial optimization. In Proceedings of the Third International Conference on Genetic Algorithms, pages 416-421. Morgan Kaufmann (San Mateo).
10. Heinz Mühlenbein, 1992. How genetic algorithms really work. part I: Mutation and hillclimbing. In R. MÄnner and B. Manderick, editors, Parallel Problem Solving from Nature, 2. Elsevier Science Publishers/North Holland (Amsterdam).
11. Nicholas J. Radcliffe, 1991. Equivalence class analysis of genetic algorithms. Complex Systems, 5(2):183-205.
12. Nicholas J. Radcliffe, 1992. Genetic set recombination. In Darrell Whitley, editor, Foundations of Genetic Algorithms 2. Morgan Kaufmann (San Mateo, CA).
13. Nicholas J. Radcliffe, 1994a. The algebra of genetic algorithms. To appear in Annals of Maths and Artificial Intelligence.
14. Nicholas J. Radcliffe, 1994b. Fitness variance of formae and performance prediction. Technical report, To appear in Foundations of Genetic Algorithms 3. Gerhard Reinelt, 1990. TSPLIB.
15. Patrick D. Surry and Nicholas J. Radcliffe, 1994. RPL2: A language and parallel framework for evolutionary computing. In Parallel Problem Solving from Nature 3 (to appear).
16. M. G. A. Verhoeven, E. H. L. Aarts, E. van de Sluis, and R. J. M. Vaessens, 1992. Parallel local search and the travelling salesman problem. In R. Männer and B. Manderick, editors, Parallel Problem Solving From Nature, 2, pages 543-552. Elsevier Science Publishers/North Holland (Amsterdam).
17. Darrell Whitley, Timothy Starkweather, and D’Ann Fuquay, 1989. Scheduling problems and traveling salesmen: The genetic edge recombination operator. In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo).