Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits

References

• 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 the 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.Google Scholar
• Bertsekas D (2000) Dynamic Programming and Optimal Control, 2nd ed., Vol. I (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Chervi P, Peterson M (1995) Computational approaches to stochastic vehicle routing problems. Transportation Sci. 29(4):342–352.Link, Google Scholar
• Bertsimas D, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44(2):286–304.Link, Google Scholar
• Bertsekas D, Tsitsiklis J, Wu C (1997) Rollout algorithms for combinatorial optimization. J. Heuristics 3(3):245–262.Crossref, Google Scholar
• Bianchi L, Birattari M, Chiarandini M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T (2006) Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J. Math. Model. Algorithms 5(1):91–110.Crossref, Google Scholar
• Brown D, Smith J, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Oper. Res. 58(4):785–801.Link, Google Scholar
• 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), 123–142.Crossref, Google Scholar
• Denardo E (2003) Dynamic Programming: Models and Applications (Dover Publications, Mineola, NY).Google Scholar
• 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.Crossref, Google Scholar
• 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, 1688–1692.Google Scholar
• Goodson J, Ohlmann J, Thomas B (2012) Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. Eur. J. Oper. Res. 217(2):312–323.Crossref, Google Scholar
• Goodson J, Ohlmann JW, Thomas B (2013) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Oper. Res. 61(1):138–154.Link, Google Scholar
• Goodson J, Thomas BW, Ohlmann JW (2013) A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs. Working paper, Saint Louis University, St. Louis. Accessed June 18, 2015, http://www.slu.edu/~goodson/papers/GoodsonRolloutFramework.pdf.Google Scholar
• Hansen P, Mladenović N (2001) Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3):449–467.Crossref, Google Scholar
• Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2):509–515.Crossref, Google Scholar
• Pandelis D, Kyriakidis C, Dimitrakos T (2012) Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands. Eur. J. Oper. Res. 217(2):324–332.Crossref, Google Scholar
• Powell W (2007) Approximate Dynamic Programming (John Wiley & Sons, New York).Crossref, Google Scholar
• Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5):796–802.Link, Google Scholar
• Secomandi N (2003) Analysis of a rollout approach to sequencing problems with stochastic routing applications. J. Heuristics 9(4):321–352.Crossref, Google Scholar
• Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Tatarakis A, Minis I (2009) Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 197(2):557–571.Crossref, Google Scholar
• Tsirimpas P, Tatarakis A, Minis I, Kyriakidis E (2008) Single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 187(2):483–495.Crossref, Google Scholar
• Wilson R (2011) 22nd annual state of logistics report. Council of Supply Chain Management Professionals, Lombard, IL.Google Scholar
• Yang W, Mathur K, Ballou R (2000) Stochastic vehicle routing problem with restocking. Transportation Sci. 34(1):99–112.Link, Google Scholar