Dynamic Vehicle Routing Based on Online Traffic Information

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Ascheuer N., Grötschel M., Kamin N., Rambau J. Combinatorial online optimization in practice. OPFIMA (1998) 57:1–6Google Scholar
• Bierwirth C.Adaptive Search and the Management of Logistics Systems (2000) (Kluwer Academic Publishers, Boston, MA/Dordrecht, The Netherlands/London, U.K.) Crossref, Google Scholar
• Dial R., Glover F., Karney D., Klingman D. A computational analysis of alternative algorithms and labelling techniques for finding shortest path trees. Networks (1979) 9:215–248Crossref, Google Scholar
• Fleischmann B., Gietz M., Gnutzmann S. Time-varying travel times in vehicle routing. Transportation Sci. (2004) 38(2):160–173Link, Google Scholar
• Gendreau M., Potvin J.-Y., Crainic T. G. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston, MA/Dordrecht, The Netherlands/London, U.K.) 115–126Crossref, Google Scholar
• Gendreau M., Guertin F., Potvin J.-Y., Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
• Gronalt M., Hartl R. F., Reimann M. Time-constrained pickup and delivery of full truckloads. Eur. J. Oper. Res. (2003) 151(3):520–535Crossref, Google Scholar
• Günther H.-O., Krüger H., Schrecker A. Einsatzplanung fahrerloser Transportsysteme—Untersucht an einem praxisfall aus dem spezialmaschinenbau. Logistik Management (2001) 3:33–42Google Scholar
• Horn E. T. Efficient modelling of travel in networks with time-varying link speeds. Networks (2000) 36:80–90Crossref, Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. (2003) 144:379–396Crossref, Google Scholar
• Jonker R., Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing (1987) 38:325–340Crossref, Google Scholar
• Madsen O., Ravn H., Rygaard J. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives. Ann. Oper. Res. (1995) 60:193–208Crossref, Google Scholar
• Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. (1976) (Northwestern University, Evanston, IL) . Doctoral thesisGoogle Scholar
• Philipps F. Methoden der dynamischen Tourenplanung. (2000) (University of Augsburg, Germany) . Master thesisGoogle Scholar
• Powell W., Snow W., Cheung R. Adaptive labeling algorithms for the dynamic assignment problem. Transportation Sci. (2000) 34:50–66Link, Google Scholar
• Psaraftis H. N., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) (North Holland, Amsterdam, The Netherlands)223–248Google Scholar
• Psaraftis H. N. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. (1995) 61:143–164Crossref, Google Scholar
• Savelsbergh M. W. P., Sol M. DRIVE: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490Link, Google Scholar
• Solomon M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Wilson N. H. M., Colvin N. J. Computer control for the Rochester dial-a-ride system. (1977) . Technical Report TR-77-22. Cambridge, MA, Massachusetts Institute of TechnologyGoogle Scholar
• Wilson N. H. M., Weissberg H. Advanced dial-a-ride algorithms research project: Final report. (1976) . Technical Report TR-76-20. Cambridge, MA, Massachusetts Institute of TechnologyGoogle Scholar
• Wilson N. H. M., Sussmann J. M., Wong H. K., Higonnet T. Scheduling algorithms for dial-a-ride systems. (1971) (Massachusetts Institute of Technology, Cambridge, MA) . Urban Systems Laboratory Report USL TR-70-13Google Scholar
• Yang J., Jaillet P., Mahmassani H. On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Res. Record (1999) 1667:107–113Crossref, Google Scholar