Vehicle Routing and Scheduling with Full Truckloads

References

• Agarwal Y., Mathur K., Salkin H. M. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks (1989) 19:731–749Crossref, Google Scholar
• Ball M. O., Golden B. L., Assad A., Bodin L. D. Planning for truck fleet size in the presence of a common-carrier option. Decision Sci (1983) 14:103–120Crossref, Google Scholar
• Bertossi A. A., Carraresi P., Gallo G. On some matching problems arising in vehicle scheduling models. Networks (1987) 17:271–281Crossref, Google Scholar
• Bianco L. A., Mingozzi A., Ricciardelli S., Daduna J. R., Branco J., PaixaÕ J. An exact algorithm for combining vehicle trips. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems (1995) 430(Springer-Verlag, Berlin, Germany) 145–172Google Scholar
• Carpaneto G., Toth P. Some new branching and bounding Criteria for the asymmetric traveling salesman problem. Management Sci (1980) 26:736–743Link, Google Scholar
• Dell'Amico M., Fischetti M., Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci (1993) 29:115–125Link, Google 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–494Crossref, Google Scholar
• Desrochers M., Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR (1988) 26:191–212Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354Link, Google Scholar
• Desrosiers J., Soumis F., Desrochers M. Routing with time windows by column generation. Networks (1984) 14:545–565Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Handbook in Operations Research and Management Science 8: Network Routing (1995) (North-Holland, Amsterdam, The Netherlands) 35–139Google Scholar
• Desrosiers J., Laporte G., Sauvé M., Soumis F., Taillefer S. Vehicle routing with full loads. Comput. Oper. Res. (1988) 15:219–226Crossref, Google Scholar
• Fisher M. L., Ball M., Magnanti T., Monma C., Nemhauser G. Vehicle routing. Handbook in Operations Research and Management Science: Network Routing (1995) (North-Holland, Amsterdam, The Netherlands) 1–33Google Scholar
• Lamatsch A., Desrochers M., Rousseau J. M. An approach to vehicle scheduling with depot capacity constraints. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems (1992) 386(Springer-Verlag, Berlin, Germany) 181–195Crossref, Google Scholar
• Löbel A. Vehicle scheduling in public transit and Lagrangean pricing. Management Sci (1998) 44:1637–1649Link, Google Scholar
• Mesquita M., Paixão J., Desrochers M., Rousseau J. M. Multiple depot vehicle scheduling problem: A new heuristic based on quasi-assignment algorithms. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems (1992) 386(Springer-Verlag, Berlin, Germany) 167–180Crossref, Google Scholar
• Mesquita M., Paixão J., Wilson N. H. M. Exact algorithms for the multi-depot vehicle scheduling problem based on multicommodity network flow type formulations. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems (1999) 471(Springer-Verlag, Berlin, Germany) 221–243Crossref, Google Scholar
• Ribeiro C. C., Soumis F. A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. (1994) 42(1):41–52Link, Google Scholar
• Skitt R. A., Levary R. R. Vehicle routing via column generation. Eur. J. Oper. Res. (1985) 21:65–76Crossref, Google Scholar