Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits

Operations Research

Volumn 61, Issue 1, 2013, Pages 138-154

  Goodson, Justin C ^a   Ohlmann, Jeffrey W ^b   Thomas, Barrett W ^b  

^a SAINT LOUIS UNIVERSITY   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Approximate dynamic programming; Fixed routes; Rollout policy; Stochastic vehicle routing

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; COMPUTATIONAL EXPERIMENT; DYNAMIC DECOMPOSITION; FIXED ROUTES; HIGH-QUALITY SOLUTIONS; ROLLING HORIZON PROCEDURES; STOCHASTIC VEHICLE ROUTING; VEHICLE ROUTING PROBLEMS;

OPERATIONS RESEARCH;

COMPUTER APPLICATIONS;

EID: 84876151194     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1127     Document Type: Article

References (37)

1. Ak A, Erera A (2007) A paired-vehicle routing recourse strategy for the vehicle routing problem with stochastic demands. Transportation Sci. 41(2):222-237.
2. American Trucking Association (2009) Allowance allocation policies in climate legislation: Assisting consumers, investing in a clean energy future, and adapting to climate change. Statement made before House Committee on Energy and Commerce Subcommittee on Energy and Environment. Accessed August 15, 2011, http://www.truckline.com/AdvIssues/Energy/Cap%20and%20Trade%20Documents/ Testimony%20on%20Allowance%20Allocation%20Policies%20in%20Climate%20Legislation. pdf.
3. Bertsekas D (2000) Dynamic Programming and Optimal Control, Vol. I, 2nd ed. (Athena Scientific, Belmont, MA).
4. Bertsekas D, Tsitsiklis J, Wu C (1997) Rollout algorithms for combinatorial optimization. J. Heuristics 3(3):245-262.
5. Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Management Sci. 48(4):550-565.
6. Bertsimas D, Popescu I (2003) Revenue management in a dynamic network environment. Transportation Sci. 37(3):257-277.
7. Bertsimas D, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44(2):286-304.
8. Bertsimas D, Chervi P, Peterson M (1995) Computational approaches to stochastic vehicle routing problems. Transportation Sci. 29(4): 342-352.
9. Birattari M, Balaprakash P, Stützle T, Dorigo M (2008) Estimation-based local search for stochastic combinatorial optimization using delta evaluations: A case study on the probabilistic traveling salesman problem. INFORMS J. Comput. 20(4):644-658.
10. Brown D, Smith J, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Oper. Res. 58(4):785-801.
11. Campbell A, Thomas B (2008) Challenges and advances in a priori routing. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 124-142.
12. Campbell A, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transportation Sci. 42(2):127-145.
13. Dror M (1993) Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution. Eur. J. Oper. Res. 64:432-441.
14. Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23(3):166-176.
15. Erera A, Daganzo C (2003) A dynamic scheme for stochastic vehicle routing. Working paper, Georgia Institute of Technology, Atlanta, GA. Accessed April 25, 2009, http://www2.isye.gatech.edu/people/faculty/Alan-Erera/pubs/ ereradaganzo2003.pdf.
16. Erera A, Savelsbergh M, Uyar E (2009) Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4):270-283.
17. Fan J, Wang X, Ning H (2006) A multiple vehicles routing problem algorithm with stochastic demand. Proc. 6th World Congress on Intelligent Control and Automation, Vol. 1 (IEEE, New York), 1688-1692.
18. Goodson J (2010) Solution methodologies for vehicle routing problems with stochastic demand. Ph.D. thesis, University of Iowa, Iowa City.
19. Goodson J, Ohlmann J, Thomas B (2012a) Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. Eur. J. Oper. Res. 217(2):312-323.
20. Goodson J, Thomas B, Ohlmann J (2012b) A generalized rollout policy framework for stochastic dynamic programming. Working paper, Saint Louis University, St. Louis. Accessed April 30, 2012, http://www.slu.edu/~goodson/ papers/GoodsonRolloutFramework.pdf.
21. Guerriero F, Mancini M (2003) A cooperative parallel rollout algorithm for the sequential ordering problem. Parallel Comput. 29(5):663-677.
22. Hvattum L, Løkketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. 40(4):421-438.
23. Hvattum L, Løkketangen A, Laporte G (2007) A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49(4):330-340.
24. Kindervater G, Savelsbergh M (2003) Vehicle routing: Handling edge exchanges. Aarts E, Lenstra J, eds. Local Search in Combinatorial Optimization (Princeton University Press, Princeton, NJ), 337-360.
25. Laporte G, Louveaux F, Van Hamme L (2002) An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3):415-423.
26. Novoa C, Storer R (2008) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2):509-515.
27. Novoa C, Berger R, Linderoth J, Storer R (2006) A set-partitioning-based model for the stochastic vehicle routing problem. Technical Report 06T-008, Lehigh University, Bethlehem, PA.
28. Powell W (2007) Approximate Dynamic Programming (John Wiley & Sons, New York).
29. Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27(11-12):1201-1225.
30. Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5):796-802.
31. Secomandi N (2003) Analysis of a rollout approach to sequencing problems with stochastic routing applications. J. Heuristics 9(4): 321-352.
32. Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1): 214-230.
33. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254-265.
34. Toth P, Vigo D (2001) The Vehicle Routing Problem (SIAM, Philadelphia).
35. van de Klundert J, Wormer L (2010) ASAP: The after-salesman problem. Manufacturing Service Oper. Management 12(4):627-641.
36. Wilson R (2011) 22nd annual state of logistics report. Council of Supply Chain Management Professionals, Lombard, IL.
37. Yang W, Mathur K, Ballou R (2000) Stochastic vehicle routing problem with restocking. Transportation Sci. 34(1):99-112.