The corridor method: A dynamic programming inspired metaheuristic

Control and Cybernetics

Volumn 35, Issue 3, 2006, Pages 551-578

  Sniedovich, Moshe ^a   Voß, Stefan ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Corridor method; Curse of dimensionality; Dynamic programming; Global optimization; Metaheuristics; Method based; Move based; Traveling salesman problem; Very large neighborhoods

Indexed keywords

EID: 33947275099     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (23)

1. AHUJA, R.K., ERGUN, O., ORLIN, J.B., and PUNNEN, A.P. (2002) A survey of large-scale neighborhood search techniques. Discrete Applied Mathematics 123(1-3), 75-102.
2. BALAS, E. (1999) New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research 86, 529-558.
3. BALAS, E. and SIMONETTI, N. (2001) Linear time dynamic programming algorithms for new classes of restricted TSP's: a computational study. INFORMS Journal on Computing 13(1), 56-75.
4. BELLMAN, R.E. (1957) Dynamic Programming. Princeton University Press.
5. CARRAWAY, R.L., and MORIN, T.L. (1988) Theory and applications of generalized dynamic programming: an overview. International Journal of Computers and Mathematics with Applications 16, 779-788.
6. CHOW, V.T., MAIDEMENT, D.M. and TAUXE, G.W. (1975) Computer time and memory for DP and DDDP in water resource systems analysis. Water Resources Research 11(3), 621-628.
7. DANTZIG, G., FULKERSON, D. and JOHNSON, S. (1954) Solution of a Large Scale Traveling Salesman Problem. Operations Research 2, 393-410.
8. GAREY, M.R. and JOHNSON, D.S. (1979) Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman.
9. HEIDARI, M., CHOW, T., and KOKOTOVIC, P.V. (1971) Discrete differential dynamic programming approach to water resources systems optimization. Water Resources Research 7(2), 273-282.
10. HOOS, H.H. and STÜTZLE, T. (2004) Stochastic Local Search. Elsevier.
11. IBARAKI, T. (1987) Enumerative Approaches to Combinatorial Optimization. J.C. Baltzer AG, Basel
12. KOSSMANN, D. and STOCKER, K. (2000) Iterative dynamic programming: a new class of query optimization algorithms. ACM Transactions on Data-base Systems 25(1), 43-82.
13. LEUNG C., APPLETON, B and SUN, C. (2004) Fast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning. In: A. Hoppe, S. Barman, and T. Ellis, eds. British Machine Vision Conference 1, 97-106, Kingston University, London.
14. LUUS, R. (2000) Iterative Dynamic Programming. Chapman and Hall, London.
15. MORIN, T.L. and MARSTEN, R.E. (1976) Branch and bound strategics for dynamic programming. Operations Research 24, 611-627.
16. MARTIN, R.K., RARDIN, R.L. and CAMPBELL, B.A. (1990) Polyhedral characterization of discrete dynamic programming. Operations Research 38(1), 127-138.
17. MILLER, C., TUCKER, A. and ZEMLIN, R. (1960) Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM 7, 326-329.
18. POTTS, C. and VAN DE VELDE, S. (1995) Dynasearch - iterative local improvement by dynamic programming. Technical Report, University of Twente.
19. SHERALI, H.D. and DRISCOLL, P.J. (2002) On tightening the relaxations of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problems. Operations Research 50(4), 656-669.
20. SNIEDOVICH, M. (1992) Dynamic Programming. Marcel Dekker, NY.
21. VOSS, S. (2001) Meta-heuristics: The state of the art. In: Local Search for Planning and Scheduling. 1-23, LNAI 2148, Springer-Verlag.
22. WINSTON, W.L. (1994) Operations Research: Applications and Algorithms, 3rd edition. Thompson International, Belmont.
23. YAKOWITZ, S.J. (1982) Dynamic programming applications in water resources, Water Resources Research, 18, 673-696.