Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move

Journal of Heuristics

Volumn 2, Issue 2, 1996, Pages 169-179

  Glover, Fred ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

ACYCLIC SHORTEST PATH MODEL; EJECTION CHAIN METHODS; NODES; TRAVELING SALESMAN PROBLEM;

HEURISTIC METHODS;

EID: 0030234195     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00247211     Document Type: Article

References (13)

1. Berge, C. (1962). Theory of Graphs and Its Applications. London: Methuen.
2. Fiechter, C.-N. (1994). "A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems." Discrete Applied Math 51, 243-267.
3. Glover, F. (1989). "Candidate List Strategies and Tabu Search." CAAI Research Report, University of Colorado, Boulder, July.
4. Glover, F. (1992). "Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems." University of Colorado. Shortened version published in Discrete Applied Mathematics (1996), 65, 223-253.
5. Glover, F., and M. Laguna. (1996). Tabu Search. Boston: Kluwer.
6. Hertz, A., É. Taillard, and D. de Werra (1996). "Tabu Search." In E.H.L. Aarts, and J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization. Chichester: Wiley.
7. Johnson, D.S., and L.A. McGeoch. (1996). "The Traveling Salesman Problem: A Case Study in Local Optimization." In E.H.L. Aarts, and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization. New York: Wiley.
8. Martin, O., S.W. Otto, and E.W. Felten. (1992). "Large-Step Markov Chains for TSP Incorporating Local Search Heuristics." Operations Research Letters 11:219-224.
9. Pesch, E., and F. Glover. (1995). "TSP Ejection Chains." Graduate School of Business, University of Colorado, Boulder. To appear in Discrete Applied Mathematics.
10. Punnen, A., and F. Glover, (1996). "Implementing Ejection Chains with Combinatorial Leverage for TSPs." Graduate School of Business, University of Colorado, Boulder.
11. Rego, C. (1996). "Relaxed Tours and Path Ejections for the Traveling Salesman Problem." Technical report, Laboratoire PRiSM, Université de Versailles.
12. Rego, C., and C. Roucairol. (1996), "A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem." In I.H. Osman and J.P. Kelly (Eds.), Meta-Heuristics: Theory & Applications (pp. 661-675). Boston: Kluwer.
13. Zachariasen, M., and M. Dam. (1996). "Tabu Search on the Geometric Traveling Salesman Problem." In I.H. Osman, and J.P. Kelly (Eds.), Meta-Heuristics: Theory & Applications (pp. 571-587). Boston: Kluwer.