Vehicle Routing Papers

List of publications from CRT-Montreal

Bertsimas, D. and D. Simchi-Levi (1994), The New Generation of Vehicle Routing Research: Robust Algorithms Addressing Uncertainty. Operations Research, 44 , pp. 286-304.
Download postscript version of paper
Download dvi version of paper

Bienstock, D., J. Bramel and D. Simchi-Levi (1993), A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Mathematics of Operations Research, 18, pp. 786 -802.

Braca, J., J. Bramel, B. Posner and D, Simchi-Levi (1994), A Computerized Approach to the New York City School Bus Routing Problem . To Appear in IIE Transactions.
Download postscript version of paper
Download dvi version of paper

Bramel, J., E. G. Coffman, Jr., P. W. Shor and D. Simchi-Levi (1992), Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Operations Research, 40, pp. 1095 -1106.

Bramel, J., C. L. Li and D. Simchi-Levi (1993), Probabilistic Analysis of Heuristics for the Vehicle Routing with Time Windows. American Journal of Mathematical and Management Sciences, 13, pp. 267-322.

Bramel, J. and D. Simchi-Levi (1992), Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research, 44 , pp. 501 -509.
Download postscript version of paper
Download dvi version of paper

Bramel, J. and D, Simchi-Levi (1994), On the Effectiveness of Set Partitioning Formulations for the Vehicle Routing Problem. To appear in Operations Research.
Download postscript version of paper
Download dvi version of paper

M. Desrochers, J.K. Lenstra, M.W.P. Savelsbergh (1990). A classification scheme for vehicle routing and scheduling problems. European J. Oper. Res. 46, 322-332.

Tim Duncan (1995) Experiments in the use of Neighbourhood Search Techniques for Vehicle Routing. BCS Expert Systems'95.
[AIAI-TR-176]

Federgruen, A. and D. Simchi-Levi (1995), Analytical Analysis of Vehicle Routing and Inventory Routing problems. Handbooks in Operations Research and Management Science, the volume on Network Routing. M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., North-Holland, Amsterdam, pp. 297-373

G.A.P. Kindervater, M.W.P. Savelsbergh (1997).
Vehicle Routing: Handling Edge Exchanges.
E.H.L. Aarts, J.K. Lenstra (eds.).
Local Search in Combinatorial Optimization, Wiley, Chichester, 337-360.

An Optimization Algorithm for the Vehicle Routing Problem with Time Windows based on Lagrangean Relaxation
N. Kohl and O. Madsen (1995)

M.W.P. Savelsbergh (1984). Vehicle routing and computer graphics. Note OS-N8402, Centre for Mathematics and Computer Science.

M.W.P. Savelsbergh (1990). A parallel insertion heuristic for vehicle routing with side constraints. Statistica Neerlandica 44, 139-147.

M.W.P. Savelsbergh, M. Goetschalckx (1995).
A comparison of the efficiency of fixed versus variable vehicle routes.
Journal of Business Logistics 16, 163-188.

M.W.P. Savelsbergh and M. Sol (1997).
DRIVE: Dynamic Routing of Independent VEhicles.
Operations Research, to appear.

Simchi-Levi, D. and J. Bramel, Probabilistic Analysis of Heuristics for the Capacitated Vehicle Routing with Unsplit Demands. Working paper, Columbia University.

Simchi-Levi, D. and J. Bramel, On the Optimal Solution Value of the Capacitated Vehicle Routing Problem with Unsplit Demands. Working paper, Columbia University.

Jiefeng Xu (1996)
A New Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
Transportation Sciences.

View Data of a sample truck routing problem as well as
View Routes generated by an optimizer.

School Bus Routing Study

PHOENIX: A Graphical User Interface System for School Bus Routing

Vehicle Routing Papers

ZAIK-Publications for the Vehicle Routing Problem

Vehicle Routing Bibliographies

Papers from other authors