The Shortest Path Problem with Time Windows and Linear Waiting Costs

References

• Bianco L., Mingozzi A., Ricciardelli S., Daduna J. R., Branco I., Paixão J. An Exact Algorithm for Combining Vehicle Trips. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems (1995) 430(Springer-Verlag, Berlin) 145–172Google Scholar
• Cai X., Kloks T., Wong C. K. Time-Varying Shortest Path Problems with Constraints. Networks (1997) 29:141–149Crossref, Google Scholar
• Carpaneto G., Dell'amico M., Fischetti M., Toth P. A Branch and Bound Algorithm for the Multiple Vehicle Scheduling Problem. Networks (1989) 19:531–548Crossref, Google Scholar
• Dantzig G. B., Wolfe P. Decomposition Principle for Linear Programs. Opns. Res. (1960) 8:101–111Link, Google Scholar
• De Palma A., Hansen P. Optimum Departure Times for Commuters in Congested Networks. Ann. Opns. Res. (1990) 25:279–290Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Ioachim I., Solomon M. M., Soumis F., Villeneuve D., Crainic T. G., Laporte G. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. Fleet Management and Logistics (1998) (Kluwer, Boston) 57–93Crossref, 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:57–72Crossref, Google Scholar
• Desaulniers G., Villeneuve D. The Shortest Path Problem with Time Windows and Linear Waiting Costs. (1997) . Technical report, Les Cahiers du GERAD, G-97-21, École des Hautes Études Commerciales, MontréalGoogle Scholar
• Desrochers M. La Fabrication d'Horaires de Travail pour les Conducteurs d'Autobus par une Méthode de Génération de Colonnes. (1986) . Ph.D. dissertation, Université de Montréal, MontréalGoogle Scholar
• Desrochers M., Soumis F. A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows. INFOR (1988) 26:191–212Google Scholar
• Desrosiers J., Pelletier P., Soumis F. Plus Court Chemin avec Contraintes d'Horaires. RAIRO (1983) 17:357–377Crossref, Google Scholar
• Dror M. Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW. Opns. Res. (1994) 42:977–978Link, Google Scholar
• Ioachim I., Gélinas S., Desrosiers J., Soumis F. A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs. Networks (1998) 31:193–204Crossref, Google Scholar
• Ziliaskopoulos A. K., Mahmassani H. S. Time Dependent, Shortest-Path Algorithm for Real-Time Intelligent Vehicle Highway System Applications. Transp. Res. Rec. (1993) 1408:94–100Google Scholar