How to handle constraints with evolutionary algorithms

The Practical Handbook of Genetic Algorithms: Applications, Second Edition

Volumn , Issue , 2000, Pages 341-362

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

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING; SURVEYS;

CONSTRAINT HANDLING; CONSTRAINT SATISFACTION; EFFECTIVE CONSTRAINTS; EVOLUTIONARY ALGORITHMS (EAS); FITNESS FUNCTIONS; GENETIC OPERATORS; OBJECTIVE FUNCTIONS; RESEARCH METHODOLOGIES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 85060258475     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (50)

1. Genetic Algorithms, San Francisco, CA, 1997. Morgan Kaufmann.
2. Th. Bäck, A.E. Eiben, and M.E. Vink. A superior evolutionary algorithm for 3-SAT. In V.W. Porto, N. Saravanan, D. Waagen, and A.E. Eiben, editors, Proceedings of the 7th Annual Conference on Evolutionary Programming, number 1477 in Lecture Notes in Computer Science, pages 125-136, Berlin, 1998. Springer-Verlag.
3. R.K. Belew and L.B. Booker, editors. Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann, 1991.
4. J. Bowen and G. Dozier. Solving constraint satisfaction problems using a genetic/systematic search hybride that realizes when to quit. In Eshelman [19], pages 122-129.
5. P. Cheeseman, B. Kenefsky, and W.M. Taylor. Where the really hard problems are. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th IJCAI, pages 331-337. Morgan Kaufmann, 1991.
6. A.G. Cohn, editor. Proceedings of the 11th European Conference on Artificial Intelligence, New York, NY, 1994. John Wiley & Sons.
7. G. Dozier, J. Bowen, and D. Bahler. Solving small and large constraint satisfaction problems using a heuristic-based microgenetic algorithm. In IEEE [26], pages 306-311.
8. 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 Computer Society Press, 1995.
9. J. Eggermont, A.E. Eiben, and J.I. van Hemert. Adapting the fitness function in GP for data mining. In R. Poli, P. Nordin, W.B. Langdon, and T.C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP'99, volume 1598 of Lecture Notes in Computer Science, pages 195-204. Springer-Verlag, 1999.
10. A.E. Eiben and J.K. van der Hauw. Solving 3-SAT with adaptive genetic algorithms. In IEEE [27], pages 81-86.
11. 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 Lecture Notes in Computer Science, pages 95-106, Berlin, 1998. Springer-Verlag.
12. 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.
13. 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. Bäck, 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.
14. A.E. Eiben and J.I. van Hemert. SAW-ing EAs: Adapting the fitness function for solving constrainted problems. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 389-402. McGraw-Hill, 1999.
15. A.E. Eiben, P.-E. Raué, and Zs. Ruttkay. Heuristic genetic algorithms for constrained problems, part i: Principles. Technical Report IR-337, Vrije Universiteit Amsterdam, 1993.
16. A.E. Eiben, P-E. Raué, and Zs. Ruttkay. Solving constraint satisfaction problems using genetic algorithms. In IEEE [26], pages 542-547.
17. A.E. Eiben, P.-E. Raué, and Zs. Ruttkay. Constrained problems. In L. Chambers, editor, Practical Handbook of Genetic Algorithms, pages 307-365. CRC Press, 1995.
18. 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 Computer Society Press, 1996.
19. L.J. Eshelman, editor. Proceedings of the 6th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, Inc., 1995.
20. B.R. Fox and M.B. McMahon. Genetic operators for sequencing problems. In G. Rawlins, editor, Foundations of Genetic Algorithms, pages 284-300. Morgan Kaufmann Publishers, 1991.
21. I. Gent, E. MacIntyre, P. Prosser, and T. Walsh. Scaling effects in the CSP phase transition. In U. Monanari and F. Rossi, editors, Principles and Practice of Constraint Programming-CP95, Berlin, 1995. Springer-Verlag.
22. I. Gent and T. Walsh. Unsatisfied variables in local search. In J. Hallam, editor, Hybrid Problems, Hybrid Solutions. IOS Press, 1995.
23. H. Handa, N. Baba, O. Katai, T. Sawaragi, and T. Horiuchi. Genetic algorithm involving coevolution mechanism to search for effective genetic information. In IEEE [27].
24. H. Handa, C. O. Katai, N. Baba, and T. Sawaragi. Solving constraint satisfaction problems by using coevolutionary genetic algorithms. In Proceedings of the 5th IEEE Conference on Evolutionary Computation, pages 21-26. IEEE Computer Society Press, 1998.
25. T. Hogg and C. Williams. The hardest constraint problems: A double phase transition. Artificial Intelligence, 69:359-377, 1994.
26. Proceedings of the 1st IEEE Conference on Evolutionary Computation. IEEE Computer Society Press, 1994.
27. Proceedings of the 4th IEEE Conference on Evolutionary Computation. IEEE Computer Society Press, 1997.
28. E. Marchiori. Combining constraint processing and genetic algorithms for constraint satisfaction problems. In Bäck [1], pages 330-337.
29. E. Marchiori and A. Steenbeek. Genetic local search algorithm for random binary constraint satisfaction problems. In Proceedings of the ACM Symposium on Applied Computing, 2000, pages 454-462.
30. Z. Michalewicz. Genetic algorithms, numerical optimization, and constraints. In Eshelman [19], pages 151-158.
31. Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In J.R. McDonnell, R.G. Reynolds, and D.B. Fogel, editors, Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155, Cambridge, MA, 1995. MIT Press.
32. Z. Michalewicz and N. Attia. Evolutionary optimization of constrained problems. In A.V. Sebald and L.J. Fogel, editors, Proceedings of the 3rd Annual Conference on Evolutionary Programming, pages 98-108. World Scientific, 1994.
33. Z. Michalewicz and M. Michalewicz. Pro-life versus pro-choice strategies in evolutionary computation techniques. In M. Palaniswami, Y. Attikiouzel, R.J. Marks, D. Fogel, and T. Fukuda, editors, Computational Intelligence: A Dynamic System Perspective, pages 137-151. IEEE Computer Society Press, 1995.
34. Z. Michalewicz and M. Schoenauer. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1):1-32, 1996.
35. Z. Michalewicz and M. Schoenauer. Evolutionary algorithms for constrained parameter optimization problems. Journal of Evolutionary Computation, 4(1):1-32, 1996.
36. D. Mitchell, B. Selman, and H.J. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI-92, pages 459-465. AAAI Press/The MIT Press, 1992.
37. P. Morris. On the density of solutions in equilibrium points for the n-queens problem. In Proceedings of the 9th International Conference on Artificial Intelligence (AAAI-92), pages 428-433, 1992.
38. P. Morris. The breakout method for escaping from local minima. In Proceedings of the 11th National Conference on Artificial Intelligence, AAAI-93, pages 40-45. AAAI Press/The MIT Press, 1993.
39. J. Paredis. Coevolutionary constraint satisfaction. In Y. Davidor, H.-P. Schwefel, and R. Männer, editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in Lecture Notes in Computer Science, pages 46-55, Berlin, 1994. Springer-Verlag.
40. J. Paredis. Co-evolutionary computation. Artificial Life, 2(4):355-375, 1995.
41. J. Paredis. Coevolving cellular automata: Be aware of the red queen. In Bäck [1].
42. P. Prosser. Binary constraint satisfaction problems: Some are harder than others. In Cohn [6], pages 95-99.
43. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Journal of Artificial Intelligence, 81:81-109, 1996.
44. M.C. Riff-Rojas. Evolutionary search guided by the constraint network to solve CSP. In Belew and Booker [3], pages 337-348.
45. M.C. Riff-Rojas. Using the knowledge of the constraint network to design an evolutionary algorithm that solves CSP. In Belew and Booker [3], pages 279-284.
46. B.M. Smith. Phase transition and the mushy region in constraint satisfaction problems. In Cohn [6], pages 100-104.
47. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A comparison of genetic sequenceing operators. In Belew and Booker [3], pages 69-76.
48. E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
49. P. van Hentenryck, V. Saraswat, and Y. Deville. Constraint processing in cc(fd). In A. Podelski, editor, Constraint Programming: Basics and Trends. Springer-Verlag, Berlin, 1995.
50. D. Whitley. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In J.D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 116-123, San Mateo, CA, 1989. Morgan Kaufmann Publishers.