Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems

IEEE Transactions on Evolutionary Computation

Volumn 7, Issue 5, 2003, Pages 424-444

  Craenen, B G W ^a   Eiben, A E ^a   Van Hemert, J I ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b National Research Institute for Mathematics and Computer Science   (Netherlands)

Author keywords

Adaptivity; Constraint satisfaction problems; Evolutionary algorithms; Heuristics; Problem instance generator

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

ADAPTIVITY;

EVOLUTIONARY ALGORITHMS;

EID: 0142227015     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2003.816584     Document Type: Review

References (76)

1. M. Schoenauer and S. Xanthakis, "Constrained GA optimization," in Proc. 4th Int. Conf. Genetic Algorithms, R. Belew and L. Booker, Eds., 1991, pp. 573-580.
2. Z. Michalewicz and N. Attia, "Evolutionary optimization of constrained problems," in Proc. 3rd Annual Conf. Evolutionary Programming, A. Sebald and L. Fogel, Eds., 1994, pp. 98-108.
3. Z. Michalewicz, "A survey of constraint handling techniques in evolutionary computation methods," in Proc. 4th Annual Conf. Evolutionary Programming, J. McDonnell, R. Reynolds, and D. Fogel, Eds., 1995, pp. 135-155.
4. _, "Genetic algorithms, numerical optimization, and constraints," in Proc. 6th Int. Conf. Genetic Algorithms, L. Eshelman, Ed., 1995, pp. 151-158.
5. Z. Michalewicz and M. Schoenauer, "Evolutionary algorithms for constrained parameter optimization problems," J. Evol. Comput., vol. 4, no. 1, pp. 1-32, 1996.
6. Z. Michalewicz and M. Schmidt, "TCG-2: A test-case generator for nonlinear parameter optimization techniques," in Advances in Evolutionary Computating: Theory and Applications, A. Ghosh and S. Tsutsui, Eds. New York: Springer-Verlag, 2003, pp. 193-212.
7. Z. Michalewicz, K. Deb, M. Schmidt, and T. Stidsen, "Test-case generator for nonlinear continuous parameter optimization techniques," IEEE Trans. Evol. Comput., vol. 4, pp. 197-215, Sept. 2000.
8. A. Eiben, "Evolutionary algorithms and constraint satisfaction: Definitions, survey, methodology, and research directions," in Theoretical Aspects of Evolutionary Computating, L. Kallel, B. Naudts, and A. Rogers, Eds. New York: Springer-Verlag, 2001, pp. 13-58. ser. Natural Computing.
9. B. Craenen, A. Eiben, E. Marchiori, B. Craenen, A. Eiben, and E. Marchiori, How to Handle Constraints with Evolutionary Algorithms, 2nd ed. London, U.K.: Chapman & Hall, 2001, vol. 1, pp. 341-361.
10. D. Whitley, "Permutations," in Evolutionary Computation 1: Basic Algorithms and Operators, T. Bäck, D. Fogel, and Z. Michalewicz, Eds: Institute of Physics Publishing, 2000, ch. 33.3, pp. 274-284.
11. T. Runnarson and X. Yao, "Constrained evolutionary optimization - the penalty function approach," in Evolutionary Optimization, R. Sarker, M. Mohammadian, and X. Yao, Eds. Norwell, MA: Kluwer, 2002, ch. 4, pp. 87-113.
12. J. Richardson, M. Palmer, G. Liepins, and M. Hilliard, "Some guidelines for genetic algorithms with penalty functions," in Proc. 3rd Int. Conf. Genetic Algorithms, J. Schaffer, Ed., 1989, pp. 191-197.
13. Z. Michalewicz and M. Michalewicz, "Pro-life versus pro-choice strategies in evolutionary computation techniques," in Computational Intelligence: A Dynamic System Perspective, M. Palaniswami, Y. Attikiouzel, R. Marks, D. Fogel, and T. Fukuda, Eds., 1995, pp. 137-151.
14. A. Eiben, E. Aarts, K. van Hee, and W. Nuijten, "A unifying view on heuristic search," Ann. Oper. Res., vol. 55, pp. 81-99, 1995.
15. A. Hertz and D. Kobler, "A framework for the description of evolutionary algorithms," Eur. Oper. Res., vol. 126, pp. 1-12, 2000.
16. M. Riff-Rojas, "Using the knowledge of the constraint network to design an evolutionary algorithm that solves CSP," in Proc. 3rd IEEE Conf. Evolutionary Computation, 1996, pp. 279-284.
17. _, "Evolutionary search guided by the constraint network to solve CSP," in Proc. 4th IEEE Conf. Evolutionary Computation, 1997, pp. 337-348.
18. M.-C. R. Rojas, "A network-based adaptive evolutionary algorithm for constraint satisfaction problems," Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 325-339, 1998.
19. J. Paredis, "Coevolutionary constraint satisfaction," in Proc. 3rd Conf. Parallel Problem Solving from Nature, Y. Davidor, H.-P. Schwefel, and R. Männer, Eds., 1994, pp. 46-55. ser. Lecture Notes in Computer Science.
20. _, "Co-evolutionary computation," Artif. Life, vol. 2, no. 4, pp. 355-375, 1995.
21. H. Handa, C. O. Katai, N. Baba, and T. Sawaragi, "Solving constraint satisfaction problems by using coevolutionary genetic algorithms," in Proc. 5th IEEE Conf. Evolutionary Computation, 1998, pp. 21-26.
22. H. Handa, N. Baba, O. Katai, T. Sawaragi, and T. Horiuchi, "Genetic algorithm involving coevolution mechanism to search for effective genetic information," in Proc. 4th IEEE Conf. Evolutionary Computation, Apr. 1997, pp. 709-714.
23. E. Marchiori, "Combining constraint processing and genetic algorithms for constraint satisfaction problems," in Proc. 7th Int. Conf. Genetic Algorithms, T. Bäck, Ed., 1997, pp. 330-337.
24. A. Eiben, P.-E. Raué, and Z. Ruttkay, "Heuristic Genetic Algorithms for Constrained Problems, Part I: Principles," Vrije Universiteit Amsterdam, The Netherlands, Tech. Rep. IR-337, 1993.
25. _, "Solving constraint satisfaction problems using genetic algorithms," in Proc. 1st IEEE Conf. Evolutionary Computation, 1994, pp. 542-547.
26. G. Dozier, J. Bowen, and D. Bahler, "Solving small and large constraint satisfaction problems using a heuristic-based microgenetic algorithm," in Proc. 1st IEEE Conf. Evolutionary Computation, 1994, pp. 306-311.
27. J. Bowen and G. Dozier, "Solving constraint satisfaction problems using a genetic/systematic search hybride that realizes when to quit," in Proc. 6th Int. Conf. Genetic Algorithms, L. Eshelman, Ed., 1995, pp. 122-129.
28. 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 Proc. 2nd IEEE Conf. Evolutionary Computation, 1995, pp. 614-619.
29. T. Bäck, A. Eiben, and M. Vink, "A superior evolutionary algorithm for 3-SAT," in Proc. 7th Annual Conf. Evolutionary Programming, V. Porto, N. Saravanan, D. Waagen, and A. Eiben, Eds., 1998, pp. 125-136. ser. Lecture Notes in Computer Science.
30. A. Eiben, J. van der Hauw, and J. van Hemert, "Graph coloring with adaptive evolutionary algorithms," J. Heuristics, vol. 4, no. 1, pp. 25-46, 1998.
31. A. Eiben and J. I. van Hemert, "SAW-ing EAs: Adapting the fitness function for solving constrained problems," in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. New York: McGraw-Hill, 1999, pp. 389-402.
32. B. Craenen, A. Eiben, and E. Marchiori, "Solving constraint satisfaction problems with heuristic-based evolutionary algorithms," in Proc. Congress Evolutionary Computation 2000, July 2000, pp. 1571-1577.
33. E. Marchiori and A. Steenbeek, "Genetic local search algorithm for random binary constraint satisfaction problems," presented at the ACM Symp. Applied Computing, 2000.
34. B. Craenen, A. Eiben, E. Marchiori, and A. Steenbeek, "Combining local search and fitness function adaptation in a GA for solving binary constraint satisfaction problems," in Proc. Genetic and Evolutionary Computation Conf. (GECCO-2000), D. Whitley, D. Goldberg, E. Cantú-Paz, L. Spector, I. Parmee, and H.-G. Beyer, Eds. San Francisco, CA, 2000.
35. P. van Hentenryck, V. Saraswat, and Y. Deville, "Constraint processing in cc(FD)," in Constraint Programming: Basics and Trends, A. Podelski, Ed. Berlin, Germany: Springer-Verlag, 1995.
36. J. Paredis, Coevolving cellular automata: Be aware of the red queen, in Proc. 7th Int. Conf. Genetic Algorithms, T. Bäck, Ed., San Francisco, CA, 1997.
37. A. Eiben, J. van Hemert, E. Marchiori, and A. Steenbeek, "Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function," in Proc. 5th Conf. Parallel Problem Solving from Nature, A. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, Eds., 1998, pp. 196-205. ser. Lecture Notes in Computer Science.
38. J. van Hemert, "Applying Adaptive Evolutionary Algorithms to Hard Problems," Master's thesis, Leiden Univ., Leiden, The Netherlands. [Online]. Available: http://www.liacs.nl/̃jvhemert/publications/IR-98-19.ps.gz, 1998.
39. D. Whitley, "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best," in Proc. 3rd Int. Conf. Genetic Algorithms, J. Schaffer, Ed., 1989, pp. 116-123.
40. L. Booker, "Improving search in genetic algorithms," in Genetic Algorithms and Simulated Annealing. San Mateo, CA: Morgan Kaufmann, 1987, pp. 61-73.
41. P. J. Stuckey and V. Tam, "Improving evolutionary algorithms for efficient constraint satisfaction," Int. J. Artif. Intell. Tools, vol. 8, no. 4, pp. 363-384, 1999.
42. P. Morris, "The breakout method for escaping from local minima," in Proc. 11th National Conf. Artificial Intelligence, 1993, AAAI-93, pp. 40-45.
43. G. Dozier, J. Bowen, and A. Homaifar, "Solving constraint satisfaction problems using hybrid evolutionary search," Trans. Evol. Comput., vol. 2, pp. 23-33, Apr. 1998.
44. A. Eiben and J. van der Hauw, "Adaptive penalties for evolutionary graph-coloring," in Artificial Evolution'97, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, Eds, Berlin: Springer-Verlag, 1998, pp. 95-106. ser. Lecture Notes in Computer Science.
45. J. van der Hauw, "Evaluating and Improving Steady State Evolutionary Algorithms on Constraint Satisfaction Problems," Master's thesis, Leiden Univ., Leiden, The Netherlands. [Online]. Available: http://www.liacs.nl/MScThesis/IR96-21.html, 1996.
46. Practical Handbook of Genetic Algorithms, L. Chambers, Ed., CRC Press, Boca Raton, FL, 1995, pp. 307-365.
47. A. Eiben and Z. Ruttkay, "Self-adaptivity for constraint satisfaction: Learning penalty functions," in Proc. 3rd IEEE Conf. Evolutionary Computation, 1996, pp. 258-261.
48. B. Craenen and A. Eiben, "Stepwise adaption of weights with refinement and decay on constraint satisfaction problems," in Proc. Genetic and Evolutionary Computation Conf., GECCO-2001, L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, Eds., 2001, pp. 291-298.
49. J. Gottlieb, E. Marchiori, and C. Rossi, "Evolutionary algorithms for the satisfiability problem," J. Evolut. Comput., vol. 10, pp. 35-50, 2002.
50. F. Rossi, C. Petrie, and V. Dhar, "On the equivalence of constraint satisfaction problems," in Proc. 9th European Conf. Artificial Intelligence ECAI'90, L. C. Aiello, Ed., 1990, pp. 550-556.
51. N. Barnier and P. Brisset, "Optimization by hybridation of a genetic algorithm with constraint satisfaction techniques," in Proc. 5th IEEE Conf. Evolutionary Computation, 1998, pp. 645-649.
52. Documentation for the RandomCsp Library, J. van Hemert. (2002). [Online]. Available: http://freshmeat.net/projects/randomcsp
53. _, "Application of Evolutionary Computation to Constraint Satisfaction and Data Mining," Ph.D. dissertation, Leiden Univ., Leiden, The Netherlands, 2002.
54. CSP Problem Instances Using Model E (2002). [Online]. Available: http://www.cs.vu.nl/̃bcraenen/resources/csps_modelE_v20_d20.tar.gz
55. P. Prosser, "An empirical study of phase transitions in binary constraint satisfaction problems," J. Artif. Intell., vol. 81, pp. 81-109, 1996.
56. B. Smith and M. Dyer, "Locating the phase transition in binary constraint satisfaction problems," J. Artif. Intell., vol. 81, no. 1-2, pp. 155-181, 1996.
57. D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, and Y. Stamatiou, "Random constraint satisfaction: A more accurate picture," Constraints, vol. 4, no. 6, pp. 329-344, 2001.
58. E. MacIntyre, P. Prosser, B. Smith, and T. Walsh, "Random constraint satisfaction: Theory meets practice," in Principles and Practice of Constraint Programming - CP98, M. Maher and J.-F. Puget, Eds. Berlin, Germany: Springer-Verlag, 1998, pp. 325-339.
59. C. Williams and T. Hogg, "Exploiting the deep structure of constraint problems," J. Artif. Intell., vol. 70, pp. 73-117, 1994.
60. B. Smith, "In Search of Exceptionally Difficult Constraint Satisfaction Problems," Univ. Leeds, Leeds, U.K., Tech. Rep. RR 94.2, 1994.
61. _, "The Phase Transition in Constraint Satisfaction Problems: A Closer Look at the Mushy Region," Univ. Leeds, Leeds, U.K., Tech. Rep. RR 93.41, 1994.
62. B. Smith and S. Grant, "Modeling exceptionally hard constraint satisfaction problems," in Principles and Practice of Constraint Programming - CP97, G. Smolka, Ed. Berlin, Germany: Springer-Verlag, 1997, pp. 182-195. ser. Lecture Notes in Computer Science.
63. B. Smith, "Phase transition and the mushy region in constraint satisfaction problems," in Proc. 11th Euro. Conf. Artificial Intelligence, A. Cohn, Ed., 1994, pp. 100-104.
64. J. van Hemert, "Comparing classical methods for solving binary constraint satisfaction problems with state of the art evolutionary computation," in Applications of Evolutionary Computing, Proceedings of EvoWorkshops2002: EvoCOP, EvoIASP, EvoSTim, ser. LNCS, S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, and G. Raidl, Eds. Kinsale, Ireland: Springer-Verlag, Apr. 3-4, 2002, vol. 2279, pp. 81-90.
65. A. Feelders and W. Verkooijen, "Which method learns the most data? Methodological issues in the analysis of comparative studies," in Proc. 5th Int. Workshop on Artificial Intelligence and Statistics (Preliminary Papers), Jan. 1995, pp. 219-225.
66. E. Korn and B. Graubard, "Simultaneous testing of regression coefficients with complex survey data: Use of bonferroni t statistics," The Amer. Statistician, vol. 44, pp. 270-276, 1990.
67. R. Haralick and G. Elliot, "Increasing tree search efficiency for constraint-satisfaction problems," Artif. Intell., vol. 14, no. 3rd, pp. 263-313, 1980.
68. P. Prosser, "Hybrid algorithms for the constraint satisfaction problem," Comput. Intell., vol. 9, no. 3, pp. 268-299, Aug. 1993.
69. J. Culberson and F. Luo, Exploring the k-colorable landscape with iterated greedy, in Second DIMACS Challenge, M. Tricj and D. Johnson, Eds., 1996. Series in Discrete Mathematics and Theoretical Computer Science, AMS, [Online]. Available: http://web.cs.ualberta.ca/̃joe/.
70. Proc. 1st IEEE Conf. Evolutionary Computation, IEEE Computer Society Press, 1994.
71. Proc. 5th IEEE Conf. Evolutionary Computation, IEEE Computer Society Press, 1998.
72. L. Eshelman, Ed., Proc. 6th Int. Conf. Genetic Algorithms: Morgan Kaufmann, 1995.
73. Proc. 3rd IEEE Conf. Evolutionary Computation, IEEE Computer Society Press, 1996.
74. Proc. 4th IEEE Conf. Evolutionary Computation, IEEE Computer Society Press, 1997.
75. T. Bäck, Ed., Proc. 7th Int. Conf. Genetic Algorithms. San Francisco, CA: Morgan Kaufmann, 1997.
76. J. Schaffer, Ed., Proc. 3rd Int. Conf. Genetic Algorithms. San Mateo, CA: Morgan Kaufmann Publishers, Inc., 1989.