Probabilistic Traveling Salesman Problem with Deadlines

Authors:
Ann M. Campbell;Barrett W. Thomas
Affiliations:
Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242;Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242
Venue:
Transportation Science
Year:
2008

Citing 0
Cited 10

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Computers and Operations Research
Arc-Routing Models for Small-Package Local Routing

Transportation Science
The Consistent Vehicle Routing Problem

Manufacturing & Service Operations Management
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays

Discrete Applied Mathematics
Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Stochastic vehicle routing with recourse

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hardness results for the probabilistic traveling salesman problem with deadlines

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines

Journal of Parallel and Distributed Computing
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling

Computers and Operations Research
Stochastic Preplanned Household Activity Pattern Problem with Uncertain Activity Participation SHAPP

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Time-constrained deliveries are one of the fastest growing segments of the delivery business, and yet there is surprisingly little literature that addresses time constraints in the context of stochastic customer presence. We begin to fill that void by introducing the probabilistic traveling salesman problem with deadlines (PTSPD). The PTSPD is an extension of the well-known probabilistic traveling salesman problem (PTSP) in which, in addition to stochastic presence, customers must also be visited before a known deadline. We present two recourse models and a chance constrained model for the PTSPD. Special cases are discussed for each model, and computational experiments are used to illustrate under what conditions stochastic and deterministic models lead to different solutions.