A distributed chained Lin-Kernighan algorithm for TSP problems

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Fischer, Thomas ^a   Merz, Peter ^a  

^a France   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINED LIN-KERNIGHAN ALGORITHM (CLK); CPU MINUTES; DISTRIBUTED VARIANT; OPTIMAL TOURS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

TRAVELING SALESMAN PROBLEM;

EID: 33746281222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.18     Document Type: Conference Paper

References (24)

1. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem, http://www.research.att.com/~dsj/chtsp/.
2. Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html.
3. National Traveling Salesman Problems, http://www.tsp.gatech.edu/world/countries.html.
4. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. Finding Cuts in the TSP (a Preliminary Report). Technical report, Rutgers University, Piscataway NJ, 1995.
5. D. Applegate, W. Cook, and A. Rohe. Chained LinKernighan for large traveling salesman problems. Technical Report 99887, Forschungsinstitut fr Diskrete Mathematik, Universit Bonn, 1999.
6. A. Bachem and M. Wottawa. Parallelisierung von Heuristiken für große Traveling-Salesman-Probleme. In M. Baumann and R. Grebe, editors, Transputer-Anwender-Treffen, Informatik Aktuell, pages 204-213. Springer, 1993.
7. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J. F. Traub, editor, Symposium on New Directions and Recent Results in Algorithms and Complexity, page 441, Orlando, Florida, 1976. Academic Press.
8. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. Lecture Notes in Computer Science, 2009:46, 2001.
9. S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158. ACM Press, 1971.
10. W. Cook and P. Seymour. Tour Merging via BranchDecomposition. INFORMS Journal on Computing, 15(3):233-248, 2003.
11. G. Dantzig, R. Fulkerson, and S. Johnson. Solution of a large-scale traveling-salesman problem. Operations Research, 2:393-410, 1954.
12. P. T. Eugster, R. Guerraoui, A.-M. Keimarrec, and L. Massoulie. From Epidemics to Distributed Computing. COMPUTER: IEEE Computer, 2004.
13. T. Fischer and P. Merz. Embedding a Chained LinKernighan Algorithm into a Distributed Algorithm. Interner Bericht 331/04, University of Kaiserslautern, Kaiserslautern, Germany, Aug. 2004.
14. M. M. Flood. The Travelling Salesman Problem. Operations Research, 4:61-75, 1956.
15. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
16. M. Gorges-Schleuter. Asparagos96 and the Traveling Salesman Problem. In T. Back, Z. Michalewicz, and X. Yao, editors, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, USA, pages 171-174. IEEE Press, 1997.
17. K. Helsgaun. An effective implementation of the LinKernighan traveling salesman heuristic. European Journal of Operational Research, 126(1):106-130, 2000.
18. D. S. Johnson and L. A. McGeoch. Experimental Analysis of Heuristics for the STSP. In Gutin and Punnen, editors, The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, 2002.
19. S. Lin. Computer Solutions Of The Traveling Salesman Problem. Bell System Technical Journal, 44:2245-2269, 1965.
20. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516, 1973.
21. O. Martin, S. W. Otto, and E. W. Felten. Large-Step Markov Chains for the Traveling Salesman Problem. Complex Systems, 5:299-326, 1991.
22. B. Paechter, T. Back, M. Schoenauer, M. Sebag, A. E. Eiben, J. J. Merelo, and T. C. Fogarty. A distributed resource evolutionary algorithm machine (DREAM). In Proceedings of the Congress on Evolutionary Computation 2000 (CEC 2000), pages 951-958. IEEE, IEEE Press, 2000.
23. G. Reinelt. TSPLIB - A Traveling Salesman Problem Library. ORSA Journal On Computing, 3:376-384, 1991.
24. C. Walshaw. A Multilevel Approach to the Travelling Salesman Problem. Mathematics research report 00/im/63, Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK, Aug. 2000.