Probabilistic analyses and practical algorithms for the Vehicle Routing Problem with Time Windows

Operations Research

Volumn 44, Issue 3, 1996, Pages 501-509

  Bramel, Julien ^a   Simchi Levi, David ^a,b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; QUEUEING THEORY; RANDOM PROCESSES; SCHEDULING; STATISTICAL METHODS; TRANSPORTATION ROUTES;

VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

OPERATIONS RESEARCH;

EID: 0030135117     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.3.501     Document Type: Article

References (20)

1. 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. Math. Opns. Res. 18, 786-802.
2. BRAMEL, J., E. G. COFFMAN, JR., P. SHOR, AND D. SIMCHI-LEVI. 1991. Probabilistic Analysis of Algorithms for the Capacitated Vehicle Routing Problem with Unsplit Demands. Opns. Res. 40, 1095-1106.
3. BRAMEL, J., C-L. LI AND D. SIMCHI-LEVI. 1991. Probabilistic Analysis of the Vehicle Routing Problem with Time Windows. Working Paper, Dept. of IE&OR, Columbia University.
4. BRAMEL, J. AND D. SIMCHI-LEVI. 1991. A Location Based Heuristic for General Routing Problems. Working Paper, Dept. of IE&OR, Columbia University.
5. CHRISTOFIDES, N. AND S. EILON. 1969. An Algorithm for the Vehicle Dispatching Problem. Opns. Res. Quarterly. 20, 309-318.
6. CHRISTOFIDES, N., A. MINGOZZI AND P. TOTH. 1981a. State-Space Relaxation Procedures for the Computations of Bounds to Routing Problems. Networks. 11, 145-164.
7. CHRISTOFIDES, N., A. MINGOZZI, AND P. TOTH. 1981b. Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxations. Math. Programming. 20, 255-282.
8. DAGANZO, C. F. 1987a. Modeling Distribution Problems with Time Windows: Part I. Transp. Sci. 21, 171-179.
9. DAGANZO, C. F. 1987b. Modeling Distribution Problems with Time Windows: Part II: Two Customer Types. Transp. Sci. 21, 180-187.
10. DESROCHERS, M., J. DESROSIERS, AND M. SOLOMON. 1992. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Opns. Res. 40, 342-354.
11. FEDERGRUEN, A., AND G. VAN RYZIN. 1992. Probabilistic Analysis of a Generalized Bin Packing Problem with Applications to Vehicle Routing and Scheduling Problems. Working Paper, Graduate School of Business, Columbia University.
12. HELD, M., P. WOLFE, AND H. P. CROWDER. 1974. Validation of Subgradient Optimization. Math. Programming. 6, 62-88.
13. KINGMAN, J. F. C. 1976. Subadditive Processes. Lecture Notes in Math. 539, Springer-Verlag, Berlin, 168-222.
14. LAWLER, E. L., J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS. 1989. Sequencing and Scheduling: Algorithms and Complexity. Report BS-R89xx, Center for Mathematics and Computer Science, Amsterdam, The Netherlands.
15. PIRKUL, H. 1987. Efficient Algorithms for the Capacitated Concentrator Location Problem. Computers in Opns. Res. 14, 197-208.
16. RHEE, W. T. 1991. An Asymptotic Analysis of Capacitated Vehicle Routing. Working Paper, The Ohio State University, Columbus, OH.
17. ROSENKRANTZ, D. J., R. E. STEARNS, AND P. M. LEWIS II. 1977. An Analysis of Several Heuristics for the Traveling Salesman Problem. SLAM J. on Computing 6, 563-581.
18. SIMCHI-LEVI, D., AND J. BRAMEL. 1990. On the Optimal Solution Value of the Capacitated Vehicle Routing Problem with Unsplit Demands. Working Paper, Department of IE&OR, Columbia University, New York.
19. SOLOMON, M. M. 1986. On the Worst-Case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Networks. 16, 161-174.
20. SOLOMON, M. M. AND J. DESROSIERS. 1988. Time Window Constrained Routing and Scheduling Problems: A Survey. Transp. Sci. 22, 1-13.