A two-stage vehicle routing model for large-scale bioterrorism emergencies

In this article, we are interested in routing vehicles to service a large-scale bioterrorism emergency. We describe the specifics of routing vehicles in such a large-scale emergency and decompose the problem into two stages: a planning stage and an operational stage. In the planning stage, we generate the routes well in advance of any emergency. In the operational stage, we take into account the planned routes and the information revealed at the time of the emergency, to decide the delivery quantity and any adjustments to the routes. We propose mathematical formulations and solution approaches for both stages. Lastly, we demonstrate the effectiveness of our formulations and solution procedures in developing robust routes through numerical experiments. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009

[1]  Elise Miller-Hooks,et al.  Algorithms for a stochastic selective travelling salesperson problem , 2005, J. Oper. Res. Soc..

[2]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[3]  Vicky H. Mak-Hau,et al.  Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem , 2006, J. Comb. Optim..

[4]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[5]  M. Rosenwein,et al.  Strong linear programming relaxations for the orienteering problem , 1994 .

[6]  Petros A. Ioannou,et al.  Truck route planning in nonstationary stochastic networks with time windows at customer locations , 2006, IEEE Transactions on Intelligent Transportation Systems.

[7]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[8]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[9]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[10]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[11]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[12]  Gilbert Laporte,et al.  An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers , 1995, Transp. Sci..

[13]  Edward P. C. Kao,et al.  A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem , 1978, Oper. Res..

[14]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[15]  Kamlesh Mathur,et al.  Stochastic Vehicle Routing Problem with Restocking , 2000, Transp. Sci..

[16]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[17]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[18]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[19]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[20]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[21]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[22]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[23]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[24]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[25]  Giovanni Righini,et al.  Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery , 2007, Comput. Oper. Res..

[26]  Alan L. Erera,et al.  A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands , 2007, Transp. Sci..

[27]  Robert H. Storer,et al.  Detailed Numerical Results for Paper: A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem , 2009 .

[28]  Qiwen Wang,et al.  Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..

[29]  David Pisinger A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[30]  B. Golden,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .

[31]  Antoine Jézéquel,et al.  Probabilistic vehicle routing problems , 1985 .

[32]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[33]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[34]  Thomas L. Morin,et al.  Generalized Dynamic Programming for Stochastic Combinatorial Optimization , 1989, Oper. Res..

[35]  John M. Norman,et al.  Dynamic Programming in Orienteering: Route Choice and the Siting of Controls , 1984 .

[36]  M. Dror Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution , 1993 .

[37]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[38]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[39]  Fred W. Glover,et al.  Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits , 2008, J. Math. Model. Algorithms.

[40]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[41]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[42]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[43]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[44]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[45]  Moshe Dror,et al.  Stochastic vehicle routing with modified savings algorithm , 1986 .

[46]  Bruce L. Golden,et al.  Stochastic vehicle routing: A comprehensive approach , 1983 .

[47]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[48]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[49]  Moshe Dror,et al.  Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..

[50]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[51]  G. Laporte,et al.  A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem , 1998 .

[52]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[53]  Alice E. Smith,et al.  A genetic algorithm for the orienteering problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[54]  Richard C. Larson,et al.  Responding to Emergencies: Lessons Learned and the Need for Analysis , 2006, Interfaces.

[55]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[56]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[57]  Mark S. Daskin,et al.  The orienteering problem with stochastic profits , 2008 .

[58]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[59]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[60]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[61]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[62]  M. Dror,et al.  Split delivery routing , 1990 .

[63]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .