A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem

Discrete Optimization

Volumn 3, Issue 1, 2006, Pages 78-85

  Ergun, Özlem ^a   Orlin, James B ^b  

^a Georgia Institute of Technology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dynamic programming; Traveling salesman problem; Very large scale neighborhood search

Indexed keywords

DYNAMIC PROGRAMMING; POLYNOMIALS;

DYNASEARCH NEIGHBORHOOD; VERY LARGE-SCALE NEIGHBORHOOD SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 33244480636     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.10.002     Document Type: Article

References (14)

1. E. Aarts J.K. Lenstra Local Search in Combinatorial Optimization 1997 John Wiley & Sons New York
2. R. Agarwal, Ö. Ergun, J.B. Orlin, C.N. Potts, Parallel machine scheduling problems with variable depth local search, Working paper, School of Ind. and Sys. Engr., Georgia Institute of Technology, Atlanta, 2003
3. R.K. Ahuja, Ö. Ergun, J.B. Orlin, and A.B. Punnen A survey of very large-scale neighborhood search techniques Discrete Applied Mathematics 123 2002 75 102
4. E. Balas, New classes of efficiently solvable generalized salesman problems, MSRR No. 615, GSIA, Carnegie Mellon University, Pittsburgh, 1996
5. E. Balas, and N. Simonetti Linear time dynamic programming algorithms for new classes of Restricted TSPs INFORMS Journal on Computing 13 2001 56 75
6. A. Bompadre, J.B. Orlin, Using grammars to generate very large scale neighborhoods for the traveling salesman problem and other sequencing problems, in: Proceedings of the 11th International IPCO Conference, Berlin, Germany, 2005, pp. 437-451
7. R.K. Congram, Polynomially searchable exponential neighborhoods for sequencing problems in combinatorial optimization, Ph.D. Dissertation, Faculty of Mathematical Studies, University of Southampton, UK, 2000
8. R.K. Congram, C.N. Potts, and S.L. van de Velde An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem INFORMS Journal on Computing 14 2002 52 67
9. V. Deǐneko, and G.J. Woeginger A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem Mathematical Programming 87 2000 519 542
10. Ö. Ergun, New neighborhood search algorithms based on exponentially large neighborhoods, Ph.D. Dissertation, Operations Research Center, MIT, Cambridge, 2001
11. Ö. Ergun, J.B. Orlin, A. Steele-Feldman, Creating very large scale neighborhoods out of smaller ones by compounding moves, Journal of Heuristics (2002) (in press)
12. G.M. Gutin, A. Yeo, and A. Zverovitch Exponential neighborhoods and domination analysis for the TSP G. Gutin A.P. Punnen The TSP and Its Variations 2002 Kluwer Academic Publishers Boston
13. M. Held, and R.M. Karp A dynamic programming approach to sequencing problems Journal of SIAM 10 1962 196 210
14. C.N. Potts, S.L. van de Velde, Dynasearch-iterative local improvement by dynamic programming: part I, The traveling salesman problem, Faculty of Mathematical Studies, University of Southampton, UK, 1995 (preprint)