Experimental analysis of heuristics for the bottleneck traveling salesman problem

Journal of Heuristics

Volumn 18, Issue 3, 2012, Pages 473-503

  Larusic, John ^a   Punnen, Abraham P ^a   Aubanel, Eric ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Bottleneck TSP; Experimental analysis; Heuristic algorithms; Maximum scatter TSP; Traveling salesman problem

Indexed keywords

BOTTLENECK TSP; COMPUTATIONAL EXPERIMENT; CONSTRUCTION HEURISTICS; EXPERIMENTAL ANALYSIS; HAMILTONICITY; MAXIMUM SCATTER TSP; OPTIMAL SOLUTIONS; RUNNING TIME; TEST PROBLEM;

EXPERIMENTS; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 84862163743     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-012-9194-6     Document Type: Article

References (37)

1. Applegate, D., Bixby, R., Chvtal, V., Cook, W., Mevenkamp, M.: Concorde TSP solver. Last updated Jan. 2005. http://www.tsp.gatech.edu/concorde.html
2. E.M. Arkin Y. Chiang J.S.B. Mitchell S.S. Skiena T. Yang 1999 On the maximum scatter traveling salesman problem SIAM J. Comput. 29 515 544 1717922 10.1137/S0097539797320281
3. Arora, S.: Approximation algorithms for geometric TSP. In: Gutin, G., Punnen, A.P. (eds.) The Travelling Salesman Problem and Its Variants, pp. 207-222. Kluwer Academic, Secaucus (2002), Chap. 5
4. M.O. Ball M.J. Magazine 1988 Sequencing of insertions in printed circuit board assembly Oper. Res. 36 192 201 948368 10.1287/opre.36.2.192
5. G. Carpaneto S. Martello P. Toth 1984 An algorithm for the bottleneck traveling salesman problem Oper. Res. 32 380 389 747749 0539.90100 10.1287/opre.32.2.380 (Pubitemid 14585176)
6. N.N. Doroshko V.I. Sarvanov 1981 The minimax traveling salesman problem and Hamiltonian cycles in powers of graphs Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 143 119 120 643622 (Russian)
7. J. Edmonds F.R. Fulkerson 1970 Bottleneck estrema J. Comb. Theory 8 299 306 255235 0218.05006 10.1016/S0021-9800(70)80083-7
8. E. Gabovic A. Ciz A. Jalas 1971 The bottleneck travelling salesman problem Tr. Vyčisl. Centra Tartu. Gos. Univ. 22 3 24 302159 (Russian)
9. R.S. Garfinkel K.C. Gilbert 1978 The bottleneck traveling salesman problem: algorithms and probabilistic analysis J. Assoc. Comput. Mach. 25 435 448 496641 0378.90095 10.1145/322077.322086
10. P.C. Gilmore R.E. Gomory 1964 Sequencing a one state-variable machine: a solvable case of the traveling salesman problem Oper. Res. 12 655 679 171620 0126.36006 10.1287/opre.12.5.655
11. K. Helsgaun 2000 An effective implementation of the Lin-Kernighan traveling salesman heuristic Eur. J. Oper. Res. 12 106 130 1781609 10.1016/S0377-2217(99)00284-2
12. D.S. Hochbaum D.B. Shmoys 1986 A unified approach to approximation algorithms for bottleneck problems J. Assoc. Comput. Mach. 33 533 550 849028 10.1145/5925.5933 (Pubitemid 16589619)
13. Johnson, D.S., McGeoch, L.A.: Benchmark code instance generation codes. http://www.research.att.com/~dsj/chtsp/download.html (2002a). Last updated May 2002
14. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A.P. (eds.) The Travelling Salesman Problem and Its Variants, pp. 369-444. Kluwer Academic, Secaucus (2002b), Chap. 9
15. Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovitch, A.: Experimental analysis of heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Travelling Salesman Problem and Its Variants, pp. 445-489. Kluwer Academic, Secaucus (2002), Chap. 10
16. Kabadi, S.: Polynomially solvable cases of the TSP. In: Gutin, G., Punnen, A.P. (eds.) The Travelling Salesman Problem and Its Variants, pp. 489-584. Kluwer Academic, Secaucus (2002), Chap. 11
17. Kabadi, S., Punnen, A.P.: The bottleneck TSP. In: Gutin, G., Punnen, A.P. (eds.) The Travelling Salesman Problem and Its Variants, pp. 697-736. Kluwer Academic, Secaucus (2002), Chap. 15
18. M.Y. Kao M. Sanghi 2009 An approximation algorithm for a bottleneck traveling salesman problem J. Discrete Algorithms 7 315 326 2529139 1190.68082 10.1016/j.jda.2008.11.007
19. P.S. Kljaus 1975 A special case of the bottleneck traveling salesman problem Vesci Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 141 1 61 65 378464 (Russian)
20. Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.H.G., Shmoys, D.B. (eds.): Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
21. S. Lin B.W. Kernighan 1973 An effective heuristic algorithm for the traveling salesman problem Oper. Res. 21 972 989 359742 10.1287/opre.21.2.498
22. G.S. Manku 1996 A linear time algorithm for the bottleneck biconnected spanning subgraph problem Inf. Process. Lett. 59 1 7 1418727 1052.68643 10.1016/0020-0190(96)00088-9 (Pubitemid 126375565)
23. R.G. Parker R.L. Rardin 1982 Guaranteed performance heuristics for the bottleneck traveling salesperson problem Oper. Res. Lett. 12 269 272 739678
24. J.M. Philips A.P. Punnen S.N. Kabadi 1998 A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph Inf. Process. Lett. 67 105 110 10.1016/S0020-0190(98)00094-5 (Pubitemid 128401909)
25. A.P. Punnen K.P.K. Nair 1994 A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem Inf. Process. Lett. 50 283 286 1281311 0814.68099 10.1016/0020-0190(94)00041-7 (Pubitemid 124013166)
26. R. Ramakrishnan P. Sharma A.P. Punnen 2009 An efficient heuristic algorithm for the bottleneck traveling salesman problem Opsearch 46 275 288 2557077 1188.90219 10.1007/s12597-009-0018-x
27. S.S. Reddi R. Ramamoorthy 1972 On the flow-shop sequencing problem with no wait in process Oper. Res. Q. 23 1 9 10.1057/jors.1972.52
28. Rego, C., Glover, F.: Local search and metaheuristics. In: The Travelling Salesman Problem and Its Variants, pp. 309-367. Kluwer Academic, Secaucus (2002), Chap. 8
29. Reinelt, G.: TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/ (2008)
30. V.I. Sarvanov 1995 A minimax traveling salesman problem on a plane: complexity of an approximate solution Dokl. Akad. Nauk Belarus 39 16 19 1384149 (Russian)
31. S.I. Sergeev 1995 Algorithms for solving a minimax traveling salesman problem. I. An approach based on dynamic programming Autom. Remote Control 56 7 1027 1032 1350634 0917.90252 Part 2 (Pubitemid 126013877)
32. S.I. Sergeev A.V. Chernyshenko 1995 Algorithms for solving a minimax traveling salesman problem. II. A dual approach Autom. Remote Control 56 8 1155 1168 1357504 0917.90253 Part 2
33. The world TSP page. http://www.tsp.gatech.edu/world/countries.html (2009)
34. E.A. Timofeev 1979 Minmax di-associated subgraphs and the bottleneck traveling salesman problem Cybernetics 4 75 79
35. UNB Advanced Computational Research Laboratory. http://acrl.cs.unb.ca (2005)
36. G.L. Vairaktarakis 2003 On Gilmore-Gomory's open question for the bottleneck TSP Oper. Res. Lett. 31 483 491 2003824 1052.90068 10.1016/S0167-6377(03)00050-6
37. J.A.A. van der Veen 1993 An O(n) algorithm to solve the bottleneck traveling salesman problem restricted to ordered product matrices Discrete Appl. Math. 47 57 75 1245335 0801.90120 10.1016/0166-218X(93)90152-E