Solving CSP instances beyond the phase transition using stochastic search algorithms

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

Volumn 1917, Issue , 2000, Pages 549-558

  Schoofs, Luk ^a   Naudts, Bart ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; STOCHASTIC SYSTEMS;

HYBRID FUNCTIONS; NEW FUNCTIONS; PENALTY FUNCTION; PROBLEM INSTANCES; SEARCH ALGORITHMS; STATE-OF-THE-ART ALGORITHMS; STOCHASTIC SEARCH ALGORITHMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947934970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_54     Document Type: Conference Paper

References (15)

1. [1] S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithm. In A. Prieditis and S. Russel, editors, Proceedings of ICML95, pages 38-46. Morgan Kaufmann Publishers, 1995.
2. [2] J. Bowen and G. Dozier. Solving constraint satisfaction problems using a genetic/systematic search hybrid that realizes when to quit. In Larry J. Es-helman, editor, Proceedings of the 6th international conference on Genetic Algorithms, pages 122-128, 1995.
3. [3] J. S. De Bonet, C. L. Isbell, and P. Viola. MIMIC: Finding optima by estimating probability densities. In M. Mozer, M. Jordan, and Th. Petsche, editors, Advances in Neural Information Processing Systems 9, pages 424-431. MIT Press, 1997.
4. [4] F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
5. [5] D. E. Goldberg. Simple genetic algorithms and the minimal deceptive problem. In Davis L., editor, Genetic algorithms and simulated annealing, pages 74-88. Morgan Kaufmann Publishers, 1987.
6. [6] J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, 1975.
7. [7] V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(l):32-44, 1992.
8. [8] Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, New-York, 1996. 3rd edition.
9. [9] H. Mühlenbein, Th. Mahnig, and A. Ochoa Rodriguez. Schemata, distributions and graphical models in evolutionary optimization. Technical report, RWCP Theoretical Foundations GMD Laboratory, 1999.
10. [10] J. Paredis. Coevolutionary constraint satisfaction. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, pages 46-55. Springer Verlag, 1994.
11. [11] P. Prosser. An emperical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81-110, 1996.
12. [12] P. Ross and E. Hart. An adaptive mutation scheme for a penalty-based graph-coloring GA. In A. E. Eiben, Th. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of the 5th Conference on Parallel Problem Solving from Nature, pages 795-802. Springer Verlag, LNCS 1498, 1998.
13. [13] L. Schoofs and B. Naudts. Ant colonies are good at solving constraint satisfaction problems. In Proceedings of the 2000 Congress on Evolutionary Computation. IEEE press, 2000.
14. [14] G. Syswerda. A study of reproduction in generational and steady state genetic algorithm. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms, pages 94-101. Morgan Kaufmann Publishers, 1991.
15. [15] E. Tsang. Foundations of Constraint Satisfaction. Academic Press Ltd, 1993.