Time-Varying Travel Times in Vehicle Routing

References

• Ahn B.-H., Shin J.-Y. Vehicle-routing with time windows and time-varying congestion. J. Oper. Res. Soc. (1991) 42:393–400Crossref, Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Beasley J. E. Adapting the savings algorithm for varying inter-customer travel times. Omega (1981) 9:658–659Crossref, Google Scholar
• Fleischmann B., Isermann H. Tourenplanung. Logistik (1998) 2nd ed(Verlag Moderne Industrie, Landsberg/Lech) 287–302Google Scholar
• Gendreau M., Potvin J.-Y. Dynamic vehicle routing and dispatching. (1997) (University of Montreal, Montreal, Quebec, Canada) . Working Paper, CRT Montreal 97-38Google Scholar
• Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. (1992) 40:1086–1094Link, Google Scholar
• Gietz M.Computergestützte Tourenplanung mit zeitkritischen Restriktionen (1994) (Physica-Verlag, Heidelberg) Crossref, Google Scholar
• Hill A. V., Benton W. C. Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. J. Oper. Res. Soc. (1992) 43:343–351Crossref, Google Scholar
• Hill A. V., Mabert V. A., Montgomery D. W. A decision support system for the courier vehicle scheduling problem. Omega (1988) 16:333–345Crossref, Google Scholar
• Horn H. E. T. Efficient modeling of travel in networks with time-varying speeds. Networks (2000) 36:80–90Crossref, Google Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Vehicle dispatching with time-dependent travel times. (2000) (University of Montreal, Montreal, Quebec, Canada) . Working Paper CRT-2000-18Google Scholar
• Kerner B. S., Rehborn H. Experimental features and characteristics of traffic jams. Phys. Rev. (1995) E53:R1297–R1300Google Scholar
• LISB (Leit- und Informationssystem Berlin)Final Report (1991) ( Berlin, Germany)Google Scholar
• Malandraki C., Daskin M. S. Time-dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Sci. (1992) 26:185–200Link, Google Scholar
• Paessens H. The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. (1988) 34:336–344Crossref, Google Scholar
• Savelsbergh M. W. P. An efficient implementation of local search algorithms for constrained routing problems. Eur. J. Oper. Res. (1990) 47:S.75–85Crossref, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Taillard E. D., Laporte G., Gendreau M. Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. (1996) 47:1065–1070Crossref, Google Scholar
• TRANSLISBSummary Report: Transport Guidance and Information System for Freight Transport in the City of Berlin (1997) . European Community, Project TR 1022/91 DE, Berlin, München, GermanyGoogle Scholar
• van Landeghem H. R. G. A bi-criteria heuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. (1988) 36:217–226Crossref, Google Scholar