The Stochastic and Dynamic Traveling Purchaser Problem

References

• Abdelaziz FB (2012) Solution approaches for the multiobjective stochastic programming. Eur. J. Oper. Res. 216:1–16.Crossref, Google Scholar
• Albareda-Sambola M, Fernández E, Laporte G (2014) The dynamic multiperiod vehicle routing problem with probabilistic information. Comput. Oper. Res. 48:31–39.Crossref, Google Scholar
• Angelelli E, Mansini R, Vindigni M (2011) Look-ahead heuristics for the dynamic traveling purchaser problem. Comput. Oper. Res. 38:1867–1876.Crossref, Google Scholar
• Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52:977–987.Link, Google Scholar
• Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44:216–304.Link, Google Scholar
• Bianchessi N, Mansini R, Speranza MG (2014) The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235:73–87.Crossref, Google Scholar
• Burstall RM (1966) A heuristic method for a job sequencing problem. Oper. Res. Quart. 17:291–304.Crossref, Google Scholar
• Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transportation Sci. 42:127–145.Link, Google Scholar
• Coelho LC, Cordeau JF, Laporte G (2014) Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52:55–67.Crossref, Google Scholar
• Das C (1975) Supply and redistribution rules for two-location inventory systems: One period analysis. Management Sci. 12:756–776.Google Scholar
• Dessouky MM, Ordonez F, Jia H, Shen Z (2006) Rapid distribution of medical supplies. Hall R, ed. Patient Flow: Reducing Delay in Healthcare Delivery (Springer, New York), 309–338.Crossref, Google Scholar
• Dror M (2002) Vehicle routing with stochastic demands: Models and computational methods. Dror M, L’Ecuyer P, Szidarouszky F, eds. Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications. Internat. Series Oper. Res. Management Sci., Vol. 46 (Kluwer, Boston), 625–649.Crossref, Google Scholar
• Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23:166–176.Link, Google Scholar
• Gendreau M, Potvin J-Y (1998) Dynamic vehicle routing and dispatching. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer Academic Publishers, Boston), 115–126.Crossref, Google Scholar
• Gendreau M, Laporte G, Seguin R (1996) Stochastic vehicle routing. Eur. J. Oper. Res. 88:3–12.Crossref, Google Scholar
• Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33:381–390.Link, Google Scholar
• Ghiani G, Guerriero E (2014) A note on the Ichoua, Gendreau and Potvin (2003) travel time model. Transportation Sci. 48:458–462.Link, Google Scholar
• Ghiani G, Manni E, Thomas BW (2012) A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem. Transportation Sci. 46:374–387.Link, Google Scholar
• Haghania A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32:2959–2986.Crossref, Google Scholar
• Hansen P, Mladenović N (2001) Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130:449–467.Crossref, Google Scholar
• Ichoua S, Gendreau M, Potvin J-Y (2003) Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144:379–396.Crossref, Google Scholar
• Laporte G, Riera-Ledesma J, Salazar-Gonzalez JJ (2003) A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper. Res. 6:940–951.Link, Google Scholar
• Larsen A, Madsen OBG, Solomon MM (2008) Recent developments in dynamic vehicle routing systems. Golden BL, Assad AA, eds. The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43 (Springer, New York), 199–218.Crossref, Google Scholar
• Mansini R, Tocchella B (2009) The traveling purchaser problem with budget constraint. Comput. Oper. Res. 36:2263–2274.Crossref, Google Scholar
• Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Ball MO, Magnanti TL, Monma CL, Nemhauser GL, eds. Network Routing, Handbooks Oper. Res. Management Sci., Vol. 8 (Elsevier, Amsterdam), 141–295.Crossref, Google Scholar
• Psaraftis HN (1995) Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. 61:143–164.Crossref, Google Scholar
• Ramesh T (1981) Traveling purchaser problem. Oper. Res. 18:78–91.Google Scholar
• Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49:796–802.Link, Google Scholar
• Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57:214–230.Link, Google Scholar
• Shen Z, Dessouky MM, Ordóñez F (2009) A two-stage vehicle routing model for large-scale bioterrorism emergencies. Networks 54:255–269.Crossref, Google Scholar
• Stewart WR, Golden BL (1983) Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 14:371–385.Crossref, Google Scholar
• Sungur I, Ren Y, Ordóñez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44:193–205.Link, Google Scholar
• Tagmouti M, Gendreau M, Potvin J-Y (2010) A dynamic capacitated arc routing problem with time-dependent service costs. Transportation Res. Part C: Emerging Tech. 19:20–28.Crossref, Google Scholar
• Wright PD, Liberatore MJ, Nydick RL (2006) A survey of operations research models and applications in homeland security. Interfaces 36:514–529.Link, Google Scholar