TSP ejection chains

Discrete Applied Mathematics

Volumn 76, Issue 1-3, 1997, Pages 165-181

  Pesch, Erwin ^a   Glover, Fred ^b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005344122     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00123-0     Document Type: Article

References (21)

1. D. Applegate, R. Bixby, V. Chvatál and W. Cook, Finding cuts in the TSP, Preliminary Report, At&T Bell Labs, Rice University, Rutgers University and Bellcore (1994).
2. C. Berge, Theory of Graphs and its Applications (Methuen, London, 1962).
3. U. Dorndorf and E. Pesch, Fast clustering algorithms, ORSA J. Comput. 6 (1994) 141-153.
4. M. Gendreau, A. Hertz and G. Laporte, New insertion and postoptimization procedures for the traveling salesman problem, Oper. Res. 40 (1992) 1086-1094.
5. F. Glover, Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem, Graduate School of Business, University of Colorado, Boulder (1991).
6. F. Glover, Ejection chains, reference structures and alternating path methods for the traveling salesman problem, Graduate School of Business, University of Colorado, Boulder (1992).
7. F. Glover and E. Pesch, Ejection chains and graph-related applications, Graduate School of Business, University of Colorado, Boulder (1995).
8. D.S. Johnson, Local optimization and the traveling salesman problem, Proceedings of the 17th Colloquim on Automata, Languages, and Programming (Springer, Berlin, 1990) 446-461.
9. J.P. Kelly, M. Laguna and F. Glover, A study of diversification strategies for the quadratic assignment problem, Comput. Oper. Res. 21 (1994) 885-893.
10. A. Kolen and E. Pesch, Genetic local search in combinatorial optimization, Discrete Appl. Math. 48 (1994) 273-284.
11. M. Laguna, J. Kelly, J.L. Gonzales-Velarde and F. Glover, Tabu search for the multilevel generalized assignment problem, Graduate School of Business, University of Colorado, Boulder (1991) European J. Oper. Res., to appear.
12. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, The traveling salesman problem (Wiley, Chichester, 1985).
13. S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21 (1973) 498-516.
14. K.-T. Mak and A.J. Morton, A modified Lin-Kernighan traveling-salesman heuristic, Oper. Res. Lett. 13 (1993) 127-132.
15. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
16. E. Pesch, Learning in Automated Manufacturing (Physica, Heidelberg, 1994).
17. C. Rego and C. Roucairol, An efficient implementation of ejection chain procedures for the vehicle routing problem, Research Report RR-94/44, PRISM Laboratory, University of Versailles (1994).
18. G. Reinelt, The Traveling Salesman (Springer, Berlin, 1994).
19. W.R. Stewart, J.P. Kelly and M. Laguna, Solving vehicle routing problems using generalized assignments and tabu search, Graduate School of Business, University of Colorado, Boulder (1994).
20. N. Ulder, E.H.L. Aarts, H.-J. Bandelt, P.J.M. van Laarhoven and E. Pesch, Genetic local search algorithms for the traveling salesman problem, Lecture Notes in Computer Science, Vol. 496 (1991) 109-116.
21. J. Xu and J.P. Kelly, A robust network flow-based tabu search approach for the vehicle routing problem, Graduate School of Business, University of Colorado, Boulder (1995).