Models and Algorithms for Single-Depot Vehicle Scheduling

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows, Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bertsekas D. P.Linear Network Optimization: Algorithms and Codes (1991) (MIT Press, Cambridge, MA) Google Scholar
• Bertsekas D. P. Auction algorithms for network flow problems: A tutorial introduction. Comput. Optim. Appl. (1992) 1:7–66Crossref, Google Scholar
• Bertsekas D. P., Castañon D. A. A forward/reverse auction algorithm for asymmetric assignment problems. Comput. Optim. Appl. (1992) 1:277–297Crossref, Google Scholar
• Bertsekas D. P., Eckstein J. Dual coordinate step methods for linear network flow problems. Math. Programming (1988) 42:203–243Crossref, Google Scholar
• Bokinge U., Hasselström D. Improved vehicle scheduling in public transport through systematic changes in the time-table. Euro. J. Oper. Res. (1980) 5:388–395Crossref, Google Scholar
• Branco I.Algoritmos para modelos matemáticos de quasi-afectacão e extensões (1989) (FCUL, Universidade de Lisboa, Lisbon, Portugal) . Ph.D. thesisGoogle Scholar
• Caprara A., Fischetti M., Toth P. A heuristic algorithm for the set covering problem. Oper. Res. (1999) 47:730–743Link, Google Scholar
• Daduna J. R., Pinto Paixão J. M., Daduna J. R., Branco I., Paixão J. M. Pinto. Vehicle scheduling for public mass transit—An overview. Computer-Aided Transit Scheduling: Proceedings of the Sixth International Workshop (1995) (Springer Verlag, Berlin, Germany) 76–90Crossref, Google Scholar
• Dell'Amico M. Una nuova procedura di assegnamento per il vehicle scheduling problem. Ricerca Oper. (1989) 5:13–21Google Scholar
• Dell'Amico M., Fischetti M., Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci. (1993) 39:115–125Link, 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. Network Routing (1995) 8(North-Holland, Amsterdam, The Netherlands) 35–139Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Fischetti M., Martello S. A hybrid algorithm for finding the kth smallest of n elements in O(n) time. Ann. Oper. Res. (1988) 13:401–419Crossref, Google Scholar
• Forbes M. A., Holt J. N., Watts A. M. An exact algorithm for multiple depot bus scheduling. Euro. J. Oper. Res. (1994) 72:115–124Crossref, Google Scholar
• Freling R. Models and techniques for integrating Vehicle and Crew Scheduling. (1997) (Tinbergen Institute, Erasmus University, Rotterdam, The Netherlands) . Ph.D. thesisGoogle Scholar
• Freling R., Paixão J. M. Pinto, Wagelmans A. P. M. Models and algorithms for vehicle scheduling. (1995) (Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands) . Working paper, Technical Report 9562/AGoogle Scholar
• Gerards A. M. H., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Matching. Network Models (1997) 7(North Holland, Amsterdam, The Netherlands) 135–224Handbooks in Operations Research and Management ScienceGoogle Scholar
• Gupta U. I., Lee D. T., Leung J. Y. T. An optimal solution for the channel-assignment problem. IEEE Trans. Computers (1979) C-28:807–810Crossref, Google Scholar
• Jonker R., Volgenant T. Improving the Hungarian assignment algorithm. Oper. Res. Lett. (1986) 5:171–176Crossref, Google Scholar
• Junger M., Reinelt G., Rinaldi G., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. The traveling salesman problem. Network Models (1995) 7(North Holland, Amsterdam, The Netherlands) 225–330Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Paixão J. M., Branco I. A quasi-assignment algorithm for bus scheduling. Networks (1987) 17:249–269Crossref, Google Scholar
• Paixão J. M., Branco I.. Bus scheduling with a fixed number of vehicles. Computer-Aided Transit Scheduling: Proceedings of the Fourth International Workshop (1988) (Springer Verlag, Berlin, Germany) 28–40Crossref, Google Scholar
• Ribeiro C. C., Soumis F. A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. (1994) 42:41–52Link, Google Scholar
• Schwartz B. L. A computational analysis of the auction algorithm. Euro. J. Oper. Res. (1994) 74:161–169Crossref, Google Scholar
• Scott D. Minimal fleet size in transhipment-type vehicle scheduling problems. (1986) (Université de Montréal, Montréal, Canada) . Technical Report 487Google Scholar
• Song T., Zhou L. A new algorithm for the quasi-assignment problem. Ann. Oper. Res. (1990) 24:205–223Crossref, Google Scholar
• Volgenant A. Linear and semi-assignment problems. Comput. Oper. Res. (1996) 23:917–932Crossref, Google Scholar