Contributions to the solution of the symmetric travelling salesman problem

Imperial Users onl

On The Performance Of Heuristics On Finite And Infinite Fractal Instances Of The Euclidean Traveling Salesman Problem

We show how, by a constructive process, we can generate arbitrarily large instances of the Traveling Salesman Problem (TSP) using standard fractals such as those of Peano, Koch, or Sierpinski. We show that optimal solutions for these TSPs can be known a priori, and thus, they provide us with new nontrivial TSP instances offering the possibility of testing heuristics well beyond the scope of testbed instances which have been solved by exact numerical methods. Furthermore, instances may be constructed with different features, for example, with different fractal dimensions. To four of these fractal TSPs we apply three standard constructive heuristics, namely Multiple Fragment, Nearest Neighbor, and Farthest Insertion from Convex-Hull, which have efficient general-purpose implementations. The ability of different algorithms to solve these different fractal TSPs gives us significant insight into the nature of TSP heuristics in a way which is complementary to approaches such as worst-case or average-case analysis. © 1998 INFORMS.102121132Amini, M., Racer, M.J., A Rigorous Computational Comparison of Alternative Solution Methodologies for the Generalized Assignment Problem (1994) Management Science, 40, pp. 868-890Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, W., Designing and Reporting on Computational Experiments with Heuristic Methods (1995) Journal of Heuristics, 1, pp. 9-32Beardwood, J., Halton, J.H., Hammersley, J.M., The Shortest Path through Many Points (1959) Proceeding of the Cambridge Philosophical Society, 55, pp. 299-327Bentley, J.L., Experiments on Traveling Salesman Heuristics (1990) First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 91-190. , ACM Press, San Francisco, CABentley, J.L., Fast Algorithms for Geometric Traveling Salesman Problem (1992) ORSA Journal on Computing, 4, pp. 387-411Bertsimas, D., Grigni, M., Worst-Case Examples for the Spacefilling Curve Heuristic for the Euclidean Travelling Salesman Problem (1989) Operations Research Letters, 8, pp. 241-244Bonomi, E., Lutton, J.L., The N-city Travelling Salesman Problem and the Metropolis Algorithm (1984) SIAM Review, 26, pp. 551-568Christofides, N., (1976) Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem, , Report 388, Carnegie Mellon University, Pittsburg, PAFinch, S., (1997) Traveling Salesman Constants' Page, , http://www.mathsoft.com/asolve/constant/sales/sales.htmlFredman, M.L., Johnson, D.S., Mcgeoch, L.A., Ostheimer, G., Data Structures for Traveling Salesmen (1995) Journal of Algorithms, 18, pp. 432-479Toulouse, G., How 'Frustration' Set in (1989) Physics Today, 42, p. 97Hilbert, D., Über die stetige Abbildung einer Linie Auf ein Flächenstück (1891) Mathematische Annalen, 38, pp. 459-460Hooker, J.N., Needed: An Empirical Science of Algorithms (1994) Operations Research, 42, pp. 201-212Hooker, J.N., Testing Heuristics: We have it all Wrong (1996) Journal of Heuristics, 1, pp. 33-42Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E., Approximation Schemes Using L-reductions (1994) Lecture Notes in Computer Science, pp. 342-353. , Proceeding of the 14th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Verlag, HeidelbergBartholdi III, J.J., Platzman, L.K., On O(n log(n)) Planar Traveling Salesman Problem Heuristic Based on Spacefilling Curves (1982) Operations Research Letters, 1, pp. 121-125Bartholdi III, J.J., Platzman, L.K., A Fast Heuristic Based on Spacefilling curves for Minimum-Weight Matching in the Plane (1983) Information Processing Letters, 17, pp. 177-180Bartholdi III, J.J., Platzman, L.K., Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space (1988) Management Science, 34, pp. 291-305Iwama, K., Miyazaki, S., SAT-variable Complexity of Hard Combinatorial Problems (1994) Proceedings of the 13th IFIP World Computer Congress, pp. 253-258. , Elsevier, AmsterdamJohnson, D.S., Local Optimization and the Traveling Salesman Problem (1990) Lecture Notes in Computer Science, pp. 446-461. , Proceedings of the 17th Colloquium on Automata, Languages and Programming, Springer-Verlag, BerlinJohnson, D.S., Mcgeoch, L.A., The Traveling Salesman Problem: A Case Study in Local Optimization (1997) Local Search in Combinatorial Optimization, pp. 215-310. , E.H.L. Aarts and J.K. Lenstra (eds.), John-Wiley and Sons, LtdJohnson, D.S., Mcgeoch, L.A., Rothberg, E.E., Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound (1996) Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 341-350. , ACM Press, San FranciscoKanada, Y., Methods of Parallel Processing of Constraint Satisfaction Using CCM - A Model for Emergent Computation (1996) Proceedings of the 9th Meeting of Special Interest Group on Parallel Processing for Artificial Intelligence, Japan Society for Artificial Intelligence, , http://www.rwcp.or.jp/people/yk/Papers/CCM-papers.htmlLawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., (1985) The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization, , Wiley-Interscience, Chichester, U.KLin, S., Computer Solutions of the Traveling Salesman Problem (1965) Bell System Technology Journal, 44, pp. 2245-2269Lin, S., Kernighan, B.W., An Effective Heuristic Algorithm for the Traveling Salesman Problem (1973) Operations Research, 21, pp. 498-516Lindenmayer, A., Mathematical Models for Cellular Interaction in Development, Parts I and II (1968) Journal of Theoretical Biology, 18, pp. 280-315Mariano, A., Moscato, P., Norman, M.G., Arbitrarily Large Planar ETSP Instances with Known Optimal Tours (1995) Pesquisa Operational, 15, pp. 89-96Mcgeoch, C.C., Analyzing Algorithms by Simulation: Variance Reduction Techniques and Simulation Speedup (1992) ACM Computing Surveys, 24, pp. 195-212Mcgeoch, C.C., Challenges in Algorithm Simulation (1996) INFORMS Journal on Computing, 8, pp. 27-28Mcgeoch, C.C., Towards an Experimental Method for Algorithm Simulation (1996) INFORMS Journal on Computing, 8, pp. 1-15Moscato, P., An Introduction to Population Approaches for Optimization and Hierarchical Objective Functions: The Role of Tabu Search (1993) Annals of Operations Research, 41, pp. 85-121Norman, M.G., Moscato, P., The Euclidian Traveling Salesman Problem and a Space-Filling Curve (1995) Chaos, Solitons and Fractals, 6, pp. 389-397Peano, G., Sur une Courbe, qui Remplit Toute une Aire Plane (1890) Mathematische Annalen, 36, pp. 157-160Peitgen, H.O., Jurgens, H., Saufe, D., (1992) Chaos and Fractals New Frontiers of Science, , Springer-Verlag, New YorkPlatzman, L.K., Bartholdi III, J.J., Spacefilling Curves and the Planar Travelling Salesman Problem (1989) Journal of the ACM, 36, pp. 719-737Rardin, R., Tovey, C., Pilcher, M., Analysis of a Random Cut Test Instance Generator for the TSP (1993) Complexity in Numerical Optimization, pp. 387-405. , P. Pardalos (ed.), World Scientific, SingaporeReinelt, G., TSPLIB - A Traveling Salesman Problem Library (1991) ORSA Journal on Computing, 3, pp. 376-384Sahni, S., Gonzalez, T., P-Complete Approximation Problems (1976) Journal of the ACM, 23, pp. 555-565Sanchis, L., On the Complexity of Test Case Generation for NP-hard Problems (1990) Information Processing Letters, 36, pp. 135-140Sierpinski, W., Sur une Courbe Cantorienne dont tout Point est un Point de ramification (1915) C. R. Académie, Paris, 160, p. 302Stein, D., (1977) Scheduling Dial-a-Ride Transportation Systems: An Asymptotic Approach, , PhD thesis, Harvard University, Cambridge, MAToulouse, G., Theory of the Frustration Effect in Spin Glasses I (1977) Communications on Physics, 2, p. 115Von Koch, H., Sur Une Courbe Continue Sans Tangente, Obtenue par une Construction Géométrique Élémentaire (1904) Arkiv för Matematik, 1, pp. 681-704Williamson, D.P., Goemans, M.X., Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances (1996) INFORMS Journal on Computing, 8, pp. 29-4