Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
Authors:
- Ann Melissa CampbellACAnn Melissa Campbell
- Barrett W. ThomasBTBarrett W. Thomas
- 1 April 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (4) , 1231-1248
Abstract
No abstract availableThis publication has 37 references indexed in Scilit:
- Probabilistic Traveling Salesman Problem with DeadlinesTransportation Science, 2008
- Territory Planning and Vehicle Dispatching with Driver LearningTransportation Science, 2007
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problemEuropean Journal of Operational Research, 2007
- Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithmsEuropean Journal of Operational Research, 2005
- A Priori Optimization of the Probabilistic Traveling Salesman ProblemOperations Research, 1994
- Further results on the probabilistic traveling salesman problemEuropean Journal of Operational Research, 1993
- The vehicle scheduling problem with intermittent customer demandsComputers & Operations Research, 1992
- A Priori OptimizationOperations Research, 1990
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are VisitedOperations Research, 1988
- A Minimal Technology Routing System for Meals on WheelsInterfaces, 1983