Solving a Practical Pickup and Delivery Problem

References

  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329LinkGoogle Scholar
  • Bodin L. D. Twenty years of routing and scheduling. Oper. Res. (1990) 38:571–579LinkGoogle Scholar
  • Bramel J., Simchi-Levi D.Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management (1997) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Chen Z.-L., Powell W. B. Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. (1999) 11:78–94LinkGoogle Scholar
  • Crainic T. G., Laporte G.Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston, MA) CrossrefGoogle Scholar
  • Dantzig G. B., Wolfe P. Decomposition principle for linear programs. Oper. Res. (1960) 8:101–111LinkGoogle Scholar
  • Desaulniers G., Lavigne J., Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. (1998) 111:479–494CrossrefGoogle Scholar
  • Desrochers M., Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR (1988) 26:191–211Google Scholar
  • Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354LinkGoogle Scholar
  • Desrosiers J., Dumas Y., Solomon M., Soumis F., 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
  • Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22CrossrefGoogle Scholar
  • Fisher M., 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
  • Fisher M., Jornsten K. O., Madsen O. B. G. Vehicle routing with time windows: Two optimization algorithms. Oper. Res. (1997) 45:488–492LinkGoogle Scholar
  • Gendreau M., Laporte G., Potvin J.-Y., Aarts E., Lenstra J. K. Vehicle routing: modern heuristics. Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, New York) 311–336Google Scholar
  • Golden B., Wasil E. A., Kelly J. P., Chao I.-M., Crainic T. G., Laporte G. Metaheuristics in vehicle routing. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston, MA) 33–56CrossrefGoogle Scholar
  • Hoffman K. L., Padberg M. Solving airline crew scheduling problems by branch-and-cut. Management Sci. (1993) 39:657–682LinkGoogle Scholar
  • Kohl N., Desrosiers J., Madsen O. B. G., Solomon M. M., Soumis F. 2-Path cuts for the vehicle routing problem with time windows. Trans. Sci. (1999) 33:101–116LinkGoogle Scholar
  • Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. (1992) 59:345–358CrossrefGoogle Scholar
  • Mehrotra A., Trick M. A. A column generation approach to graph coloring. INFORMS J. Comput. (1996) 8:344–354LinkGoogle Scholar
  • Powell W. B., Jaillet P., Odoni A., 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
  • Savelsbergh M. W. P., Sol M. The general pickup and delivery problem. Transportation Res. (1995) 29:17–29AbstractGoogle Scholar
  • Savelsbergh M. W. P., Sol M. DRIVE: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490LinkGoogle Scholar
  • Vance P. H., Barnhart C., Johnson E. L., Nemhauser G. L. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Applications (1994) 3:111–130CrossrefGoogle Scholar
  • Wolsey L. A.Integer Programming (1998) (John Wiley & Sons, Inc., New York) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.