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

Networks

Volumn 54, Issue 4, 2009, Pages 255-269

  Shen, Zhihong ^a,b   Dessouky, Maged M ^a   Ordóñez, Fernando ^a  

^a University of Southern California ^*  (United States)

^b MICROSOFT   (United States)

Author keywords

Recourse strategies; Tabu search heuristic; Uncertainty; Vehicle routing problem

Indexed keywords

BIO-TERRORISM; LARGE-SCALE EMERGENCY; MATHEMATICAL FORMULATION; NUMERICAL EXPERIMENTS; OPERATIONAL STAGES; PLANNING STAGES; ROUTING VEHICLES; SOLUTION APPROACH; SOLUTION PROCEDURE; TABU SEARCH HEURISTIC; TWO STAGE; VEHICLE ROUTING PROBLEMS;

BIOTECHNOLOGY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLES;

TABU SEARCH;

EID: 71949099703     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20337     Document Type: Article

References (76)

1. A. Ak and A. Erera, A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands, Transportation Science 41 (2007), 222-237.
2. C. Archetti, A. Hertz, and M.G. Speranza, A tabu search algorithm for the split delivery vehicle routing problem, Transportation Sci 40 (2006), 64-73. (Pubitemid 43312233)
3. C. Archetti, A. Hertz, and M.G. Speranza, Metaheurisitics for the team orienteering problem, J Heuristics 13 (2007), 49-76.
4. D. Bertsimas, Probabilistic combinational optimization problems, PhD Thesis, Operation Research Center, Massachusetts Institute of Technology, Cambridge, MA, 1988.
5. D. Bertsimas, A vehicle routing problem with stochastic demand, Oper Res 40 (1992), 574-585.
6. D. Bertsimas and D. Simchi-Levi, A new generation of vehicle routing research: Robust algorithms, addressing uncertainty, Oper Res 44 (1996), 286-304.
7. N. Bianchessi and G. Righini, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Comput Oper Res 34 (2006), 578-594.
8. S. Boussier, D. Feillet, and M. Gendreau, An exact algorithm for team orienteering problems, 4OR 5 (2007), 211-230.
9. S.E. Butt and T.M. Cavalier, A heuristic for the multiple tour maximum collection problem, Comput Oper Res 21 (1994), 101-111.
10. S.E. Butt and D.M. Ryan, A optimal solution procedure for the multiple tour maximum collection problem using column generation, Comput Oper Res 26 (1999), 427-441.
11. R. Carraway, T. Morin, and H. Moskowitz, Generalized dynamic programming for stochastic combinatorial optimization, Oper Res 37 (1989), 819-829.
12. I.-M. Chao, B. Golden, and E. Wasil, A fast and effective heuristic for the orienteering problem, Eur J Oper Res 88 (1996), 475-1189
13. I.-M. Chao, B. Golden, and E. Wasil, The team orienteering problem, Eur J Oper Res 88 (1996), 464-474.
14. S. Chen, B.L. Golden, and E. Wasil, The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results, Networks 49 (2007), 318-329. (Pubitemid 47324738)
15. G. Clarke and J. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper Res 12 (1964), 568-581.
16. M. Dror, Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, Eur J Oper Res 64 (1993), 432-441.
17. M. Dror, G. Laporte, and P. Trudeau, Vehicle routing with stochastic demands: Properties and solution framework, Transportation Sci 23 (1989), 166-176.
18. M. Dror, G. Laporte, and P. Trudeau, Vehicle routing with split deliveries, Discrete Appl Math 50 (1994), 239-254.
19. M. Dror and P. Trudeau, Stochastic vehicle routing with modified savings algorithm, Eur J Oper Res 23 (1986), 228-235.
20. M. Dror and P. Trudeau, Savings by split delivery routing, Transportation Sci 23 (1989), 141-145.
21. M. Dror and P. Trudeau, Split delivery routing, Naval Res Logistics 37 (1990), 383-402.
22. J. Dunn, Scheduling underway replenishment as a generalized orienteering problem, Master's Thesis, Naval Postgraduate School, Monterey, CA, 1992.
23. D. Feillet, P. Dejax, and M. Gendreau, Traveling salesman problems with profits, Transportation Sci 39 (2005), 188-205.
24. M. Fischetti, J.S. Gonzalez, and P. Toth, A branch-and-cut algorithm for the generalized traveling salesman problem, Oper Res 45 (1997), 378-394. (Pubitemid 127684716)
25. M. Fischetti, J.S. Gonzalez, and P. Toth, Solving the orienteering problem through branch-and-cut, INFORMS J Comput 10 (1998), 133-148.
26. Z.W. Geem, C. Tseng, and Y. Park, "Harmony Search for Generalized Orienteering Problem: Best Touring in China," Advances in Natural Computation, L. Wang, K. Chen, and Y. S. Ong (Editors), Vol.3612, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2005, pp. 741-750.
27. M. Gendreau, A. Hertz, and G. Laporte, A tabu search heuristic for the vehicle routing problem, Manage Sci 40 (1994), 1276-1290.
28. M. Gendreau, G. Laporte, and J.Y. Potvin, "Metaheuristics for the capacitated VRP," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 2002, pp. 129-154.
29. M. Gendreau, G. Laporte, and R. Seguin, An exact algorithm for the vehicle routing problem with stochastic demands and customers, Transportation Sci 29 (1995), 143-155.
30. M. Gendreau, G. Laporte, and R. Seguin, Stochastic vehicle routing, Eur J Oper Res 88 (1996), 3-12.
31. M. Gendreau, G. Laporte, and R. Seguin, A tabu search heuristic for the vehicle routing problem with stochastic demands and customers, Oper Res 44 (1996), 469-477.
32. M. Gendreau, G. Laporte, and F. Semet, A branch-and-cut algorithm for the undirected selective traveling salesman problem, Networks 32 (1998), 263-273. (Pubitemid 128365136)
33. M. Gendreau, G. Laporte, and F. Semet, A tabu search heuristic for the undirected selective traveling salesman problem, Eur J Oper Res 106 (1998), 539-545. (Pubitemid 128399667)
34. G. Glover and M. Laguna, Tabu Search, Kluwer, Boston, MA, 1997.
35. A. Goel and V. Gruhn, Large neighborhood search for rich vrp with multiple pickup and delivery locations, MEC-VNS: 18th Mini Euro Conference on VNS, Tenerife, Spain, 2005.
36. B. Golden, L. Levy, and R. Vohra, The orienteering problem, Naval Res Logistics 34 (1987), 307-318.
37. B. Golden, Q. Wang, and L. Liu, A multifaceted heuristic for the orienteering problem, Naval Res Logistics 35 (1988), 359-366.
38. E. Hadjiconstantinou and D. Roberts, "Routing under uncertainty: An application in the scheduling of field service engineers," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 2002, pp. 331-352.
39. M. Hayes and J. Norman, Dynamic programming in orienteering: Route choice and sitting of controls, J Oper Res Soc 35 (1984), 791-796.
40. T. Ilhan, S. Iravani, and M. Daskin, The orienteering problem with stochastic profits, IIE Trans 40 (2008), 406-421.
41. P. Jaillet, "Stochastic routing problem," Stochastics in combinatorial optimization, G. Andreatta, F. Mason, and P. Serafini (Editors), World Scientific, New Jersey, 1987, pp. 178-186.
42. A. Jézéquel, Probabilistic vehicle routing problems, Master's Thesis, Department of Civil Engineering, Massachusetts Institute of Technology, 1985.
43. N. Jozefowiez, F. Glover, and M. Laguna, Multi-objective meta-heuristics for the traveling salesman problem with profits, J Math Model Algorithms 7 (2008), 177-195.
44. H. Jula, M.M. Dessouky, and P. Ioannou, Truck route planning in non-stationary stochastic networks with time- windows at customer locations, IEEE Trans Intell Transportation Syst 37 (2006), 51-63.
45. E. Kao, A preference order dynamic program for a stochastic travelling salesman problem, Oper Res 26 (1978), 1033-1045.
46. L. Ke, C. Archetti, and Z. Feng, Ants can solve the team orienteering problem, Comput Ind Eng 54 (2008), 648-665.
47. G. Laporte, F. Louveaux, and H. Mercure, The vehicle routing problem with stochastic travel times, Transportation Sci 26 (1992), 161-170.
48. G. Laporte and S. Martello, The selective traveling salesman problem, Discrete Appl Math 26 (1990), 193-207.
49. R.C. Larson, "Decision models for emergency response planning," The McGraw-Hill Homeland Security Handbook, D.G. Kamien (Editor), McGraw-Hill, New York, 2005, pp. 911-930.
50. R.C. Larson, M. Metzger, and M. Cahn, Responding to emergencies: Lessons learned and the need for analysis, Interfaces 36 (2006), 486-501.
51. A. Leifer and M. Rosenwein, Strong linear programming relaxations for the orienteering problem, Eur J Oper Res 73 (1994), 517-523.
52. Y.-C. Liang and A. Smith, An ant colony approach to the orienteering problem, Technical report, Department of industrial and systems engineering, Auburn University, Auburn, AL, 2001.
53. V. Mak and T. Thomadsen, Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem, J Combin Optim 11 (2006), 421-434.
54. N. Mladenovic and P. Hansen, Variable neighborhood search, Comput Oper Res 24 (1997), 1097-1100.
55. C. Novoa, R. Berger, J. Linderoth, and R. Storer, A set-partitioning- based model for the stochastic vehicle routing problem, Lehigh University, Bethlehem, PA, 2006.
56. I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann Oper Res 41 (1993), 421-451.
57. D. Pisinger, A minimal algorithm for the multiple-choice knapsack problem, Eur J Oper Res 83 (1995), 394-410.
58. R. Ramesh, Y.-S. Yoon, and M. Karwan, An efficient four-phase heuristic for the generalized orienteering problem, Comput Oper Res 18 (1991), 151-165.
59. R. Ramesh, Y.-S. Yoon, and M. Karwan, An optimal algorithm for the orienteering tour problem, ORSA J Comput 4 (1992), 155-165.
60. N. Secomandi, A rollout policy for the vehicle routing problem with stochastic demands, Oper Res 49 (2001), 796-802.
61. Z. Shen, F. Ordóñez, and M.M. Dessouky, "The stochastic vehicle routing problem for minimum unmet demand," Optimization and Logistics Challenges in the Enterprise, W. Chaovalitwongse, K.C. Furman, and P.M. Pardalos (Editors), Vol.30, Springer Optimization and Its Applications, Springer US, 2009, pp. 349-371.
62. W. Stewart and B. Golden, Stochastic vehicle routing: A comprehensive approach, Eur J Oper Res 14 (1983), 371-385.
63. I. Sungur, F. Ordóñez, and M.M. Dessouky, A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty, IIE Trans 40 (2008), 509-523.
64. E.D. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.Y. Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Sci 31 (1997), 170-186. (Pubitemid 127597092)
65. H. Tang and E. Miller-Hooks, Algorithms for a stochastic selective travelling salesperson problem, J Oper Res Soc 56 (2005), 439-452.
66. H. Tang and E. Miller-Hooks, A tabu search heuristic for the team orienteering problem, Comput Oper Res 32 (2005), 1379-1407.
67. M.F. Tasgetiren and A.E. Smith, A genetic algorithm for the orienteering problem, Proceeding of the 2000 Congress on Evolutionary Computation, La Jolla CA, 2000, pp. 910-915.
68. P. Toth and D. Vigo (Editors), "The vehicle routing problem," SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 2002.
69. P. Toth and D. Vigo, The granular tabu search and its application to the vehicle routing problem, INFORMS J Comput 15 (2003), 333-346.
70. T. Tsiligirides, Heuristic methods applied to orienteering, J Oper Res Soc 35 (1984), 797-809.
71. P. Vansteenwegen, W. Souffriau, G.V. Berghe, and D.V. Oudheusden, A guided local search metaheuristic for the team orienteering problem, Eur J Oper Res 196 (2009), 118-127.
72. Q. Wang, X. Sun, B. Golden, and J. Jia, Using artificial neural networks to solve the orienteering problem, Ann Oper Res 61 (1995), 111-120.
73. J.A.G. Willard, Vehicle routing using r-optimal tabu search, Master's Thesis, The Management School, Imperial College, London, 1989.
74. T. Wu, Optimization models for underway replenishment of a dispersed carrier battle group, Master's Thesis, Naval Postgraduate School, Monterey, CA, 1992.
75. J. Xu and J.P. Kelly, A network flow-based tabu search heuristic for the vehicle routing problem, Transportation Sci 30 (1996), 379-393.
76. W.H. Yang, K. Mathur, and R.H. Ballou, Stochastic vehicle routing problem with restocking, Transportation Sci 34 (2000), 99-112.