Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application

  title={Dynamic Traveling Salesman Problem in Stochastic-State Network Setting for Search-and-Rescue Application},
  author={David Fajardo and Steven Travis Waller},
  journal={Transportation Research Record},
  pages={122 - 130}
The problem presented in this paper was motivated by the need for a solution to be used in a search-and-rescue application and is formulated as a dynamic traveling salesman problem in a stochastic-state network setting. This problem formulation features a full-recourse decision framework and stochastic demands that are revealed only through direct observation. This problem is defined in a stochastic-state network setting, which allows the modeling of implicitly correlated demand stochasticity… 

Tables from this paper

A single depot concrete delivery with time windows model using integer and assignment variables
This work proposes a novel formulation for the single-depot RMCDP that attempts to integrate time windows restrictions by assigning vehicles to feasible delivery slots and uses integer variables to represent repeated trips between depot and customer nodes.
Multi-agent Path Planning Problem Under a Multi-objective Optimization Framework
In this study, a mixed-integer programming formulation is developed for a team of homogeneous sensing agents under a bi-objective optimization framework to solve a discrete open-loop centralized
An improvement of fruit fly optimization algorithm for solving traveling salesman problems
A new TSP solving algorithm is proposed based on an improved fruit fly optimization algorithm, which improves the diversity of the population and prevents premature, and the strategy of adaptive variable step size is adopted, which increases search efficiency effectively.
Vehicle Routing for Emergency Evacuations


An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
The stochastic vehicle routing problem, where each customer has a known probability of presence and a random demand, is considered and is solved for the first time to optimality by means of an integer L-shaped method.
A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
The model is motivated by applications in which the objective is to minimize the wait for service in a stochastic and dynamically changing environment, a departure from classical vehicle routing problems where one seeks to minimize total travel time in a static, deterministic environment.
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
This paper analyzes the problem of m identical vehicles with unlimited capacity and shows that in heavy traffic the system time is reduced by a factor of 1/m2 over the single-server case and considers the case in which each vehicle can serve at most q customers before returning to a depot.
A Vehicle Routing Problem with Stochastic Demand
This work considers a natural probabilistic variation of the classical vehicle routing problem (VRP), in which demands are stochastic, and proposes heuristics and algorithms to construct an a priori sequence among all customers of minimal expected total length.
A dynamic vehicle routing problem with time-dependent travel times
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
An investigation of the single-vehicle, many-to-many, immediate-request dial-a-ride problem is developed, with a Dynamic Programming approach which exhibits a computational effort which is asymptotically lower than the corresponding effort of the classical Dynamic Programming algorithm applied to a Traveling Salesman Problem of the same size.
A Priori Optimization of the Probabilistic Traveling Salesman Problem
The probabilistic traveling salesman problem is formulated as an integer linear stochastic program, and solved by means of a branch-and-cut approach which relaxes some of the constraints and uses lower bounding functionals on the objective function.
The Vehicle Routing Problem with Stochastic Travel Times
Three mathematical programming models are presented: a chance constrained model, a three-index simple recourse model and a two-index recourse model that indicate that moderate size problems can be solved to optimality.
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
This paper considers the vehicle routing problem with stochastic demands, and a new solution framework for the problem using Markovian decision processes is presented.
Stochastic Vehicle Routing with Random Travel Times
This work considers stochastic vehicle routing problems on a network with random travel and service times and provides bounds on optimal objective function values and conditions under which reductions to simpler models can be made.