论文信息 - A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem

A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem

Consider a traveling salesman problem with stochastic travel times. Our objective is to find a tour with maximum probability of completion by a specified time. This paper presents a preference order dynamic program for solving the problem. To facilitate computation, we introduce a branch-and-bound strategy in the solution procedure. Finally, we propose an implicit enumeration algorithm as an alternative approach.

Edward P. C. Kao | E. P. Kao

[1] Edward P. C. Kao. A Preference Order Dynamic Program for Stochastic Assembly Line Balancing , 1976 .

[2] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[3] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[4] L. G. Mitten. Preference Order Dynamic Programming , 1974 .

[5] E. Lehmann. Testing Statistical Hypotheses , 1960 .

[6] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[7] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[8] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[9] Thomas L. Morin,et al. Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[10] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.