Technical Note - Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
暂无分享,去创建一个
This paper presents a new algorithm for finding all solutions with objective function values in the neighborhood of the optimum for certain dynamic programming models, including shortest path problems. The new algorithm combines the depth-first search with stacking techniques of theoretical computer science and principles from dynamic programming to modify the usual backtracking routine and list all near-optimal policies. The resulting procedure is the first practical algorithm for a variety of large problems that are of interest.
[1] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[2] M S Waterman,et al. Sequence alignments in the neighborhood of the optimum with general application to dynamic programming. , 1983, Proceedings of the National Academy of Sciences of the United States of America.
[3] A. Unwin. The Art and Theory of Dynamic Programming , 1979 .
[4] J. Wijngaard. Dynamic programming: Models and applications: E.V. DENARDO Prentice-Hall, Englewood Cliffs, 1982, xii + 277 pages, $36.40 , 1984 .