Solving a practical pickup and delivery problem

Transportation Science

Volumn 37, Issue 3, 2003, Pages 347-364

  Xu, Hang ^a   Chen, Zhi Long ^b   Rajagopal, Srinivas ^a   Arunapuram, Sundar ^a  

^a Manugistics Group Inc   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; PROBLEM SOLVING; TRANSPORTATION ROUTES;

LINEAR RELAXATION; PICKUP AND DELIVERY PROBLEM; VEHICLE ROUTING;

LINEAR PROGRAMMING;

EID: 0042941897     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.37.3.347.16044     Document Type: Article

References (24)

1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
2. Bodin, L. D. 1990. Twenty years of routing and scheduling. Oper. Res. 38 571-579.
3. Bramel, J., D. Simchi-Levi. 1997. Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management. Springer-Verlag, New York.
4. Chen, Z.-L., W. B. Powell. 1999. Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11 78-94.
5. Crainic, T. G., G. Laporte. 1998. Fleet Management and Logistics. Kluwer Academic Publishers, Boston, MA.
6. Dantzig, G. B., P. Wolfe. 1960. Decomposition principle for linear programs. Oper. Res. 8 101-111.
7. Desaulniers, G., J. Lavigne, F. Soumis. 1998. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. 111 479-494.
8. Desrochers, M., F. Soumis. 1988. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 191-211.
9. ____, J. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 342-354.
10. Desrosiers, J., Y. Dumas, M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing, Handbooks in Operations Research and Management Science, Vol. 8. North-Holland, Amsterdam, The Netherlands, 35-139.
11. Dumas, Y., J. Desrosiers, F. Soumis. 1991. The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54 7-22.
12. Fisher, M. 1995. Vehicle routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing, Handbooks in Operations Research and Management Science, Vol. 8. North-Holland, Amsterdam, The Netherlands, 1-33.
13. ____, K. O. Jornsten, O. B. G. Madsen. 1997. Vehicle routing with time windows: Two optimization algorithms. Oper. Res. 45 488-492.
14. Gendreau, M., G. Laporte, J.-Y. Potvin. 1997. Vehicle routing: modern heuristics. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, New York, 311-336.
15. Golden, B., E. A. Wasil, J. P. Kelly, I.-M. Chao. 1998. Metaheuristics in vehicle routing. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Boston, MA, 33-56.
16. Hoffman, K. L., M. Padberg. 1993. Solving airline crew scheduling problems by branch-and-cut. Management Sci. 39 657-682.
17. Kohl, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis. 1999. 2-Path cuts for the vehicle routing problem with time windows. Trans. Sci. 33 101-116.
18. Laporte, G. 1992 The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59 345-358.
19. Mehrotra, A., M. A. Trick. 1996. A column generation approach to graph coloring. INFORMS J. Comput. 8 344-354.
20. Powell, W. B., P. Jaillet, A. Odoni. 1995. Stochastic and dynamic networks and routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing, Handbooks in Operations Research and Management Science, Vol. 8. North-Holland, Amsterdam, The Netherlands, 141-295.
21. Savelsbergh, M. W. P., M. Sol. 1995. The general pickup and delivery problem. Transportation Res. 29 17-29.
22. ____, ____. 1998. DRIVE: Dynamic routing of independent vehicles. Oper. Res. 46 474-490.
23. Vance, P. H., C. Barnhart, E. L. Johnson, G. L. Nemhauser. 1994. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Applications 3 111-130.
24. Wolsey, L. A. 1998. Integer Programming. John Wiley & Sons, Inc., New York.