The TSP phase transition

Artificial Intelligence

Volumn 88, Issue 1-2, 1996, Pages 349-358

  Gent, Ian P ^a   Walsh, Toby ^b,c  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^b ITC IRST   (Italy)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

Complexity; Eeasy and hard instances; Finite size scaling; NP complete problems; Search phase transitions; Traveling salesman problem

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; STATISTICAL METHODS;

FINITE-SIZE SCALING; SEARCH PHASE TRANSITIONS; TRAVELING SALESMAN PROBLEM;

PROBLEM SOLVING;

EID: 0030421741     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00030-6     Document Type: Article

References (25)

1. M.N. Barber, Finite-size scaling, Phase Transit. Critic. Phenomena 8 (1983) 145-266.
2. J. Beardwood, J.H. Halton and J.M. Hammersley, The shortest path through many points, Proc. Cambridge Philos. Soc. 55 (1959) 299-327.
3. E. Bonomi and J.-L. Lutton, The n-city travelling salesman problem: statistical mechanics and the Metropolis algorithm, SIAM Rev. 26 (1984) 551-568.
4. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proceedings IJCAI-91, Sydney (1991) 331-337.
5. J.M. Crawford and L.D. Auton, Experimental results on the crossover point in random 3SAT, Artif. Intell. 81 (1996) 31-57.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
7. I.P. Gent, E. MacIntyre, P. Prosser and T. Walsh, Scaling effects in the CSP phase transition, in: U. Montanari and F. Rossi, eds., Principles and Practice of Constraint Programming - CP95 (Springer, Berlin, 1995) 70-87.
8. I.P. Gent, E. MacIntyre, P. Prosser and T. Walsh, The constrainedness of search, Tech. Rept., IRST, Trento (1996); also in: Proceedings AAAI-96 (to appear).
9. I.P. Gent, E. MacIntyre, P. Prosser and T. Walsh, The constrainedness of search, Tech. Rept., IRST, Trento (1996); also in: Proceedings AAAI-96 (to appear).
10. I.P. Gent and T. Walsh, The hardest random SAT problems, in: B. Nebel and L. Dreschler-Fischer, eds., KI-94: Advances in Artificial Intelligence. 18th German Annual Conference on Artificial Intelligence (Springer, Berlin, 1994) 355-366.
11. I.P. Gent and T. Walsh, Easy problems are sometimes hard, Artif. Intell. 70 (1994) 335-345.
12. I.P. Gent and T. Walsh, The TSP phase transition, Res. Rept./95/178, Department of Computer Science, University of Strathclyde, Glasgow (1995).
13. T. Hogg and C. Williams, The hardest constraint problems: a double phase transition, Artif. Intell. 69 (1994) 359-377.
14. D.S. Johnson, L.A. McGeoch and E.E. Rothberg, Asymptotic experimental analysis for the Held-Karp traveling salesman bound, in: Proceedings 7th Annual ACM-SIAM Symposium on Discrete Algorithms (1996).
15. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680.
16. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random boolean expressions, Science 264 (1994) 1297-1301.
17. S. Kirkpatrick and R. Swendsen, Statistical mechanics and disordered systems, Commun. ACM 28 (1985) 363-373.
18. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., The Traveling Salesman Problem (Wiley, Chichester, 1985).
19. D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings AAAI-92, San Jose, CA (1992) 459-465.
20. P. Prosser, Binary constraint satisfaction problems: some are harder than others, in: A.G. Cohn, ed., Proceedings ECAI-94, Amsterdam (1994) 95-99.
21. G. Reinelt, TSPLIB - a traveling salesman problem library, ORSA J. Comput. 3 (1991) 376-384.
22. B. Selman and S. Kirkpatrick, Critical behavior in the computational cost of satisfiability testing, Artif. Intell. 81 (1996) 273-295.
23. B.M. Smith, Phase transition and the mushy region in constraint satisfaction problems, in: A.G. Cohn, ed., Proceedings ECAI-94, Amsterdam (1994) 100-104.
24. J. Vannimenus and M. Mézard, On the statistical mechanics of optimization problems of the travelling salesman type, J. Phys. Lett. 45 (1984) 1145-1152.
25. 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 (1992) 545-550.