Waiting Strategies for Dynamic Vehicle Routing

References

• Beasley J. E. Or-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. (1990) 41(11). http://www.ms.ic.ac.uk/info.htmlGoogle Scholar
• Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44(2):286–304Link, Google Scholar
• Bertsimas D. J., van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39(4):601–615Link, Google Scholar
• Bertsimas D. J., van Ryzin G. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. (1993) 41(1):60–76Link, Google Scholar
• Bianchi L. Notes on dynamic vehicle routing—The state of the art. (2000) . Technical Report IDSIA-05-01, IDSIA, Manno-Lugano, Switzerland http://www.idsia.ch/~leo/papers/IDSIA-05-01.pdfGoogle Scholar
• Branke J.Evolutionary Optimization in Dynamic Environments (2001a) (Kluwer Academic, Boston, MA) Google Scholar
• Branke J., Spector L., Banzhaf W., Daida J., Eiben A. E., Honavar M. H., Jakiela M., Smith R. E. Reducing the sampling variance when searching for robust solutions. Genetic and Evolutionary Computation Conference (GECCO’01) (2001b) (e>Morgan Kaufmann, San Francisco, CA) 235–242Google Scholar
• Branke J., Mattfeld D., Deb K., Schoenauer M., Rudolph G., Yao X., Lutton E., Merelo J. J., Schwefel H.-P. Anticipation in dynamic optimization: The scheduling case. Parallel Problem Solving from Nature (PPSN VI) (2000) 1917(Springer, Berlin/Heidelberg, Germany) 253–262Google Scholar
• Davis L.Handbook of Genetic Algorithms (1991) (Van Nostrand Reinhold, New York) Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Gendreau M., Potvin J.-Y., Crainic T., Laporte G. Dynamic vehicle routing and dispatching. Fleet Management and Logistics (1998) (Kluwer, London, UK) 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(4):381–390Link, Google Scholar
• Gendreau M., Badeau P., Guertin F., Potvin J.-Y., Taillard E. D. A solution procedure for real-time routing and dispatching of commercial vehicles. (1996) . Technical Report CRT-96-24, Centre de recherche sur les transports, Université de Montréal, Montréal, QuébecGoogle Scholar
• Ichoua S., Gendreau M., Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Sci. (2000) 34(4):426–438Link, Google Scholar
• Kilby P., Prosser P., Shaw P. Dynamic VRPs: A study of scenarios. (1998) . Technical Report APES-06-1998, School of Computer Science, University of St. Andrews, St. Andrews, ScotlandGoogle Scholar
• Lichtenstein D. Planar formulae and their uses. SIAM J. Comput. (1982) 11:329–342Crossref, Google Scholar
• Michalewicz Z.Genetic Algorithms + Data Structures = Evolution Programs (1996) 3rd ed.(Springer Verlag, Berlin/Heidelberg, Germany) Crossref, Google Scholar
• Mitrovic-Minic S., Laporte G. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. B (2004) 38:635–655Crossref, Google Scholar
• Mitrovic-Minic S., Krishnamurti R., Laporte G. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. B (2004) 38:669–685Crossref, Google Scholar
• Papastavrou J. D. A stochastic and dynamic routing policy using branching processes with state dependent immigration. Eur. J. Oper. Res. (1996) 95:167–177Crossref, Google Scholar
• Powell W. B. A stochastic model of the dynamic vehicle allocation problem. Transportation Sci. (1986) 20(2):117–129Link, Google Scholar
• Powell W. B. A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Sci. (1996) 30(3):195–219Link, Google Scholar
• Powell W. B., Towns M. T., Marar A. On the value of optimal myopic solutions for dynamic routing and sceduling problems in the presence of user noncompliance. (1998) . Technical Report SOR-97-15, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJGoogle Scholar
• Psaraftis H. N., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing: Methods and Studies (1988) 16(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
• Regan A. C., Mahmassani H. S., Jaillet P. Dynamic decision making for commercial vehicle operations using real-time information. Transportation Res. Record (1995a) 1537:91–97Crossref, Google Scholar
• Regan A. C., Mahmassani H. S., Jaillet P. Evaluation of dynamic fleet management systems: A simulation framework. Transportation Res. Record (1995b) 1645:176–184Crossref, Google Scholar
• Regan A. C., Mahmassani H. S., Jaillet P. Improving efficiency of commercial vehicle operations using real-time information: Potential uses and assignment strategies. Transportation Res. Record (1995c) 1493:188–198Google 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 C. C. Anticipatory route selection. Transportation Sci. (2004) 38(4):473–487Link, Google Scholar
• Yang J., Jaillet P., Mahmassani H. S. On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Res. Record (1999) 1667:107–113Crossref, Google Scholar