A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem

References

• Aantjes C. (2010) . Personal communication. September 20Google Scholar
• Bent R., Van Hentenryck P. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. (2004) 52(6):977–987Link, Google Scholar
• Benton W. C., Rossetti M. D. The vehicle scheduling problem with intermittent customer demands. Comput. Oper. Res. (1992) 19(6):521–531Crossref, Google Scholar
• Branke J., Middendorf M., Noeth G., Dessouky M. Waiting strategies for dynamic vehicle routing. Transportation Sci. (2005) 39(3):298–312Link, Google Scholar
• Dumas Y., Desrosiers J., Gelinas E., Solomon M. M. An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. (1995) 43(2):367–371Link, Google Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adpative search procedures. J. Global Optim. (1995) 6(2):109–134Crossref, Google Scholar
• Gendreau M., Guerten F., Potvin J.-Y., Taillard É. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33(4):381–390Link, Google Scholar
• Ghiani G., Manni E., Quaranta A., Triki C. Anticipatory algorithms for same-day courier dispatching. Transportation Res. Part E (2009) 45(1):96–106Crossref, Google Scholar
• Goodson J., Ohlmann J. W., Thomas B. W. A rollout policy framework for dynamic programming approximations to the vehicle routing problem with stochastic demand and duration limits. (2011) . Working paper, Tippie College of Business, University of Iowa, Iowa CityGoogle Scholar
• Haughton M. A. Quantifying the benefits of route reoptimisation under stochastic customer demand. J. Oper. Res. Soc. (2000) 51(3):320–332Google Scholar
• Haughton M. A. Route reoptimization's impact on delivery efficiency. Transportation Res.—Part E (2002) 38(1):53–63Crossref, Google Scholar
• Hvattum L. M., Løkketangen A., Laporte G. Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Sci. (2006) 40(4):421–438Link, Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34(4):426–438Link, Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. (2006) 40(2):211–225Link, Google Scholar
• Kantor M. G., Rosenwein M. B. The orienteering problem with time windows. J. Oper. Res. Soc. (1992) 43(6):629–635Crossref, Google Scholar
• Kilby P., Prosser P., Shaw P. Dynamic VRPs: A study of scenarios. (1998) . Technical report APES-06-1998, Department of Computer Science, University of Strathclyde, Glasgow, UKGoogle Scholar
• Larsen A., Madsen O. B. G., Solomon M. M. Partially dynamic vehicle routing—Models and algorithms. J. Oper. Res. Soc. (2002) 53(6):637–646Crossref, Google Scholar
• Larsen A., Madsen O. B. G., Solomon M. M. The a-priori dynamic traveling salesman problem with time windows. Transportation Sci. (2004) 38(4):459–472Link, Google Scholar
• Law A. M., Kelton W. D.Simulation Modeling and Analysis (2000) 3rd ed.(McGraw-Hill, Boston) Google Scholar
• Manni E. Topics in real-time fleet management. (2007) . Ph.D. thesis, Università della Calabria, Arcavacata di Rende, ItalyGoogle Scholar
• Manni E., Ohlmann J. W., Thomas B. W. Variable neighborhood search with scheduled penalty. (2009) . Working paper, University of IowaGoogle Scholar
• Meisel S., Suppa U., Mattfeld D., Voss S., Caserta M. GRASP based approximate dynamic programming for dynamic routing of a vehicle. Proc. MIC 2009: The VIII Metaheuristics Internat. Conf. (2011) (Springer-Verlag, Berlin) . ForthcomingGoogle Scholar
• Mitrović-Minić S., Laporte G. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38(7):635–655Crossref, Google Scholar
• Mitrović-Minić S., Krishnamurti R., Laporte G. Double-horizon based heurisitcs for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38(8):669–685Crossref, Google Scholar
• Nahmias S.Production and Operations Analysis (2001) 4th ed.(Irwin/McGraw-Hill, Boston) Google Scholar
• Ohlmann J. W., Thomas B. W. A compressed annealing approach to the traveling salesman problem with time windows. INFORMS J. Comput. (2007) 19(1):80–90Link, Google Scholar
• Powell W. B., Jaillet P., Odoni A., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Network Routing, Handbooks in Operations Research and Management Science (1995) 8(Elsevier Science, Amsterdam) 141–295Google Scholar
• Psaraftis H. N., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam) 223–248Google Scholar
• Psaraftis H. N. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61(1):143–164Crossref, Google Scholar
• Savelsbergh M. W. P., Goetschalckx M. A comparison of the efficiency of fixed versus variable vehicle routes. J. Bus. Logist. (1995) 16(1):163–187Google Scholar
• Secomandi N. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. (2000) 27(11–12):1201–1225Crossref, Google Scholar
• Secomandi N. A rollout policy for the vehicle routing policy with stochastic demands. Oper. Res. (2001) 49(5):796–802Link, Google Scholar
• Secomandi N., Margot F. Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. (2009) 57(1):214–230Link, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time windows. Oper. Res. (1987) 35(2):254–265Link, Google Scholar
• Stefik M. Planning with constraints (MOLGEN: Part 1). Artificial Intelligence (1981) 16(2):111–139Crossref, Google Scholar
• Thomas B. W. Waiting strategies for anticipating service requests from known customer locations. Transportation Sci. (2007) 41(3):319–331Link, Google Scholar
• van de Klundert J., Wormer L. ASAP: The after-salesman problem. Manufacturing Service Oper. Management (2010) 12(4):627–641Link, Google Scholar
• van Hemert J. I., La Poutré J. A., Yao X., Burke E., Lozano J. A., Smith J., Merelo-Guervós J. J., Bullinaria J. A., Rowe J., Tino P., Kabán A., Schwefel H.-P. Dynamic routing problems with fruitful regions: Models and evolutionary computation. Parallel Problem Solving from Nature VIII (2004) (Springer-Verlag, Berlin) 692–701Crossref, Google Scholar
• Waters C. D. J. Vehicle scheduling problems with uncertainty and omitted customers. J. Oper. Res. Soc. (1989) 40(2):1099–1108Google Scholar