Ejection chains, reference structures and alternating path methods for traveling salesman problems

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 223-253

  Glover, Fred ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Combinatorial optimization; Graph theory; Integer programming; Neighborhood search; Traveling salesman

Indexed keywords

EID: 0000204030     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00037-E     Document Type: Article

References (23)

1. C. Berge, Theory of Graphs and its Applications (Methuen, London, 1962).
2. D. de Werra and F.S. Roberts, On the use of augmenting chains in chain packings, Discrete Appl. Math. 30 (1991) 137-149.
3. U. Dorndorf and E. Pesch, Fast clustering algorithms, INFORM and University of Limburg (1992).
4. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bureau Standards 69B (1965) 125-130.
5. J. Edmonds, Matroid intersection, Ann. Discrete Math. 4 (1979) 39-40.
6. C.-N. Fiechter, A parallel tabu search algorithm for large scale traveling salesman problems, Working Paper 90/1, Département de Mathématiques, École Polytechnique Fédérale de Lausanne, Lausanne (1990).
7. F. Glover, A bound escalation method for the solution of integer linear programs, Cahiers Centre Études Rech. Opér. 6(3) (1964) 131-168.
8. F. Glover, Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem, School of Business, University of Colorado, Boulder, CO (1991).
9. F. Glover, New ejection chain and alternating path methods for traveling salesman problems, in: Balci, Sharda and Zenios, eds., Computer Science in Operations Research: New Developments in Their Interfaces (Pergamon, Oxford, 1992) 491-507.
10. F. Glover, Ejection chains and combinatorial leverage for traveling salesman problems, School of Business, University of Colorado, Boulder, CO (1992).
11. F. Glover and A. Punnen, The traveling salesman problem: Linear time heuristics with exponential combinatorial leverage, School of Business, University of Colorado, Boulder, CO (1994).
12. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper. Res. 41 (1993) 12-37.
13. B.L. Golden and W. R. Stewart, Empirical analysis of heuristics, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan and D.B. Schmoys, eds., The Traveling Salesman Problem (Wiley, New York, 1985) 207-250.
14. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
15. R. Hubscher and F. Glover, Ejection chain methods and tabu search for clustering, School of Business, University of Colorado, Boulder, CO (1992).
16. M. Laguna, J. Kelly, J.L. Gonzales-Velarde and F. Glover, Tabu search for the multilevel generalized assignment problem, European J. Oper. Res. 82 (1995) 176-189.
17. E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
18. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Schmoys, The Traveling Salesman Problem (Wiley, New York, 1985).
19. S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21 (1973) 498-516.
20. M. Malek, M. Guruswany, M. Pandya and H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, in: F. Glover and H.J. Greenberg, eds., Linkages With Artificial Intelligence, Ann. Oper. Res. 21 (1989) 59-84.
21. E. Pesch, Personal communications, 1991.
22. E. Pesch, Reference structures, neighborhoods and candidate lists for TSP ejection chains, University of Maastricht, Maastricht (1993).
23. C. Rego, Une heuristic tabou avec structures de voisinage composé pour les tournées de vehicules, INRIA, Le Chesnay, France (1993).