Dynamic vehicle routing: Status and prospects

A. Aslidis, Minimization of overstowage in containership operations,Operational Research '90, vol. 18 (1991) pp. 457–471.

P.K. Bagchi and B.N. Nag, Dynamic vehicle scheduling: An expert systems approach, International Journal of Physical Distribution and Logistics 21(1991)10–18.

W. Bell, L.M. Dalberto, M.L. Fisher, A.J. Greenfield, R. Jaikumar, P. Kedia, R.G. Macj and P.J. Prutzman, Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer, Interfaces 13(1983)4–23.

D.J. Bertsimas and D. Simchi-Levi, The new generation of vehicle routing research: Robust algorithms, addressing uncertainty, Working paper, MIT (1993).

D.J. Bertsimas and G. van Ryzin, A stochastic and dynamic vehicle routing problem in the Euclidean plane, Operations Research 39(1991)601–615.

D.J. Bertsimas and G. van Ryzin, Stochastic and dynamic vehicle routing with general demand and interarrival time distributions, Working paper, MIT (1992).

D.J. Bertsimas and G. van Ryzin, Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles, Operations Research 41(1993)60–76.

D. Bollo, P. Hanappe and M. Stumm, Le développement des pratiques EDI dans les transports, Recherche Transports Securité 38/39(1993)128–136.

D.E. Boyce, B. Ran and L.J. LeBlanc, Solving the dynamic user-optimal traffic assignment problem over congested transportation networks,TRISTAN Conference, Montreal, Quebec, Canada (1991).

G.G. Brown, C.J. Ellis, G.W. Graves and D. Ronen, Real-time, wide area dispatching of mobil tank trucks, Interfaces 17(1987)107–120.

K. Chen and R.D. Ervin, Intelligent vehicle-highway systems: US activities and policy issues, Technological Forecasting and Social Change 38(1990)363–374.

T.G. Crainic, P. Dejax and M. Gendreau, Modeling the container fleet management problem using a stochastic programming approach,Operational Research '90, vol 18 (1991) pp. 473–486.

The impact of EDI on transport, COST 320 Final Report, Commission of the European Communities, Directorate General for Transport (DGVII) (1992).

M.S. Daskin and W.J. Hopp, Dynamic facility location modeling using forecast horizon concepts: Issues, algorithms, and results,TRISTAN Conference, Montreal, Quebec, Canada (1991).

C.C. Deng, H.L. Ong, B.W. Ang and T.N. Goh, A modeling study of a taxi service operation, International Journal of Operations and Production Management 12(1992)65–78.

M. Dror, M. Ball and B. Golden, A computational comparison of algorithms for the inventory routing problem, Annals of Operations Research 4(1985)3–23.

M. Dror, G. Laporte and P. Trudeau, Vehicle routing with stochastic demands: Properties and solution frameworks, Transportation Science 23(1989)166–176.

M. Dror, G. Laporte and F.V. Louveaux, Vehicle routing with stochastic demands and restricted failures, ZOR — Methods and Models of Operations Research 37(1993)273–283.

M. Dror and W.B. Powell (eds.), Operations Research 41, special issue on Stochastic and Dynamic Models in Transportation (1993).

G. Fagan, Introduction to geographical information systems,Tutorial, TIMS/ORSA Meeting, Chicago, IL (1993).

M.L. Fisher, J. Huang and B-X. Tang, Scheduling bulk pickup-delivery vehicles in Shanghai, Interfaces 16(1986)18–23.

L.F. Frantzeskakis and W.B. Powell, A successive approximation procedure for stochastic, dynamic vehicle allocation problems, Transportation Science 24(1990)40–57.

T.L. Friesz, J. Luque, R.L. Tobin and B. Wie, Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Research 37(1989)893–901.

M. Garmilla, Computer-aided routing of combination carriers, M.Sc. Thesis, Department of Ocean Engineering, MIT (1988).

M. Gendreau, G. Laporte and R. Seguin, The vehicle routing problem with stochastic customers and demands, Publication CRT-873, Centre de Recherche sur les Transports, Université de Montréal, Canada (1992).

ISL, Report on the SCUSY system (Simulation of container handling units), Institute of Shipping Economics and Logistics, Bremen, Germany (1992).

P. Jaillet, The probabilistic traveling salesman problem, Ph.D. Thesis, Department of Civil Engineering, MIT (1985).

P. Jaillet, Probabilistic routing problems in the plane,Operational Research '90, vol. 29, No. 10 (1991) pp. 675–688.

R. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane, Mathematics of Operations Research 2(1977)209–224.

R.M. Karp, On-line algorithms versus off-line algorithms: How much is it worth to know the future?,Tutorial, ORSA/TIMS Meeting, Anaheim, CA (1991).

L. Kleinrock, and H. Levy, The analysis of random polling systems, Operations Research 36(1988)716–732.

G. Laporte and F. Louveaux, Exact solution of some transportation problems under uncertainty,TRISTAN Conference, Montreal, Quebec, Canada (1991).

G. Laporte and P.J. Dejax, Dynamic location-routing problems, Journal of the Operational Research Society 40(1989)471–482.

G. Laporte, F. Louveaux and H. Mercure, The vehicle routing problem with stochastic travel times, Transportation Science 26(1992)161–170.

J. Lysgaard, Dynamic transportation networks in vehicle routing and scheduling, Interfaces 22(1992)44–55.

V.A. Mabert, A.V. Hill and D.W. Montgomery, A decision support system for the courier vehicle scheduling problem, Omega 16(1988)333–345.

C. Malandraki, Time-dependent vehicle routing problems: Formulations, solution algorithms and computational experience, Ph.D. Thesis, Department of Civil Engineering, Northwestern University (1990).

C. Malandraki and M.S. Daskin, Time-dependent vehicle routing problems: Formulations, properties, and heuristic algorithms, Transportation Science 26(1992)185–200.

N. Megiddo, Dynamic location problems, Annals of Operations Research 6(1986)313–319.

H. Min, The multiple vehicle routing problem with simultaneous delivery and pickup points, Transportation Research 23A(1989)377–386.

H. Min, International intermodal choices via chance-constrained programming, Transportation Research 25A(1991)351–362.

C.H. Papadimitriou and M. Yannakakis, Shortest paths without a map (extended abstract),Proc. ICALP (1989) pp. 611–620.

G.H. Polychronopoulos, Stochastic and dynamic shortest distance problems, Ph.D. Thesis, Operations Research Center, MIT (1992).

W.B. Powell, A stochastic model of the dynamic vehicle allocation problem, Transportation Science 20(1986)117–129.

H.N. Psaraftis, A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science 14(1980)130–154.

H.N. Psaraftis, On the practical importance of asymptotic optimality in certain heuristic algorithms, Networks 4(1984)587–596.

H.N. Psaraftis, J.B. Orlin, D. Bienstock and P.M. Thompson, Analysis and solution algorithms of sealift routing and scheduling problems: Final report, Working Paper No. 1700-85, Sloan School of Management, MIT (1985).

H.N. Psaraftis, Dynamic Vehicle Routing Problems, in:Vehicle Routing: Methods and Studies, eds. B. Golden and A. Assad (North-Holland, 1988).

H.N. Psaraftis and J.N. Tsitsiklis, Dynamic shortest paths in acyclic networks with Markovian arc costs, Operations Research 41(1993)91–101.

D. Ronen, Short term scheduling of vessels for shipping bulk or semi-bulk commodities originating in a single area, Operations Research 34(1986)164–173.

I. Sabuncuoglu and D. Hommertzheim, Dynamic dispatching algorithm for scheduling machines and sutomated guided vehicles in a flexible manufacturing system, International Journal of Production Research 30(1992)1059–1079.

F. Soumis and A.R. Odoni, Dynamic ground-holding strategies for air traffic control,TRISTAN Conference, Montreal, Quebec, Canada (1991).

V. Speidel, EDP-assisted fleet scheduling in tramp and coastal shipping, in:Ship Operation Automation, eds. Pitkin, Roche and Williams (North-Holland, 1976).

Systemes Telematiques d' Interet General, Annual Technical Report on RTD: Transport Telematics, Commission of the European Communities, Directorate General for Information Technologies and Industries, and Telecommunications (DGXIII) (1993).

H. Takagi, Analysis of polling systems with a mixture of exhaustive and gated service disciplines, Journal of the Operations Research Society of Japan 32(1989)450–461.

P.M. Thompson and H.N. Psaraftis, Cyclic transfer algorithms for multivehicle routing and scheduling problems, Operations Research 41(1993)935–946.

P. Trudeau and M. Dror, Stochastic inventory routing: Route design with stockouts and route failures, Transportation Science 26(1992)171–184.

N.H.M. Wilson, J.M. Sussman, H.K. Hwang and B.T. Higonett, Scheduling algorithms for diala-ride systems, Urban Systems Laboratory Report USL TR-70-13, MIT (1971).