Embedding a Chained Lin-Kernighan algorithm into a distributed algorithm

Operations Research/ Computer Science Interfaces Series

Volumn 39, Issue , 2007, Pages 277-295

  Fischer, Thomas ^a   Merz, Peter ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Combinatorial optimization; Distributed algorithm; Evolutionary algorithm; Traveling salesman problem

Indexed keywords

EID: 65649120979     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-71921-4_15     Document Type: Article

References (28)

1. [Applegate et al., 1995] Applegate, David, Bixby, Robert, Chvátal, Vašek, and Cook, William (1995). Finding Cuts in the TSP (a Preliminary Report). Technical report, Rutgers University, Piscataway NJ.
2. [Applegate et al., 1999] Applegate, David, Bixby, Robert, Chvátal, Vašek, and Cook, William (1999). Finding tours in the TSP. Technical Report 99885, Forschungsinstitut für Diskrete Mathematik, Universit Bonn.
3. [Arora, 1998] Arora, Sanjeev (1998). Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Problems. Journal of the ACM, 45(5): 753-782.
4. [Baraglia et al., 2001] Baraglia, Ranieri, Hidalgo, José Ignacio, and Perego, Raffaele (2001). A Parallel Hybrid Heuristic for the TSP. In Proceedings of EvoCOP2001, the First European Workshop on Evolutionary Computation in Combinatorial Optimization, pages 193-202.
5. [Christofides, 1976] Christofides, N. (1976). Worst-case analysis of a new heuristic for the traveling salesman problem. In Traub, J. F., editor, Symposium on New Directions and Recent Results in Algorithms and Complexity, page 441, Orlando, Florida. Academic Press.
6. [Cook, 1971] Cook, Stephen A. (1971). The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158. ACM Press.
7. [Cook, a] Cook, William. Concorde TSP Solver. See: http://www. tsp. gatech. edu/concorde. html.
8. [Cook, b] Cook, William. National Traveling Salesman Problems. http://www. tsp. gatech. edu/world/countries. html.
9. [Dantzig et al., 1954] Dantzig, George, Fulkerson, Ray, and Johnson, Selmer (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 2: 393-410.
10. [Flood, 1956] Flood, M. M. (1956). The Travelling Salesman Problem. Operations Research, 4: 61-75.
11. [Garey and Johnson, 1979] Garey, Michael R. and Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
12. [Grosso, 1985] Grosso, P. B. (1985). Computer Simulation of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model. PhD thesis, University of Michigan.
13. [Harik et al., 1999] Harik, G., Lobo, F., and Goldberg, D. (1999). The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 3: 287-297.
14. [Held and Karp, 1970] Held, M. and Karp, Richard M. (1970). The Travelling Salesman Problem and Minimum Spanning Trees. Operations Research, 18: 1138-1162.
15. [Held and Karp, 1971] Held, M. and Karp, Richard M. (1971). The Travelling Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming, 1(1): 6-25.
16. [Helsgaun, 2000] Helsgaun, Keld (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1): 106-130.
17. [Hung, 2004] Hung, Nguyen Dinh (2004). Hybrid Genetic Algorithms for Combinatorial Optimization Problems. PhD thesis, Department of Information Systems Engineering, Graduate School of Engineering, University of Miyazaki, Miyazaki, Japan.
18. [Johnson] Johnson, David S. 8th DIMACS Implementation Challenge: The Traveling Salesman Problem. http://www. research. att. com/~dsj/chtsp/.
19. [Johnson and McGeoch, 1997] Johnson, David S. and McGeoch, Lyle A. (1997). Local Search in Combinatorial Optimization, chapter The Traveling Salesman Problem: A Case Study in Local Optimization, pages 215-310. John Wiley and Sons, Ltd.
20. [Johnson and McGeoch, 2002] Johnson, David S. and McGeoch, Lyle A. (2002). Experimental Analysis of Heuristics for the STSP. In Gutin and Punnen, editors, The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers.
21. [Lawler and Wood, 1966] Lawler, E. L. and Wood, D. E. (1966). Branch-and-Bound Methods: A Survey. Operations Research, 14(4): 699-719.
22. [Lin, 1965] Lin, S. (1965). Computer Solutions Of The Traveling Salesman Problem. Bell System Technical Journal, 44: 2245-2269.
23. [Lin and Kernighan, 1973] Lin, S. and Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21: 498-516.
24. [Martin et al., 1991] Martin, Olivier, Otto, Steve W., and Felten, Edward W. (1991). Large-Step Markov Chains for the Traveling Salesman Problem. Complex Systems, 5: 299-326.
25. [Merz and Freisleben, 2001] Merz, Peter and Freisleben, Bernd (2001). Memetic Algorithms for the Traveling Salesman Problem. Complex Systems, 13(4): 297-345.
26. [Merz and Gorunova, 2005] Merz, Peter and Gorunova, Katja (2005). Efficient Broadcast in P2P Grids. In Proceedings of the IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2005), Cardiff, UK.
27. [Reinelt, 1991] Reinelt, Gerhard (1991). TSPLIB-A Traveling Salesman Problem Library. ORSA Journal On Computing, 3: 376-384.
28. [Walshaw, 2000] Walshaw, Chris (2000). A Multilevel Approach to the Travelling Salesman Problem. Mathematics Research Report 00/1M/63, Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK.