Relaxed tours and path ejections for the traveling salesman problem

European Journal of Operational Research

Volumn 106, Issue 2-3, 1998, Pages 522-538

  Rego, César ^a  

^a UNIVERSIDADE PORTUCALENSE   (Portugal)

Author keywords

Ejection chains; Tabu search; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION;

EJECTION CHAINS; TABU SEARCH METHODS; TRAVELING SALESMAN PROBLEM (TSP);

OPERATIONS RESEARCH;

EID: 0032045851     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00288-9     Document Type: Article

References (30)

1. C. Berge, Theory of Graphs and its Applications, Methuen, London, 1962.
2. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
3. J.J. Dongarra, Performance of various computers using standard linear equations software. Technical Report CS-89-85. University of Tennessee and Oak Ridge National Laboratory, 1997.
4. U. Dorndorf, E. Pesch, Fast clustering algorithms, ORSA Journal on Computing 6 (1994) 141-153.
5. J. Edmonds, Covers and packings in family of sets. Bulletin of the American Mathematical Society 68 (1962) 494-499.
6. J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 17 (1965) 449-467.
7. F. Glover, New ejection chain and alternating path methods of traveling salesman problems, Computer Science and Operations Research (1992) 449-509.
8. F. Glover, Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move. Journal of Heuristics 2 (1996) 169-179.
9. F. Glover, J. Hultz, D. Klingman, J. Stutz, Generalized networks: A fundamental computer based planning tool. Management Science 24 (1978) 1209-1220.
10. M. Grötschel, O. Holland, Solution of large-scale traveling salesman problems. Mathematical Programming 51 (1991) 141-202.
11. M. Held, R. Karp, The traveling-salesman problem and minimum spanning trees. Operations Research 18 (1970) 1138-1162.
12. M. Held, R. Karp. The traveling-salesman problem and minimum spanning trees. Part II, Mathematical Programming 1 (1971) 6-25.
13. R. Hubscher, F. Glover, Ejection chain methods and tabu search for clustering. Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder, 1992.
14. D. Johnson, C. Papadimitriou, The Traveling Salesman Problem, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.). Computational complexity, Wiley, Chichester, 1985.
15. D.S. Johnson, Local search and the traveling salesman problem. Lecture Notes in Computer Science. Proceedings of 17th International Colloqium on Automata Languages and Programming, Springer, Berlin, 1990, pp. 443-460.
16. D.S. Johnson, J.L. Bentley, L.A. MacGeoch, E.E. Rothberg, Near-optimal solutions to very large traveling salesman problems, Technical Report, 1996 (in preparation).
17. M. Laguna, J.P. Kelly, J.L. Gonzalez-Valarde, F. Glover, Tabu search for multilevel generalized assignment problems, European Journal of Operational Research 82 (1995) 176.
18. G. Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59 (1992) 345-358.
19. E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys. A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985.
20. S. Lin, B. Kernighan, An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21 (1973) 498-516.
21. K. Mak, A. Morton. A modified Lin Kernighan traveling salesman heuristic, ORSA Journal on Computing 13 (1992) 127-132.
22. M. Padberg, G. Rinaldi, Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut, Operations Research Letters 6 (1987) 1-7.
23. M. Padberg, G. Rinaldi, A branch-and-cut algorithm for the solution of large-scale traveling salesman problems, SIAM Review 33 (1991) 1-41.
24. M. Padberg, G. Rinaldi, Facet identification for the symetric traveling salesman problem, Mathematical Programming 33 (1991) 219-257.
25. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs. NJ, 1982.
26. C. Rego, C. Roucairol, An efficient implementation of ejection chain procedures for the vehicle routing problem, Technical Report 44, PRiSM Laboratory, University of Versailles, 1994.
27. C. Rego, C. Roucairol, Parallel Tabu Search Algorithm based on Ejection Chains for the Vehicle Routing Problem, in: I.H. Osman, J.P. Kelly (eds), Methaheuristics: Theory and Applications, Kluwer Academic Publishers, Dordrecht, 1996.
28. G. Reinelt, TSPLIB - A Traveling Salesman Problem Library, European Journal of Operational Research 17 (1991) 125.
29. G. Reinelt, The Traveling Salesman Problem, Computational Solutions for TSP Applications, Lecture Notes in Computer Science, vol. 840, Springer, Berlin, 1994.
30. J. Renaud, F. Boctor, G. Laporte, A fast composite heuristic for the symmetric traveling salesman problem, INFORMS Journal on Computing 8 (1996) 134-143.