Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Edward P. C. Kao (1978) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: