Solving a Practical Pickup and Delivery Problem
Published Online:1 Aug 2003https://doi.org/10.1287/trsc.37.3.347.16044
References
- Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329Link, Google Scholar
- Twenty years of routing and scheduling. Oper. Res. (1990) 38:571–579Link, Google Scholar
- Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management (1997) (Springer-Verlag, New York) Crossref, Google Scholar
- Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. (1999) 11:78–94Link, Google Scholar
- Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
- Decomposition principle for linear programs. Oper. Res. (1960) 8:101–111Link, Google Scholar
- Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. (1998) 111:479–494Crossref, Google Scholar
- A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR (1988) 26:191–211Google Scholar
- A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354Link, Google Scholar
- , Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing, Hand-books in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam, The Netherlands)35–139Google Scholar
- The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22Crossref, Google Scholar
- , Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Vehicle routing. Network Routing, Handbooks in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam, The Netherlands)1–33Google Scholar
- Vehicle routing with time windows: Two optimization algorithms. Oper. Res. (1997) 45:488–492Link, Google Scholar
- , Aarts E., Lenstra J. K. Vehicle routing: modern heuristics. Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, New York) 311–336Google Scholar
- , Crainic T. G., Laporte G. Metaheuristics in vehicle routing. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston, MA) 33–56Crossref, Google Scholar
- Solving airline crew scheduling problems by branch-and-cut. Management Sci. (1993) 39:657–682Link, Google Scholar
- 2-Path cuts for the vehicle routing problem with time windows. Trans. Sci. (1999) 33:101–116Link, Google Scholar
- The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. (1992) 59:345–358Crossref, Google Scholar
- A column generation approach to graph coloring. INFORMS J. Comput. (1996) 8:344–354Link, Google Scholar
- , Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Network Routing, Handbooks in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam, The Netherlands)141–295Google Scholar
- The general pickup and delivery problem. Transportation Res. (1995) 29:17–29Abstract, Google Scholar
- DRIVE: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490Link, Google Scholar
- Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Applications (1994) 3:111–130Crossref, Google Scholar
- Integer Programming (1998) (John Wiley & Sons, Inc., New York) Google Scholar

