Solving constraint satisfaction problems using hybrid evolutionary search

IEEE Transactions on Evolutionary Computation

Volumn 2, Issue 1, 1998, Pages 23-33

  Dozier, Gerry ^a   Bowen, James ^b   Homaifar, Abdollah ^b  

^a AUBURN UNIVERSITY   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Dynamic constraint satisfaction; Evolutionary hill climbing; Mushy region; Phase transition

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; ITERATIVE METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTRAINT SATISFACTION PROBLEM; EVOLUTIONARY HILL CLIMBING; HYBRID SYSTEM; ITERATIVE DESCENT METHOD;

GENETIC ALGORITHMS;

EID: 0032035547     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.728211     Document Type: Article

References (44)

1. B. W. Benson and E. C. Freuder, Interchangeability preprocessing can improve forward checking search, in Proc. 10th Euro. Conf. Artificial Intelligence, B. Neuman, Ed., Vienna, Austria, Aug. 1992, pp. 28-30.
2. C. Bessiere, Arc-consistency for nonbinary dynamic CSP's, in Proc. 10th Euro. Conf. Artificial Intelligence, B. Neuman, Ed., Vienna, Austria, Aug. 1992, pp. 23-27.
3. J. Bowen and G. Dozier, Constraint satisfaction using a hybrid evolutionary hill-climbing algorithm that performs opportunistic arc and path revision, in Proc. 13th Nat. Conf. Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conf. Portland, OR, Aug. 1996, pp. 326-331.
4. _, Solving constraint satisfaction problems using a genetic/systematic search hybrid that realizes when to quit, in Proc. 6th Int. Conf. Genetic Algorithms, ICGA-95, L. J. Eshelman, Ed., Pittsburgh, PA, July 1995, pp. 122-129.
5. J. Bowen, R. Lai, and D. Bahler, Lexical imprecision in fuzzy constraint networks, in Proc. 10th Nat. Conf. Artificial Intelligence, W. Swartout, Ed., San Jose, CA, July 1992, pp. 616-621.
6. P. Cheeseman, B. Kanefsky, and W. M. Taylor, Where the really hard problems are, in Proc. 12th Int. Joint Conf. Artificial Intelligence, J. Myopoulos and R. Reiter, Eds., Sydney, Australia, Aug. 1991, pp. 331-337.
7. D. Corne, P. Ross, and H.-L. Fang, Fast practical evolutionary timetabling, in Proc. AISB Workshop on Evolutionary Computation. New York: Springer Verlag, 1994.
8. K. De Jong and W. Spears, On The state of evolutionary computation, in Proc. 5th Int. Conf. Genetic Algorithms, (ICGA '93), S. Forrest, Ed., Urbana-Champaign, IL, July 1993, pp. 618-623.
9. G. Dozier, Constraint processing using adaptive microevolutionary/systematic hill-climbing, Ph.D. dissertation, Dept. Computer Science, North Carolina State Univ., Raleigh, 1995.
10. G. Dozier, J. Bowen, and D. Bahler, Solving randomly generated constraint satisfaction problems using a hybrid microgenetic search technique that evolves a population of hill-climbers, in Proc. 1995 IEEE Int. Conf. Evolutionary Computation, Perth, Australia, Nov. 1995, pp. 614-619.
11. _, Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm, in Proc. 1994 IEEE Int. Conf. Evolutionary Computation, Orlando, FL, June 1994, pp. 306-311.
12. M. Drummond, J. Bresina, and K. Swanson. Just-in-case scheduling, in Proc. 12th Nat. Conf. Artificial Intelligence, Seattle, WA, July 1994, pp. 1098-1104.
13. A. E. Eiben, J. K. van der Hauw, and J. I. van Hemert, Graph coloring with adaptive evolutionary algorithms, J. Heuristics, vol. 4, pp. 2516.
14. A. E. Eiben and J. K. van der Hauw, Solving 3-SAT by GA's adapting constraint weights, in Proc. 1997 IEEE Int. Conf. Evolutionary Computation, Indianapolis, IN, Apr. 1997, pp. 81-86.
15. A. E. Eiben and Zs. Ruttkay, Self-adaptivity for constraint satisfaction: Learning penalty functions, in Proc. 1996 IEEE Int. Conf. Evolutionary Computation, Nagoya, Japan, May 1996, pp. 258-261.
16. A. E. Eiben, P.-E. Raue, and Zs. Ruttkay, GA-easy and GA-hard constraint satisfaction problems, in Proc. llth Eur. Conf. Artificial Intelligence (ECAI'94) Workshop on Constraint Processing, M. Meyer, Ed., 1995, pp. 267-284.
17. _, Solving constraint satisfaction problems using genetic algorithms, in Proc. 1994 IEEE Int. Conf. Evolutionary Computation, Orlando, FL, June 1994, pp. 542-547.
18. L. J. Eshelman and J. D. Shaffer, Real-coded genetic algorithms and interval-schemata, in Foundations of Genetic Algorithms II, L. Darrell Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 187-202.
19. H.-L. Fang, P. Ross, and D. Corne, A promising hybrid GA/heuristic approach for open-shop scheduling problems, in Proc. llth Eur. Conf.
20. Artificial Intelligence, A.G. Cohn, Ed., Amsterdam, The Netherlands, 1994, pp. 590-594.
21. D. E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning. Reading, MA: Addison-Wesley, 1989.
22. T. Hogg, B. A. Huberman, and C. P. Williams, Phase transitions and the search problem, Artif. Intell, vol. 81, pp. 1-15, 1996.
23. T. Jones, Crossover, macromutation, and population-based search, in Proc. 6th Int. Conf. Genetic Algorithms, ICGA-95, L. J. Eshelman, Ed., Pittsburgh, PA, 1995, pp. 73-80.
24. N. Jussien and P. Boisumault Dynamic backtracking with constraint propagation application to static and dynamic CSP's, in Proc. 1997 Constraint Programming Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, CP97, Schloss Hagenberg, Austria, 1997 [Online]. Available WWW: http://wwwicparc.doc.ic.ac.uk/hhe/papers.html
25. C. L. Karr, Air-injected hydrocyclone optimization via genetic algorithm, in Handbook of Genetic Algorithms, L. Davis, Ed. New York: Van Nostrand Reinhold, 1991.
26. K. Krishnakumar, Microgenetic algorithms for stationary and nonstationary function optimization, in Proc. SPIE Intelligent Control and Adaptive Systems Conf., 1989, vol. 1196-32.
27. R. Kowalczyk, Constraint consistent genetic algorithms, in Proc. 1997 IEEE Int. Conf. Evolutionary Computation, Indianapolis, IN, Apr. 1997, pp. 343-348.
28. A. K. Mackworth, Consistency in networks of relations, Artif. Intell., vol. 8, pp. 98-118, 1977.
29. E. Marchiori, Combining constraint processing and genetic algorithms for constraint satisfaction problems, in Proc. 7th Int. Conf. Genetic Algorithms, T. Back, Ed., East Lansing, MI, 1997, pp. 330-337.
30. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 2nd ed. New York: Springer-Verlag, 1994.
31. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artif. Intell., vol. 58, pp. 161-205, 1992.
32. S. Mittal and B. Falkenhainer, Dynamic constraint satisfaction problems, in Proc. 8th Nat. Conf. Artificial Intelligence, T. Dietterich and W. Swartout, Eds., July 1990, pp. 25-32.
33. P. Morris, The breakout method for escaping from local minima, in Proc. llthNat. Conf. Artificial Intelligence..Washington, DC,July 1993, pp. 40-45.
34. J. Paredis, Co-evolutionary constraint satisfaction, in Proc. 3rd Int. Conf. Parallel Problem Solving from Nature, Y. Davidor, H.-P. Schwefel, and R. Männer, Eds. Springer-Verlag, 1994, pp. 46-56.
35. _, Genetic state-space search for constrained optimization problems, in Proc. 13th Int. Joint Conf. Artificial Intelligence (IJCAI'93), 1993, pp. 967-972.
36. P. Prosser, Binary constraint satisfaction problems: Some are harder than others, in Proc. llth Eur. Conf. Artificial Intelligence, A. G. Cohn, Ed., Amsterdam, The Netherlands, Aug. 1994, pp. 95-99.
37. M. C. Riff-Rojas, Evolutionary search guided by the constraint network to solve CSP, in Proc. 1997 IEEE Int. Conf. Evolutionary Computation, Indianapolis, IN, Apr. 1997, pp. 337-342.
38. _, Using the knowledge of the constraints network to design and evolutionary algorithm that solves CSP, in Proc. 1996 IEEE Int. Conf. Evolutionary Computation, Nagoya, Japan, May 1996, pp. 279-284.
39. C. Ryan, Pygmies and civil servants, in Advances in Genetic Programming, K. Kinnear, Jr., Ed. Cambridge, MA: MIT Press, 1994.
40. B. Smith and M. E. Dyer, Locating the phase transition in binary constraint satisfaction problems, Artif. Intell., vol. 81, pp. 155-181, 1996.
41. B. Smith, The phase transition and the mushy region in constraint satisfaction problems, in Proc. 11th Eur. Conf. Artificial Intelligence, A. G. Cohn, Ed., Amsterdam, The Netherlands, Aug. 1994, pp. 100-104.
42. W. M. Spears, Simple subpopulation schemes, in Proc. 3rd Annu. Conf. Evolutionary Programming, A. V. Sebald and L. J. Fogel, Eds. Singapore: World Scientific, 1994, pp. 296-307.
43. E. Tsang, Foundations of Constraint Satisfaction. New York: Academic, 1993.
44. R. J. Wallace and E. C. Freuder, Stable solutions for dynamic constraint satisfaction problems, in Proc. 1997 Constraint Programming Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, CP97, Schloss Hagenberg, Austria, Oct. 29-Nov. 1, 1997 [Online]. Availale WWW: http://www-icparc.doc.ic.ac.uk/hhe/papers.html.