The effects of partial restarts in evolutionary search

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

Volumn 2310, Issue , 2002, Pages 117-127

  La Tendresse, Ingo ^a   Gottlieb, Jens ^b   Kao, Odej ^a  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIVERSITY MANAGEMENTS; EVOLUTIONARY SEARCH; POPULATION DIVERSITY; PROBLEM DOMAIN; PROBLEM STRUCTURE; SATISFIABILITY PROBLEMS; SIMPLE APPROACH; TIME INTERVAL;

EVOLUTIONARY ALGORITHMS;

EID: 84959056022     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46033-0_10     Document Type: Conference Paper

References (16)

1. [BEV98] T. Bäck, A. E. Eiben, and M. E. Vink. A Superior Evolutionary Algorithm for 3-SAT. In Proceedings of the 7th Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, Volume 1477, 125 – 136, Springer, 1998
2. [BFM97] T. Bäck, D. B. Fogel, and Z. Michalewicz (eds.): Handbook of Evolutionary sComputation, Oxford University Press, 1997
3. [ES91] L.J. Eshelman, J.D. Schaffer: Preventing Premature Convergence in Genetic Algorithms by Preventing Incest, Proceedings of the Fourth International Conference on Genetic Algorithms, 115 – 122, 1991
4. [Esh91] L. Eshelman, The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination, In G. Rawlins, editor, FOGA -1, pages 265–283. Morgan Kaufmann, 1991
5. [GJ79] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA, 1979
6. [Gol89] D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989
7. [GV00] J. Gottlieb and N. Voss. Adaptive Fitness Functions for the Satisfiability Problem. In Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Volume 1917, 621 – 630, Springer, 2000
8. [Hoo98] H. H. Hoos. Stochastic Local Search – Methods, Models, Applications. Dissertation, Darmstadt University of Technology, 1998
9. [Mah92] S. W. Mahfoud. Crowding and Preselection Revisited. In Proceedings of the 2nd Conference on Parallel Problem Solving From Nature, North- Holland, 27 – 36, 1992
10. [MDG+95] J. Maresky, Y. Davidor, D. Gitler, G. Aharoni, A. Barak. Selectively Destructive Re-start. In Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 144–150, 1995
11. [MR99] E. Marchiori and C. Rossi. A Flipping Genetic Algorithm for Hard 3-SAT Problems. In Proceedings of the Genetic and Evolutionary Computation Conference, 393 – 400, Morgan Kaufmann, 1999
12. [MSL92] D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, 459 – 465, 1992
13. [Ree00] C. R. Reeves. Fitness Landscapes and Evolutionary Algorithms. In Proceedings of Artificial Evolution, Lecture Notes in Computer Science, Volume 1829, 3 – 20, Springer, 2000
14. [RG99] G. R. Raidl and J. Gottlieb. On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms. In Late- Breaking Papers at the Genetic and Evolutionary Computation Conference, 204 - 211, 1999
15. [RW98] S. Rana and D. Whitley. Genetic Algorithm Behavior in the MAXSAT Domain. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Volume 1498, 785 – 794, Springer, 1998
16. [SGS00] J. Singer, I. P. Gent, and A. Smaill. Backbone Fragility and the Local Search Cost Peak. Journal of Artificial Intelligence Research. Volume 12, 235 – 270, 2000