Formal algorithms + formal representations = search strategies

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

Volumn 1141, Issue , 1996, Pages 366-375

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

^a Quadstone Ltd   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONCRETES; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

ABSTRACT REPRESENTATION; ARBITRARY PROBLEMS; FORMAL REPRESENTATIONS; PARAMETER OPTIMISATION; PROBLEM DOMAIN; REPRESENTATION SPACE; SEARCH STRATEGIES;

PROBLEM SOLVING;

EID: 84958950026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1001     Document Type: Conference Paper

References (21)

1. T. Back, F. Hoffmeister, and H.-P. Schwefel, 1991. A survey of evolution strategies. In Proceed­ings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo).
2. L. J. Eshelman and D. J. Schaffer, 1992. Real-coded genetic algorithms and interval schemata. In D. Whitley, editor, Foundations of Genetic Algorithms 2. Morgan Kaufmann (San Mateo, CA).
3. D. E. Goldberg, 1989. Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley (Reading, Mass).
4. D. E. Goldberg, 1990. Real-coded genetic algorithms, virtual alphabets, and blocking. Technical Report IlliGAL Report No. 90001, Department of General Engineering, University of Illinois at Urbana-Champaign.
5. J. J. Grefenstette, 1984. GENESIS: A system for using genetic search procedures. In Proceedings of the 1984 Conference on Intelligent Systems and Machines, pages 161-165.
6. J. H. Holland, 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press (Ann Arbor).
7. Z. Michalewicz, 1992. Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag (Berlin).
8. I. M. Oliver, D. J. Smith, and J. R. C. Holland, 1987. A study of permutation crossover operators on the travelling salesman problem. In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo).
9. N. J. Radcliffe and P. D. Surry, 1994a. Fitness variance of formae and performance prediction. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms III, pages 51-72. Morgan Kaufmann (San Mateo, CA).
10. N. J. Radcliffe and P. D. Surry, 1994b. Formal memetic algorithms. InT. C. Fogarty, editor, Evo­lutionary Computing: AISB Workshop, pages 1-16. Springer-Verlag, Lecture Notes in Computer Science 865.
11. N. J. Radcliffe and P. D. Surry, 1995. Fundamental limitations on search algorithms: Evolution­ary computing in perspective. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science, Volume 1000, pages 275-291. Springer-Verlag (New York).
12. N. J. Radcliffe, 1991a. Equivalence class analysis of genetic algorithms. Complex Systems, 5(2): 183-205.
13. N. J. Radcliffe, 1991b. Forma analysis and random respectful recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 222-229. Morgan Kaufmann (San Mateo).
14. N. J. Radcliffe, 1992. Genetic set recombination. In D. Whitley, editor, Foundations of Genetic Algorithms 2. Morgan Kaufmann (San Mateo, CA).
15. N. J. Radcliffe, 1994. The algebra of genetic algorithms. Annals of Maths and Artificial Intelli­gence, 10:339-384.
16. P. D. Surry and N. J. Radcliffe, 1996. A formalism for real-parameter evolutionary algorithms and directed recombination. In submitted to Foundations of Genetic Algorithms IV. (San Diego).
17. G. Syswerda, 1989. Uniform crossover in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann (San Mateo).
18. M. D. Vose and G. E. Liepins, 1991. Schema disruption. In Proceedings of the Fourth Interna­tional Conference on Genetic Algorithms, pages 237-243. Morgan Kaufmann (San Mateo).
19. D. Whitley, T. Starkweather, and D. 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).
20. N. Wirth, 1976. Algorithms + Data Structures = Programs. Prentice-Hall (Englewood Cliffs, NJ).
21. D. H. Wolpert and W. G. Macready, 1995. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute.