Sniedovich, Moshe; Voß, Stefan The corridor method: a dynamic programming inspired metaheuristic. (English) Zbl 1123.49027 Control Cybern. 35, No. 3, 551-578 (2006). A heuristic for large dynamic programs called the corridor method is proposed, wherein a candidate solution is found at each stage by a full fledged optimization routine that seeks the global optimum over a neighborhood that is selected explicitly keeping the optimization method in mind. The technique is illustrated by using the travelling salesman problem as an example. Reviewer: V. S. Borkar (Mumbai) Cited in 16 Documents MSC: 49L20 Dynamic programming in optimal control and differential games 90C39 Dynamic programming Keywords:corridor method; dynamic programming; method-based neighbourhoods; method-based local search PDFBibTeX XMLCite \textit{M. Sniedovich} and \textit{S. Voß}, Control Cybern. 35, No. 3, 551--578 (2006; Zbl 1123.49027) Full Text: EuDML