Solving constraint satisfaction problems with heuristic-based evolutionary algorithms

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

Volumn 2, Issue , 2000, Pages 1571-1577

  Craenen, B G W ^a   Eiben, A E ^a   Marchiori, E ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS (CSP); EVOLUTIONARY ALGORITHMS; ADAPTIVE FITNESS; EVOLUTIONARY ALGORITHMS (EAS);

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; BENCHMARKING; CONSTRAINT SATISFACTION PROBLEMS; EXPERIMENTS;

PROBLEM SOLVING; EVOLUTIONARY ALGORITHMS;

EID: 0033671891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. J. Bowen and G. Dozier. Solving constraint satisfaction problems using a genetickystematic search hybride that realizes when to quit. In L.J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 122-129. Morgan Kaufmann, 1995.
2. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th IJCAI-91, volume 1, pages 331-337, Morgan Kaufmann, 1991. Morgan Kaufmann.
3. B.G.W. Craenen, A.E. Eiben, E. Marchiori, and A. Steenbeek. Combining local search and fitness function adaptation in a GA for solving binary constraint satisfaction problems. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), 2000.
4. G. Dozier, J. Bowen, and D. Bahler. Solving small and large constraint satisfaction problems using a heuristicbased microgenetic algorithm. In IEEE [ 141, pages 306-311.
5. G. Dozier, J. Bowen, and D. Bahler. Solving randomly generated constraint satisfaction problems using a micro-evolutionary hybrid that evolves a population of hill-climbers. In Proceedings of the 2nd IEEE Conference on Evolutionary Computation, pages 614-619. IEEE Press, 1995.
6. G. Dozier, J. Bowen, and A. Homaifar. Solving constraint satisfaction problems using hybrid evolutionary search. IEEE Transactions on Evolutionary Computation, 2( 1):23-33, 1998.
7. A.E. Eiben and J.K. van der Hauw. Adaptive penalties for evolutionary graph-coloring. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, editors, Artificial Evolution'97, number 1363 in LNCS, pages 95-106. Springer, Berlin, 1998.
8. 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.
9. A.E. Eiben, J.I. van Hemert, E. Marchiori, and A.G. Steenbeek. Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function. In A.E. Eiben, Th. Blck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of the 5th Conference on Parallel Problem Solving from Nature, number 1498 in Lecture Notes in Computer Science, pages 196-205, Berlin, 1998. Springer-Verlag.
10. A.E. Eiben, P-E. RauC, and Zs. Ruttkay. Heuristic genetic algorithms for constrained problems, part i: Principles. Technical Report IR-337, Free University Amsterdam, 1993.
11. A.E. Eiben, P-E. RauC, and Zs. Ruttkay. Solving constraint satisfaction problems using genetic algorithms. In IEEE [ 14], pages 542-547.
12. A.E. Eiben and Zs. Ruttkay. Self-adaptivity for constraint satisfaction: Learning penalty functions. In Proceedings of the 3rd IEEE Conference on Evolutionary Computation, pages 258-261. IEEE Press, 1996.
13. J.K. van der Hauw. Evaluating and improving steady state evolutionary algorithms on constraint satisfaction problems. Master's thesis, Leiden University, 1996. Also available as http://www.wi.leidenuniv.nl/MScThesis/IR96- 21.html.
14. Proceedings of the 1st IEEE Conference on Evolutionary Computation. IEEE Press, 1994.
15. Proceedings of the 4th IEEE Conference on Evolutionary Computation. IEEE Press, 1997.
16. K.A. De Jong. An analysis of the behaviour of a class of genetic adaptive systems. Doctoral Dissertation, University of Michigan, Dissertation Abstract International 36(10), 5140B, 1975.
17. E. Marchiori. Combining constraint processing and genetic algorithms for constraint satisfaction problems. In Th. Blck, editor, Proceedings of the 7th International Conference on Genetic Algorithms, pages 330-337. Morgan Kaufmann, 1997.
18. E. Marchiori. A simple heuristic based genetic algorithm for the maximum clique problem. In ACM Symposium on Applied Computing, pages 366-373. ACM Press, 1998.
19. E. Marchiori and A. Steenbeek. A genetic local search algorithm for random binary constraint satisfaction problems. In Proceedings of the ACM Symposium on Applied Computing, pages 458-462,2000.
20. Z. Michalewicz. Genetic Algorithms + Data structures = Evolution programs. Springer-Verlag, Berlin, 3rd edition, 1996.
21. P. Moms. The breakout method for escaping from local minima. In Proceedings of the 11th National Conference on Artificial Intelligence, AAA 1-93, pages 40-45. AAAI Pressme MIT Press, 1993.
22. J. Paredis. Co-evolutionary constraint satisfaction. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in Lecture Notes in Computer Science, pages 46-56, Berlin, 1994. Springer-Verlag.
23. J. Paredis. Co-evolutionary computation. ArtLjicial Life, 2(4):355-375,1995.
24. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109, 1996.
25. M.C. Riff-Rojas. Using the knowledge of the constraint network to design an evolutionary algorithm that solves CSP. In IEEE [ 15], pages 279-284.
26. M.C. Riff-Rojas. Evolutionary search guided by the constraint network to solve CSP. In IEEE [ 15], pages 337-348.
27. B.M. Smith. Phase transition and the mushy region in constraint satisfaction problems. In A.G. Cohn, editor, Proceedings of the 11th European Conference on Artficial Intelligence, pages 100-104, New York, 1994. John Wiley & Sons.
28. E. Tsang. Foundations of Constraint Satisfaction. Academic Press Ltd. 1993.
29. P. van Hentenryck, V. Saraswat, and Y. Deville. Constraint processing in cc(fd). In A. Podelski, editor, Constraint Programming: Basics and Trends. Springer-Verlag, 1995.
30. C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.