Waiting Strategies for Anticipating Service Requests from Known Customer Locations

References

• ATA Economics & Statistical Analysis Department Standard trucking and transportation statistics. (1999) . Technical report, American Trucking Association, Alexandria, VAGoogle Scholar
• Bent R. W., Van Hentenryck P. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. (2004) 52:977–987Link, Google Scholar
• Bertsimas D. J., van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39:601–615Link, Google Scholar
• Bertsimas D. J., van Ryzin G. Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles. Oper. Res. (1993) 41:60–76Link, Google Scholar
• Boyan J., Mitzenmacher M. Improved results for route planning in stochastic transportation networks. Proc. 12th Annual Sympos. Discrete Algorithms (2001) Society for Industrial and Applied Mathematics, Philadelphia, PA:895–902Google Scholar
• Branke J., Middendorf M., Noeth G., Dessouky M. Waiting strategies for dynamic vehicle routing. Transportation Sci. (2005) 39:298–312Link, Google Scholar
• Bregman J., Ghiani G., Manni E., Quaranta A., Musmanno R. Real-time fleet management in the courier industry. Odysseus 2006, 3rd Internat. Workshop Freight Transportation Logistics (2006) Altea, SpainGoogle Scholar
• Campbell A. Aggregation for the probabilistic traveling salesman problem. Comput. Oper. Res. (2006) 33:2703–2724Crossref, 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:367–371Link, Google Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adpative search procedures. J. Global Optim. (1995) 6:109–134Crossref, Google Scholar
• Gendreau M., Laporte G., Semet F. A dynamic model and parallel tabu heuristic for real-time ambulance relocation. Parallel Comput. (2001) 27:1641–1653Crossref, Google Scholar
• Gendreau M., Guerten F., Potvin J.-Y., Taillard É. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
• Ghiani G., Guerriero F., Laporte G., Musmanno R. Real-time vehicle routing: Solution concepts, algorithms and parallel strategies. Eur. J. Oper. Res. (2003) 151:1–11Crossref, Google Scholar
• Hvattum L. M., Løkketangen A., Laporte G. Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. (2006) . Presented May 25Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34: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
• Kilby P., Prosser P., Shaw P. Dynamic VRPs: A study of scenarios. (1998) . Technical Report APES-06-1998, Department of Computer Science, Strathclyde University, Glasgow. http://users.rsise.anu.edu.au/∼pjk/papers/Kilb98Dynamic.psGoogle Scholar
• Kim S., Lewis M. E., White III C. C. Optimal vehicle routing with real-time traffic information. IEEE Trans. Intelligent Transportation Systems (2005a) 6:178–188Crossref, Google Scholar
• Kim S., Lewis M. E., White III C. C. State space reduction for non-stationary stochastic shortest path problems with real-time traffic congestion information. IEEE Trans. Intelligent Transportation Systems (2005b) 6:273–284Crossref, Google Scholar
• Larsen A., Madsen O. B. G., Solomon M. Partially dynamic vehicle routing—Models and algorithms. J. Oper. Res. Soc. (2002) 53:637–646Crossref, Google Scholar
• Larsen A., Madsen O. B. G., Solomon M. The a-priori dynamic traveling salesman problem with time windows. Transportation Sci. (2004) 38:459–472Link, Google Scholar
• Law A. M., Kelton W. D.Simulation Modeling and Analysis (2000) 3rd ed(McGraw-Hill, Boston, MA) Google Scholar
• Mes M., van der Heijden M., Schuur P. Opportunity costs calculation in agent-based vehicle routing and scheduling. (2006) . Working paperGoogle Scholar
• Mitrovic-Minic S., Laporte G. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B (2004) 38:635–655Crossref, Google Scholar
• Mitrovic-Minic 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:669–685Crossref, Google Scholar
• Nahmias S.Production and Operations Analysis (2001) 4th ed(Irwin/McGraw-Hill, Boston, MA.) Google Scholar
• Papastavrou J. D. A stochastic and dynamic routing policy using branching processes with state dependent migration. Eur. J. Oper. Res. (1996) 95:167–177Crossref, Google Scholar
• Powell W. B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. (1996) 30:195–219Link, 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, Vol. 8. Handbooks in Operations Research and Management Science (1995) (North-Holland, Amsterdam) 141–295Google Scholar
• Powell W. B., Sheffi Y., Nickerson K. S., Butterbaugh K., Atherton S. Maximizing profits for North American Van Lines’ truckload division: A new framework for pricing and operations. Interfaces (1988) 18:21–41Abstract, Google 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:143–164Crossref, Google Scholar
• Psaraftis H. N., Tsitsiklis J. N. Dynamic shortest paths in acyclic networks with Markovian arc costs. Oper. Res. (1993) 41:91–101Link, Google Scholar
• Puterman M. L.Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley and Sons, Inc., New York) Crossref, Google Scholar
• Ross J. W., Beath C. M. Beyond the business case: New approaches to IT investment. MIT Sloan Management Rev. (2002) Winter):51–59Google Scholar
• Siek J., Lee L.-Q., Lumsdaine A. The boost graph library. (2001) . http://www.boost.org/libs/graph/doc/Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time windows. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Swihart M. R., Papastavrou J. D. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. (1999) 114:447–464Crossref, Google Scholar
• Thomas B. W., White III C. C. Anticipatory route selection. Transportation Sci. (2004) 38:473–487Link, Google Scholar
• Thomas B. W., White C. C. Dynamic and stochastic shortest path problem with anticipation. Eur. J. Oper. Res. (2007) 176:836–854Crossref, Google Scholar
• Tioga Group, The Truck transportation. Project 99-130: Goods Movement Truck and Rail Study (2003) . Report for the Southern California Association of Governments. http://www.scag.ca.gov/goodsmove/truckrail.htmGoogle Scholar
• USDOT, FHA (U.S. Department of Transportation Federal Highway Administration) Freight carriers: From model fragmentation to integrated logistics. (2001) . http://www.ops.fhwa.dot.gov/freight/themepapers/finalthm5v4.htmGoogle Scholar
• U.S. Department of Transportation Federal Motor Carrier Safety Administration The revised hours-of-service regulations. (2005) . http://www.fmcsa.dot.gov/rules-regulations/truck/driver/hos/revised-hos.aspGoogle Scholar
• van Hemert J. I., La Poutré J. A., Yao X., Burke E., Lozano J. A., Smith J., Merelo-Gueruós J. J., Bollinaria J. A., Rowe J., Tiňo P., Kabán A., Schwefel H.-P. Dynamic routing with fruitful regions: Models and evolutionary computation. Parallel Problem Solving from Nature VIII (2004) (Springer, Berlin, Germany) 690–699Lecture Notes in Computer ScienceGoogle Scholar