Evolving combinatorial problem instances that are difficult to solve

Evolutionary Computation

Volumn 14, Issue 4, 2006, Pages 433-462

  Van Hemert, Jano I ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

3 SAT; Binary constraint satisfaction; Boolean satisfiability; Difficult combinatorial problems; Evolving problems; Problem hardness; Travelling salesman

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CLUSTER ANALYSIS; COMPARATIVE STUDY; EVOLUTION; GENETIC SELECTION;

ALGORITHMS; CLUSTER ANALYSIS; COMPUTATIONAL BIOLOGY; EVOLUTION; MODELS, GENETIC; SELECTION (GENETICS);

EID: 33846274936     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2006.14.4.433     Document Type: Article

References (75)

1. Achlioptas, D., Gomes, C., Kautz, H., and Selman, B. (2000). Generating satisfiable problem instances. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and The Twelfth Annual Conference on Innovative Applications of Artificial Intelligence.
2. Achlioptas, D., Jia, H., and Moore, C. (2004). Hiding satisfying assignments: Two are better than one. In AAAI, pages 131-136. Extended version.
3. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., and Stamatiou, Y. (2001). Random constraint satisfaction: A more accurate picture. Constraints, 4(6):329-344.
4. Applegate, D., Bixby, R., Chvátal, V., and Cook, W. (1999). Finding tours in the TSP. Technical Report 99885, Research Institute for Discrete Mathematics, Universität Bonn.
5. Applegate, D., Cook, W., Dash, S., and Mevenkamp, M. (2004). Qsopt linear programming solver. http://www.isye.gatech.edu/~wcook/qsopt/.
6. Applegate, D., Cook, W., and Rohe, A. (2000). Chained lin-kernighan for large travelling salesman problems. http://www.citeseer.com/applegate99chained. html.
7. Bacchus, F. and van Beek, P. (1998). On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of the 15th International Conference on Artificial Intelligence, pages 311-318. Morgan Kaufmann.
8. Bäck, T., Fogel, D., and Michalewicz, Z., editors (1997). Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol and Oxford University Press, New York.
9. Bayardo, R. (2005). Relsat. Version 2.00 at http://www.almaden.ibm.com/ cs/people/ bayardo/resources.html.
10. Bayardo Jr, R. and Pehoushek, J. (2000). Counting models using connected components. In Proceedings of the Seventeenth National Conference on Artificial Intelligence.
11. Bayardo Jr, R. and Schrag, R. (1997a). Using csp look-back techniques to solve real world sat instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 203-208.
12. Bayardo Jr, R. J. and Schrag, R. (1997b). Using CSP look-back techniques to solve exceptionally hard SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 203-208.
13. Beacham, A. (2000). The complexity of problems without backbones. Master's thesis, University of Alberta.
14. Boettcher, S., Istrate, G., and Percus, A. (2005). Spines of random constraint satisfaction problems: Definition and impact on computational complexity. In Eighth International Symposium on Artificial Intelligence and Mathematics. Extended version.
15. Cheeseman, P., Kenefsky, B., and Taylor, W. M. (1991). Where the really hard problems are. In Proceedings of the IJCAI'91, pages 331-337.
16. Cohn, A. G., editor (1994). Proceedings of the European Conference on Artificial Intelligence. Wiley.
17. Cook, S. (1971). The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, pages 151-158.
18. Cook, S. and Mitchell, D. (1997). Finding hard instances of the satisfiability problem: A survey. In Du, D., Gu, J., and Pardalos, P., editors, Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-17. AMS.
19. Corno, F., Sanchez, E., Sonza Reorda, M., and Squillero, G. (2004). Automatic test program generation - a case study. IEEE Design & Test, 21(2):102-109.
20. Cotta, C. and Moscato, P. (2003). A mixed evolutionary-statistical analysis of an algorithm's complexity. Applied Mathematics Letters, 16:41-47.
21. Culberson, J. and Gent, I. (1999). Well out of reach: why hard problems are hard. Technical report, APES Research Group.
22. Davis, M. and Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7(201-215).
23. Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41:273-312.
24. Du, D., Gu, J., and Pardalos, P., editors (1997). Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS.
25. Fu, Z. (2004). zChaff. Version 2004.11.15 from http://www.princeton.edu/ ~chaff/ zchaff.html.
26. Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freedman and Co.
27. Gent, I., MacIntyre, E., Prosser, P., Smith, B., and Walsh, T. (1996a). An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Principles and Practice of Constraint Programming, pages 179-193. Springer LNCS 1118.
28. Gent, I. and Walsh, T. (1996). The satisfiability constraint gap. Artificial Intelligence, 81(1-2):59-80.
29. Gent, I. P., MacIntyre, E., Prosser, P., and Walsh, T. (1996b). The constrainedness of search. In Proceedings of the AAAI-96, pages 246-252.
30. Golomb, S. and Baumert, L. (1965). Backtrack programming. ACM, 12(4):516-524.
31. Haralick, R. and Elliot, G. (1980). Increasing tree search efficiency for constraint-satisfaction problems. Artificial Intelligence, 14(3):263-313.
32. Hayes, B. (1997). Can't get no satisfaction. American Scientist, 85(2):108-112.
33. Johnson, D. and McGeoch, L. (1997). The traveling salesman problem: a case study. In Aarts, E. and Lenstra, J., editors, Local Search in Combinatorial Optimization, chapter 8, pages 215-310. John Wiley & Sons, Inc.
34. Kautz, H. and Selman, B. (1992). Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence, pages 359-363. John Wiley & Sons, Inc.
35. Kilby, P., Slaney, J., Thiébaux, S., and Walsh, T. (2005). Backbones and backdoors in satisfiability. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), pp 1368-1373.
36. Kratica, J., Ljubić, I., and Tošic, D. (2003). A genetic algorithm for the index selection problem. In et al., G. R., editor, Applications of Evolutionary Computation, volume 2611 of LNCS, pages 281-291. Springer-Verlag.
37. Kwan, A., Tsang, E., and Borrett, J. (1998). Predicting phase transitions of binary constraint satisfaction problems with constraint graph information. Intelligent Data Analysis, 268(1-4):45-62.
38. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B. (1985). The Traveling Salesman Problem. John Wiley & Sons, Chichester.
39. Le Berre, D. and Simon, L. (2005). SAT competitions. http;//www. satcompetition.org.
40. Lenstra, J. and Rinnooy Kan, A. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11:221-227.
41. Lin, S. and Kernighan, B. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516.
42. Mammen, D. and Hogg, T. (1997). A new look at the easy-hard-easy pattern of combinatorial search difficulty. Journal of Artificial Intelligence Research, 7:47-66.
43. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953). Equations of state calculations by fast computing machines. Journal of Chemical Physics, pages 1087-1091.
44. Mitchell, D., Selman, B., and Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 459-465.
45. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., and Troyansky, L. (1999). Determining computational complexity from characteristic phase transitions. Nature, 400:133-137.
46. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., and Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), pages 530-535.
47. Neto, D. (1999). Efficient Cluster Compensation for Lin-Kernighan Heuristics. PhD thesis, Computer Science, University of Toronto.
48. Palmer, E. M. (1985). Graphical Evolution. John-Wiley & Sons, New York.
49. Papadimitriou, C. (1992). The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM Journal of Computing, 21(3):450-465.
50. Papadimitriou, C. (1994). Computational Complexity. Addison-Wesley.
51. Papadimitriou, C. and Steiglitz, K. (1976). Some complexity results for the traveling salesman problem. In STOC 76: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pages 1-9. ACM Press.
52. Prosser, P. (1993). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299.
53. Prosser, P. (1994). Binary constraint satisfaction problems: Some are harder than others. In (Cohn, 1994), pages 95-99.
54. Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109.
55. Rossi, F., Petrie, C., and Dhar, V. (1990). On the equivalence of constraint satisfaction problems. In Aiello, L. C., editor, ECAI'90: Proceedings of the 9th European Conference on Artificial Intelligence, pages 550-556, Stockholm. Pitman.
56. Rudnick, E., Patel, J., Greenstein, G., and Niermann, T. (1994). Sequential circuit test generation in a genetic algorithm framework. In DAC '94: Proceedings of the 31st Annual Conference on Design Automation, pages 698-704. ACM Press.
57. Saab, D., Saab, U., and Abraham, J. (1992). CRIS: a test cultivation program for sequential VLSI circuits. In Proc. 1992 IEEE/ACM International Conference on Computer-Aided Design, pages 216-219.
58. Sander, J., Ester, M., Kriegel, H.-P., and Xu, X. (1998). Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery, 2(2):169-194.
59. Selman, B., Mitchell, D., and Levesque, H. (1996). Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29.
60. Singer, J., Gent, I., and Smaill, A. (2000). Backbone fragility and the local search cost peak. Journal of Artificial Intelligence Research, 12:235-270.
61. Slaney, J. and Walsh, T. (2001). Backbones in optimization and approximation. In Nebel, B., editor, Proceedings of the Seventeenth International Conference on Artificial Intelligence (IJCAI-01), pages 254-259, San Francisco, CA. Morgan Kaufmann Publishers, Inc.
62. Smith, B. (1994). Phase transition and the mushy region in constraint satisfaction problems. In (Cohn, 1994), pages 100-104.
63. Smith, B. M. and Dyer, M. E. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81(1-2):155-181.
64. Smith, B. M. and Grant, S. A. (1997). Modelling exceptionally hard constraint satisfaction problems. In Smolka, G., editor, Principles and Practice of Constraint Programming (CP97), pages 182-195. Springer-Verlag.
65. Srinivas, M. and Patnaik, L. (1993). A simulation-based test generation scheme using genetic algorithms. In Proceedings International Conference VLSI Design, pages 132-135.
66. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.
67. van Beek, P. (2005). A 'C' library of routines for solving binary constraint satisfaction problems. Available from http://ai.uwaterloo.ca/ ~vanbeek/software/software. html.
68. van Hemert, J. (2003a). Evolving binary constraint satisfaction problem instances that are difficult to solve. In Proceedings of the IEEE 2003 Congress on Evolutionary Computation, pages 1267-1273. IEEE Press.
69. van Hemert, J. (2003b). RandomCSP. Version 1.8.0 freely available from http:// freshmeat.net/projects/randomcsp/.
70. van Hemert, J. (2005). Property analysis of symmetric travelling salesman problem instances acquired through evolution. In Raidl, G. and Gottlieb, J., editors, Evolutionary Computation in Combinatorial Optimization, Springer Lecture Notes on Computer Science, pages 122-131. Springer-Verlag, Berlin.
71. van Hemert, J. and Urquhart, N. (2004). Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation. In Yao, X., Burke, E., Lozano, J. A., Smith, J., Merelo-Guervós, J. J., Bullinaria, J. A., Rowe, J., Kabán, P. T. A., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature (PPSN VIII), volume 3242 of LNCS, pages 150-159, Birmingham, UK. Springer-Verlag.
72. Walsh, T. (2000). SAT v CSP. In Proceedings of the 6th Conference on Principles and Practice of Constraint Programming (CP 2000), pages 441-456.
73. Williams, C. and Hogg, T. (1994). Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117.
74. Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82.
75. Zhang, H. (1997). SATO: An efficient propositional prover. In CADE-14: Proceedings of the 14th International Conference on Automated Deduction, pages 272-275. Springer-Verlag.