A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
- 1 December 1978
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 26 (6) , 1033-1045
- https://doi.org/10.1287/opre.26.6.1033
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: