Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction

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

Volumn 2439, Issue , 2002, Pages 23-32

  van Hemert, Jano I ^a   Bäck, Thomas ^a,b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b NuTech Solutions GmbH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; EVOLUTIONARY ALGORITHMS;

BINARY CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION; DISTINCT POINTS; GAIN INSIGHT; MUTATION OPERATORS; MUTATION RATES; SEARCHED SPACE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048835884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45712-7_3     Document Type: Conference Paper

References (10)

1. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy, and Y.C. Stamatiou. Random constraint satisfaction a more accurate picture. In G. Smolka, editor, Principles and Practice of Constraint Programming — CP97, pages 107–120. Springer-Verlag, 1997.
2. T. Bäck. The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. In R. Manner and B. Manderick, editors, Parallel Problem Solving from Nature II, pages 85–94. Springer, 1992.
3. S.H. Clearwater and T. Hogg. Problem structure heuristics and scaling behavior for genetic algorithms. Journal of Artificial Intelligence, 81:327–347, 1996.
4. A.E. Eiben, E.H.L. Aarts and K.M. Van Hee. Global convergence of genetic algorithms: an infinite markov chain analysis. In Proceedings of the First International Conference on Parallel Problem Solving from Nature, pages 4–12. Springer, Berlin, 1991.
5. A.E. Eiben, J.K. van der Hauw, and J.I. van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4(1):25–46, 1998.
6. E. Marchiori and A. Steenbeek. A genetic local search algorithm for random binary constraint satisfaction problems. In ACM Symposium on Applied Computing, pages 458–462, 2000.
7. H. Mühlenbein. How genetic algorithms really work: Mutation and hill-climbing. In R. Manner and B. Manderick, editors, Parallel Problem Solving from Nature II, pages 15–25. Springer, 1992.
8. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
9. J.I. van Hemert. Documentation of the RandomCsp library. Leiden University, randomcsp version 1.5 edition, 2001. Available from http://www.liacs.nl/˜jvhemert/randomcsp.
10. D. Whitley. The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J. David Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms (ICGA’89), pages 116–123, San Mateo, California, 1989. Morgan Kaufmann Publishers, Inc.