Problem structure heuristics and scaling behavior for genetic algorithms

Artificial Intelligence

Volumn 81, Issue 1-2, 1996, Pages 327-347

  Clearwater, Scott H ^a,b   Hogg, Tad ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

^b NONE   (United States)

Author keywords

Constraint satisfaction; Genetic algorithms; Problem structure search heuristic; Search phase transitions

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; WALSH TRANSFORMS;

CONSTRAINT SATISFACTION PROBLEMS; GENESIS GENETIC ALGORITHM; PROBLEM STRUCTURE HEURISTICS;

ARTIFICIAL INTELLIGENCE;

EID: 0030107746     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00058-5     Document Type: Article

References (33)

1. D.H. Ackley, An empirical study of bit vector function optimization, in: L. Davis, ed., Genetic Algorithms and Simulated Annealing (Morgan Kaufmann, Los Altos, CA, 1987) 170-216.
2. B. Bollobás, Random Graphs (Academic Press, New York, 1985).
3. R.A. Brooks, New approaches to robotics, Science 253 (1991) 1227-1232.
4. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: J. Mylopoulos and R. Reiter, eds., Proceedings IJCAI-91, Sydney, Australia (Morgan Kaufmann, San Mateo, CA, 1991) 331-337.
5. S.H. Clearwater and T. Hogg, Exploiting problem structure in genetic algorithms, in: Proceedings AAAI-94, Seattle, WA (AAAI Press, Menlo Park, CA, 1994) 1310-1315.
6. S.H. Clearwater, B.A. Huberman and T. Hogg, Cooperative solution of constraint satisfaction problems, Science 254 (1991) 1181-1183.
7. G. Deutscher, R. Zallen and J. Adler, eds., Percolation Structures and Processes, Annals of the Israel Physical Society 5 (Adam Hilger, Bristol, 1983).
8. S. Forrest, Genetic algorithms: principles of natural selection applied to computation, Science 261 (1993) 872-878.
9. S. Forrest and M. Mitchell, What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation, Mach. Learning 13 (1993) 285-319.
10. E.C. Freuder and P.D. Hubbe, Extracting constraint satisfaction subproblems, in: Proceedings ECAI-94, Amsterdam (1994).
11. B.C. Freuder and R.J. Wallace, Partial constraint satisfaction, Artif. Intell. 58 (1992) 21-70.
12. M.R. Garey and D.S. Johnson, A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
13. I.P. Gent and T. Walsh, Easy problems are sometimes hard, Artif. Intell. 70 (1994) 335-345.
14. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, New York, 1989).
15. J. Grefenstette, A User's Guide to GENESIS Version 5.0, Navy Center for Applied Research in AI, Naval Research Laboratory (1990).
16. T. Hogg, Phase transitions in constraint satisfaction search, World Wide Web page with URL ftp://parcftp.xerox.com/pub/dynamics/constraints.html (1994).
17. T. Hogg and C.P. Williams, Solving the really hard problems with cooperative search, in: Proceedings AAAI-93, Washington, DC (AAAI Press, Menlo Park, CA, 1993) 231-236.
18. T. Hogg and C.P. Williams, The hardest constraint problems: a double phase transition, Artif. Intell. 69 (1994) 359-377.
19. J.H. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, MI, 1975).
20. B.A. Huberman and T. Hogg, Phase transitions in artificial intelligence systems, Artif. Intell. 33 (1987) 155-171.
21. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
22. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994) 1297-1301.
23. W.A. Kornfeld, The use of parallelism to implement a heuristic search, in: Proceedings IJCAI-81, Vancouver, BC (1981) 575-580.
24. V. Kreinovich, Genetic algorithms: what fitness scaling is optimal?, Cybern. Syst. 24 (1) (1993) 9-26.
25. A.K. Mackworth, Constraint satisfaction, in: S. Shapiro and D. Eckroth, eds., Encyclopedia of AI (Wiley, New York, 1987) 205-211.
26. S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Solving large-scale constraint satisfaction and scheduling problems using a heursitic repair method, in: Proceedings AAAI-90, Boston, MA (AAAI Press, Menlo Park, CA, 1990) 17-24.
27. D.G. Mitchell, B. Selman and H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings AAAI-92, San Jose, CA (AAAI Press, Menlo Park, 1992) 205-211.
28. W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T. Vetterling, Numerical Recipes (Cambridge University Press, Cambridge, 1986).
29. P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Comput. Intell. 9 (3) (1993) 268-299.
30. V. Nageshwara Rao and V. Kumer, On the efficiency of parallel backtracking, IEEE Trans. Parallel Distrib. Comput. (1992).
31. C.P. Williams and T. Hogg, Using deep structure to locate hard problems, in: Proceedings AAAI-92, San Jose, CA (AAAI Press, Menlo Park, CA, 1992) 472-477.
32. C.P. Williams and T. Hogg, Exploiting the deep structure of constraint problems, Artif. Intell. 70 (1994) 73-117.
33. W. Zhang and R.E. Korf, An average-case analysis of branch-and-bound with applications: summary of results, in: Proceedings AAAI-92, San Jose, CA (AAAI Press, Menlo Park, CA, 1992) 545-550.