Time Constrained Routing and Scheduling

Handbooks in Operations Research and Management Science

Volumn 8, Issue C, 1995, Pages 35-139

  Desrosiers, Jacques ^a   Dumas, Yvan ^a   Solomon, Marius M ^b   Soumis, François ^c  

^a HEC MONTRÉAL   (Canada)

^b NORTHEASTERN UNIVERSITY   (United States)

^c ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957089136     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)80106-9     Document Type: Review

References (213)

1. Afrati, F., Cosmadakis, S., Papadimitriou, C., Papageorgiou, G., Papakostantinou, N., The complexity of the traveling repairman problem. Theor. Inf. Appl. 20 (1986), 79–87.
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network flows. Nemhauser, G.L., Rinnooy Kan, A.H.G., Todol, M.J., (eds.) Handbooks in Operations Research and Management Science, Vol. 1: Optimization, 1989, North-Holland, Amsterdam, 211–369.
3. Anbil, R., Gelman, E., Patty, B., Tanga, R., Recent advances in crew pairing optimization at American airlines. Interfaces 21 (1991), 62–74.
4. Aneja, Y.P., Aggarwal, V., Nair, K.P.K., Shortest chain subject to side constraints. Networks 13 (1983), 295–302.
5. Appelgren, L.H., A column generation algorithm for a ship scheduling problem. Transp. Sci. 3 (1969), 53–68.
6. Appelgren, L.H., Integer programming methods for a vessel scheduling problem. Transp. Sci. 5 (1971), 64–78.
7. Arabeyre, J.P., Fearnley, J., Steiger, C., Teather, W., The airline crew scheduling problem: a survey. Transp. Sci. 3 (1969), 140–163.
8. Baker, E., An exact algorithm for the time constrained traveling salesman problem. Oper. Res. 31 (1983), 938–945.
9. Baker, E., Schaffer, J., Computational experience with branch exchange heuristics for vehicle routing problems with time window constraints. Am. J. Math. Manage. Sci. 6 (1986), 261–300.
10. Baker, E.K., Bodin, L.D., Fisher, M., The development of a heuristic set covering based system for air crew scheduling. Transp. Policy Decision Making 3 (1985), 95–110.
11. Barnhart, C., Johnson, E., Anbil, R., Hatay, L., A column generation technique for the long-Haul crew assignment problem. Industrial and Systems Engineering Reports Series, COC-91-01, 1991, Georgia Institute of Technology, Amsterdam.
12. Barnhart, C., Hatay, L., Johnson, E.L., Deadhead selection for the long-Haul crew pairing problem. Working Paper COC 92-01, 1992, School of Industrial and Systems Engineering, Georgia Tech., Atlanta, Ga. 34 pp
13. Barutt, J., Hull, T., Airline crew scheduling: supercomputers and algorithms. SIAM News, 23(6), 1990, 1.
14. Barutt, J., Hull, T., Airline crew scheduling: supercomputers and algorithms. SIAM News 23:6 (1990), 20–22.
15. Bell, W., Dalberto, L., Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Mack, R., Prutzman, P., Improving the distribution of industrial gases with an online computerized routing and scheduling optimizer. Interfaces 13 (1983), 4–23.
16. Bellman, R.E., On a routing problem. Q. Appl. Math. 16 (1958), 87–90.
17. Bertossi, A.A., Carraresi, P., Gallo, G., On some matching problems arising in vehicle scheduling models. Networks 17 (1987), 271–281.
18. Bianco, L., Mingozzi, A., Ricciardelli, S., Spadoni, M., Algorithms for the crew scheduling problem based on the set partitioning formulation., 1989, Istituto di Analisi dei Sistemi ed Informatica del CNR, Atlanta, Ga.
19. Blais, J.-Y., Lamont, J., Rousseau, J.-M., The HASTUS vehicle and manpower scheduling system at the Société de Transport de la Communauté Urbaine de Montréal. Interfaces 20 (1990), 26–42.
20. Bodin, L., Berman, L., Routing and scheduling of school buses by computer. Transp. Sci. 13 (1979), 113–129.
21. Bodin, L., Golden, B., Classification in vehicle routing and scheduling. Networks 11 (1981), 97–108.
22. Bodin, L., Sexton, T., The multi-vehicle subscriber dial-a-ride problem. TIMS Studies Manage. Sci. 26 (1986), 73–86.
23. Bodin, L., Rosenfield, D., Kydes, A., UCOST: A Micro approach to a transit planning problem. J. Urban Anal. 5 (1978), 46–69.
24. Bodin, L., Golden, B., Assad, A., Ball, M., Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10 (1983), 62–212.
25. Bökinge, U., Hasselström, D., Improved vehicle scheduling in public transport through systematic changes in time-table. Eur. J. Oper. Res. 5 (1980), 388–395.
26. Bramel, J., Simshi-Levi, D., On the effectiveness of set partitioning formulations for the vehicle routing problem. Working Paper, 1993, Graduate School of Business, Columbia University, R. 280, Roma.
27. Carpaneto, D., Dell'amico, M., Fischetti, M., Toth, P., A branch and bound algorithm for the multiple vehicle scheduling problem. Networks 19 (1989), 531–548.
28. Carpaneto, G., Toth, P., Some new branching and bounding criteria for the asymmetric travelling salesman problem. Manage. Sci. 26 (1980), 736–743.
29. Carraresi, P., Gallo, G., Network models for vehicle and crew scheduling. Eur. J. Oper. Res. 16 (1984), 139–151.
30. Casco, D., Golden, B., Wasil, E., Vehicle routing with backhauls: models, algorithms and case studies. Golden, B.L., Assad, A.A., (eds.) Vehicle Routing: Methods and Studies, 1988, North-Holland, Amsterdam, 127–147.
31. Ceder, A., Stern, H.I., Deficit function bus scheduling with deadheading trip insertions for fleet size reduction. Transp. Sci. 15 (1981), 338–363.
32. Chalifour, A., Solomon, M.M., Boisvert, J., Desrosiers, J., An application of vehicle-routing methodology to large-scale larvicide control programs. Interfaces 22 (1992), 88–99.
33. Christiansen, M., Ship routing and scheduling (preliminary version). Ph.D. Dissertation, 1993, Department of Economics, The Norwegian Institute of Technology, Amsterdam.
34. Christofides, N., Mingozzi, A., Toth, P., Exact algorithms for the vehicle routing problem based on the spanning tree and shortest path relaxations. Math. Program. 20 (1981), 255–282.
35. Christofides, N., Mingozzi, A., Toth, P., State-space relaxation procedures for the computation of bounds to routing problems. Networks 11 (1981), 145–164.
36. Chvátal, V., Linear Programming. 1983, Freeman, Trondheim. 478 pp
37. Cook, T., Russell, R., A simulation and statistical analysis of stochastic vehicle routing with timing constraints. Decision Sci. 9 (1978), 673–687.
38. CPLEX Reference Manual, 1992, Using the CPLEX Callable Library and CPLEX Mixed Integer Library, CPLEX Optimization, Inc., New York, N.Y.
39. Crainic, T.G., Rousseau, J.-M., The column generation principle and the airline crew scheduling problem. INFOR 25:2 (1987), 136–151.
40. Cyrus, J.P., The vehicle scheduling problem: models, complexity and algorithms. Ph.D. Dissertation, 1988, Technical University of Nova Scotia, Incline Village, Nev.
41. Daduna, J.R., Wren, A., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economic and Mathematical Systems 308, 1988, Springer Verlag, Halifax, N.S.
42. Dantzig, G., Fulkerson, D., Minimizing the number of tankers to meet a fixed schedule. Nav. Res. Logistics Q. 1 (1954), 217–222.
43. Dantzig, G.B., Wolfe, P., The decomposition algorithm for linear programming. Oper. Res. 8 (1960), 101–111.
44. Dantzig, G., Fulkerson, D., Johnson, S., Solution of large-scale traveling salesman problem. Oper. Res. 2 (1954), 393–410.
45. Deif, I., Bodin, L., Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. Kidder, A.E., (eds.) Conference on Computer Software Uses in Transportation and Logistics Management, Babson Park, Mass., 1984, 75–96.
46. (to appear)Dell'Amico, M., Fischetti, M., Toth, P., Heuristic algorithms for the multiple depot vehicle scheduling problem. 1990.
47. Denardo, E.V., Fox, B.L., Shortest-route methods: 1. Reaching, pruning and buckets. Oper. Res. 27 (1979), 161–186.
48. Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M.M., Soumis, F., A Unified Framework for Deterministic Time Constrained vehicle routing and crew scheduling problems. Cahiers du GERAD G-94-46, 1994, École des Hautes Études Commerciales, Berlin, Heidelberg.
49. Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F., Daily aircraft routing and scheduling. Cahiers du GERAD G-94-21, 1994, École des Hautes Études Commerciales, Montréal.
50. (in French)Desrochers, M., La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes. Ph.D. Dissertation, 1986, University of Montreal, Montréal.
51. Desrochers, M., Laporte, G., Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10 (1991), 27–36.
52. Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P., Soumis, F., Vehicle routing with time windows: optimization and approximation. Golden, B., Assad, A.A., (eds.) Vehicle Routing: Methods and Studies, 1988, North-Holland, Montreal, 65–84.
53. Desrochers, M., Rousseau, J.-M., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, 1992, Springer Verlag, Amsterdam.
54. Desrochers, M., Soumis, F., A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 (1988), 191–212.
55. Desrochers, M., Soumis, F., A reoptimization algorithm for the shortest path problem with time windows. Eur. J. Oper. Res. 35 (1988), 242–254.
56. Desrochers, M., Soumis, F., A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23 (1989), 1–13.
57. Desrochers, M., Desrosiers, J., Solomon, M.M., A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 (1992), 342–354.
58. Desrochers, M., Gilbert, J., Sauvé, M., Soumis, F., CREW-OPT: Subproblem modeling in a column generation approach to urban crew scheduling. Desrochers, M., Rousseau, J.-M., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, 1992, Springer Verlag, Berlin Heidelberg, 395–406.
59. Narvik, Norway, June 21–28 Desrosiers, J., Gélinas, É., NorFA Research Course. 1993.
60. (in French)Desrosiers, J., Soumis, F., Desrochers, M., Routes sur un réseau espace-temps. C.R. Congr. ASAC, Rech. Opér. 3 (1982), 28–44.
61. (in French)Desrosiers, J., Pelletier, P., Soumis, F., Plus court chemin avec contraintes d'horaires. RAIRO 17 (1983), 357–377.
62. Desrosiers, J., Soumis, F., Desrochers, M., Routing with time windows by column generation. Networks 14 (1984), 545–565.
63. Desrosiers, J., Dumas, Y., Soumis, F., A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Am. J. Math. Manage. Sci. 6 (1986), 301–325.
64. Desrosiers, J., Ferland, J.-A., Rousseau, J.-M., Lapalme, G., Chapleau, L., TRANSCOL: A multi-period school bus routing and scheduling system. TIMS Studies Manage. Sci. 22 (1986), 47–71.
65. Desrosiers, J., Soumis, F., Desrochers, M., Sauvé, M., Methods for routing with time windows. Eur. J. Oper. Res. 23 (1986), 235–245.
66. Desrosiers, J., Sauvé, M., Soumis, F., Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows. Manage. Sci. 34 (1988), 1005–1022.
67. Desrosiers, J., Dumas, Y., Desrochers, M., Soumis, F., Sansó, B., Trudeau, P., A break-through in airline crew scheduling. Proc. 26th Annu. Meet. of the Canadian Transportation Research Forum, Quebec City, 1991, 464–478.
68. Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S., Villeneuve, D., An algorithm for mini-clustering in handicapped transport. Cahiers du GERAD G-91-02, 1991, École des Hautes Études Commerciales, Berlin Heidelberg.
69. Dijkstra, E., A note on two problems in connection with graphs. Numer. Math. 1 (1959), 269–271.
70. Dilworth, R., A decomposition theorem for partially ordered sets. Ann. Math. 51 (1950), 161–166.
71. Dror, M., Note on the complexity of the shortest path models for column generation in the VRPTW. Oper. Res. 42 (1994), 977–978.
72. Dumas, Y., Desrosiers, J., Soumis, F., Large scale multi-vehicle dial-a-ride problems. Cahiers du GERAD G-89-30, 1989, École des Hautes Études Commerciales, Montréal.
73. (in French)Dumas, Y., Desrosiers, J., Soumis, F., Minimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables. RAIRO 23 (1989), 305–317.
74. Dumas, Y., Soumis, F., Desrosiers, J., Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transp. Sci. 24 (1990), 145–152.
75. Dumas, Y., Desrosiers, J., Soumis, F., The pick-up and delivery problem with time windows. Eur. J. Oper. Res. 54 (1991), 7–22.
76. Dumas, Y., Salomon, M., Solomon, M.M., Van Wassenhove, L.N., Discrete lotsizing and scheduling with sequence dependent setup times and setup costs. Working Paper, 1993, INSEAD, Montréal.
77. (to appear)Dumas, Y., Desrosiers, J., Gélinas, E., Solomon, M.M., An optimal algorithm for the traveling salesman problem with time windows. Oper. Res., 1995.
78. El-Azm, A., The minimum fleet size problem and its applications to bus scheduling. Rousseau, J.-M., (eds.) Computer Scheduling of Public Transport 2, 1985, North-Holland, Fontainebleau, 493–512.
79. Etschmaier, M.M., Mathaisel, D.F.X., Airline scheduling: an overview. Transp. Sci. 19 (1985), 127–138.
80. Falkner, J.C., Ryan, D.M., EXPRESS: Set partitioning for bus crew scheduling in Christchurch. Desrochers, M., Rousseau, J.-M., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, 1992, Springer Verlag, Amsterdam, 359–378.
81. Ferland, J.A., Fortin, L., Vehicle routing with sliding time-windows. Eur. J. Oper. Res. 38 (1989), 213–226.
82. Finke, G., Claus, A., Gunn, E., A two-commodity network flow approach to the traveling salesman problem. Congr. Numer. 41 (1984), 167–178.
83. Fischetti, M., Toth, P., An additive bounding procedure for combinatorial optimization problems. Oper. Res. 37 (1989), 319–328.
84. Fischetti, M., Martello, S., Toth, P., The fixed job schedule problem with spread-time constraints. Oper. Res. 35 (1987), 849–858.
85. Fischetti, M., Martello, S., Toth, P., The fixed job schedule problem with working-time constraints. Oper. Res. 37 (1989), 395–403.
86. Fisher, M., Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 37 (1994), 319–328.
87. Fisher, M., Jaikumar, R., A generalized assignment heuristic for vehicle routing. Networks 11 (1981), 109–124.
88. Fisher, M., Kedia, P., Optimal solution of set covering/partitioning problems using dual heuristics. Manage. Sci. 36 (1990), 674–688.
89. Fisher, M.L., Rosenwein, M.B., An interactive optimization system for bulk-cargo ship scheduling. Nav. Res. Logistics 36 (1989), 27–42.
90. WP 82-10-11 Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Real-time scheduling of bulk delivery fleet: practical application of Lagrangian relaxation. 1982, Department of Decision Sciences, University of Pennsylvania, Berlin, Heidelberg.
91. Fisher, M., Jörnsten, K.O., Madsen, O.B.G., Vehicle routing with time windows. Research Report 4C/1991, 1992, IMSOR, The Technical University of Denmark, Philadelphia, Pa.
92. Forbes, M.A., Holt, J.N., Watts, A.M., Exact solution of locomotive scheduling problems. J. Oper. Res. Soc. 42 (1991), 825–831.
93. Ford, L.R., Network Flow Theory. Report P-923, 1956, The Rand Corporation, Lyngby.
94. Ford, L., Fulkerson, D.R., Flows in Networks. 1962, Princeton University Press, Santa Monica, Calif.
95. (in Danish)Friis, J., Rutel˦gning med tidsvinduer: metoder og algoritmer. Research Report 11/85 Master Thesis, 1985, IMSOR, The Technical University of Denmark, Princeton, N.J.
96. Fulkerson, D.R., Flow networks and combinatorial operations research. Geoffrion, A.M., (eds.) Perspective on Optimisation, 1972, Addison-Wesley, Lyngby, 139–171.
97. Garey, M.R., Johnson, D.S., Computer and Intractability: a Guide to the Theory of NP-completeness. 1979, Freeman, Reading, Mass.
98. Gélinas, S. (1993). Private communication.
99. Gélinas, S., Desrochers, M., Desrosiers, J., Solomon, M.M., A new branching strategy for time constrained routing problems with application to backhauling. Cahiers du GERAD G-92-13, 1992, École des Hautes Études Commerciales, San Francisco, Calif. [Revised April, 1994]
100. (forthcoming)Gendreau, M., Laporte, G., Solomon, M.M., Single- vehicle routing and scheduling to minimize the number of missed deadlines. 1992.
101. Geoffrion, A.M., Lagrangian relaxation and its uses in linear programming. Math. Program. Study 2 (1974), 82–114.
102. Gershkoff, I., Optimizing flight crew schedules. Interfaces 19 (1989), 29–43.
103. Gertsbakh, I., Stern, H., Minimal resources for fixed and variable job schedules. Oper. Res. 26 (1978), 68–85.
104. Girard, P., Conversion de données et comparaison des résultats de TRANSCOL et GENCOL. 1990, Département de Génie Électrique et Informatique, Ecole Polytechnique de Montréal, Montréal.
105. Goetschalckx, M., Jacobs-Blecha, C., The vehicle routing problem with backhauls. Eur. J. Oper. Res. 42 (1989), 39–51.
106. Internal Memo Golden, B., Assad, A., The simple backhaul problem. 1984, Distribution Systems Technologies Inc., Columbia, Md.
107. Graham, D., Nuttle, H., A comparison of heuristics for a school bus scheduling problem. Transp. Res. 20B (1986), 175–182.
108. Graves, G.W., McBride, R.D., Gershkoff, I., Andersion, D., Mahidhara, D., Flight crew scheduling. Manage. Sci. 39 (1993), 736–745.
109. Guignard, M., Kim, S., Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Program. 39 (1987), 215–228.
110. Guinet, A., Le système T.I.R.: un système d'établissement de tournées industrielles routières. Ph.D. dissertation, 1984, Université Claude Bernard, Columbia, Md.
111. Halse, K., Modeling and solving complex vehicle routing problems. Ph.D. Dissertation no. 60, 1992, IMSOR, Technical University of Denmark, Lyon. 372 pp
112. Hamer, N., Seguin, L., The HASTUS system: new algorithms and modules for the 90s. Desrochers, M., Rousseau, J.-M., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, 1992, Springer Verlag, Lyngby, 17–29.
113. Hansen, P., Bicriterion path problem. Fandel, G., Gal, T., (eds.) Lecture Notes in Economics and Mathematical Systems 177, 1980, Springer-Verlag, Berlin, Heidelberg, 109–127.
114. Hansen, P., Jaumard, B., Poggi de Aragāo, M., Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes. C.R. Acad. Sci. Paris 313 (1991), 557–560.
115. Haouari, M., Dejax, P., Desrochers, M., Modelling and solving complex vehicle routing problems using column generation. Working Paper, 1991, LEIS, École Centrale, Heidelberg.
116. (in French)Heurgon, E., Un problème de recouvrement: l'habillage des horaires d'une ligne d'autobus. RAIRO 6 (1972), 13–29.
117. Heurgon, E., Preparing duty rosters for bus routes by computer. Bodin, L., Bergmann, D., (eds.) Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services, Chicago, Ill., 1975.
118. Hoffman, K.L., Padberg, M., Solving airline crew scheduling problems by branch-and-cut. Manage. Sci. 39 (1993), 657–682.
119. Houck, D.J. Jr., Picard, J.-C., Queyranne, M., Vemuganti, R.R., The travelling salesman problem as a constrained shortest path problem: theory and computational experience. Opsearch 17 (1980), 93–109.
120. 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. Cahiers du GERAD G-94-24, 1994, École des Hautes Études Commerciales, Paris.
121. Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M.M., Villeneuve, D., A request clustering algorithm for door-to-door handicapped transportation. Transp. Sci. 29 (1995), 63–78.
122. Jaffe, J.M., Algorithms for finding paths with multiple constraints. Networks 14 (1984), 95–116.
123. Jaw, J., Odoni, A., Psaraftis, H., Wilson, N., A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transp. Res. 20B (1986), 243–257.
124. Joksch, H.C., The shortest route problem with constraints. J. Math. Anal. Appl. 14 (1966), 191–197.
125. Jörnsten, K., Madsen, O.B.G., Sørensen, B., Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting. Research Report 5/86, 1986, IMSOR, The Technical University of Denmark, Montréal.
126. Kim, T., Solution algorithms for sealift routing and scheduling problems. Ph.D. Dissertation, 1985, M.I.T., Lyngby.
127. Knight, K., Hofer, J., Vehicle scheduling with timed and connected calls: a case study. Oper. Res. Q. 19 (1968), 299–310.
128. Kohl, N., Madsen, O.B.G., An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation. Research Report 17/1993, 1993, IMSOR, The Technical University of Denmark, Boston, Mass.
129. Kolen, A.W.J., Rinnooy Kan, A.H.G., Trienekens, H.W.J.M., Vehicle routing with time windows. Oper. Res. 35 (1987), 266–273.
130. revised October 1993 Kontoravdis, G., Bard, J.F., A GRASP for the vehicle routing problem with time windows. Working Paper, 1992, Department of Mechanical Engineering, The University of Texas, Lyngby.
131. Koskosidis, Y.A., Powell, W.B., Solomon, M.M., An optimization based heuristic for vehicle routing and scheduling with soft time window constraints. Transp. Sci. 26 (1992), 69–85.
132. Lamatsch, A., An approach to vehicle scheduling with depot capacity constraints. Desrochers, M., Rousseau, J.-M., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, 1992, Springer Verlag, Austin, Texas, 181–195.
133. Langevin, A., Desrochers, M., Desrosiers, J., Soumis, F., A two-commodity flow formulation for the traveling salesman and makespan problems with time windows. Networks 23 (1993), 631–640.
134. Laporte, G., The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59 (1992), 345–358.
135. Laporte, G., Nobert, Y., Exact algorithms for the vehicle routing problem. Ann. Discr. Math. 31 (1987), 147–184.
136. Lasdon, L.S., Optimization Theory for Large Systems. 1970, MacMillan, Berlin, Heidelberg.
137. Lavoie, S., Minoux, M., Odier, E., A new approach of crew pairing problems by column generation and application to air transport. Eur. J. Oper. Res. 35 (1988), 45–58.
138. Lemaréchal, C., Non differentiable optimization. Nemhauser, G.L., Rinnooy Kan, A.H.G., Todol, M.J., (eds.) Handbooks in Operations Research and Management Science, Vol. 1: Optimization, 1989, North-Holland, New York, N.Y., 529–572.
139. Lenstra, J.K., Rinnooy Kan, A.H.G., Complexity of vehicle routing and scheduling problems. Networks 11 (1981), 221–228.
140. Levin, A., Scheduling and fleet routing models for transportation systems. Transp. Sci. 5 (1971), 232–255.
141. Lin, S., Computer solutions of the traveling salesman problem. Bell System Tech. J. 44 (1965), 2245–2269.
142. Lin, S., Kernighan, B., An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 (1973), 498–516.
143. Lucena, A., Exact solution approaches for the vehicle routing problem. Ph.D. Thesis, 1986, Department of Management Science, Imperial College of Science and Technology, University of London, Amsterdam.
144. Maculan, N., Michelon, P., Plateau, G., Column- generation in linear programming with bounding variable constraints and its application in integer programming. Working Paper ES-268/92, 1992, Federal University of Rio de Janeiro, P.O. Box 68511, 21945 Rio de Janeiro. 13 pp
145. Madsen, O.B.G., Optimal scheduling of trucks — a routing problem with tight due times for delivery. Strobel, H., Genser, R., Etschmaier, M., (eds.) Optimization Applied to Transportation Systems, 1976, International Institute for Applied System Analysis, CP-77-7, P.O. Box 68511, 21945 Rio de Janeiro, 126–136.
146. Madsen, O., Ravn, H., Rygaard, J.R., REBUS, a system for dynamic vehicle routing for the Copenhagen Fire Fighting Company. Research Report 2/1993, 1993, IMSOR, the Technical University of Denmark, Laxenburgh.
147. Magnanti, T.L., Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks 11 (1981), 179–214.
148. Magnanti, T.L., Shapiro, J.F., Wagner, M.H., Generalized linear programming solves the dual. Manage. Sci. 22 (1976), 1195–1203.
149. Malandraki, C., Daskin, M., A cutting plane heuristic algorithm for the time dependent traveling salesman problem. Working Paper, 1989, Department of Civil Engineering, Northwestern University, Lyngby.
150. Manington, P., Wren, A., Experiences with bus scheduling algorithm which saves vehicles. Bodin, L., Bergmann, D., (eds.) Preprints, Workshop on Automated Techniques for Scheduling of Vehicle Operations for Urban Public Transportation Services, Chicago, Ill., 1975.
151. Marsten, R.E., Shepardson, F., Exact solution of crew scheduling problems using the set partitioning model: recent successful applications. Networks 11 (1981), 165–177.
152. Marsten, R.E., Muller, M.R., Killion, C.L., Crew planning at flying tiger: a successful application of integer programming. Manage. Sci. 25 (1979), 1175–1183.
153. Martin, G., Aircraft scheduling considered as an N- task, M-parallel machine problem with start-times and deadlines. INFOR 19 (1981), 152–161.
154. Martins, E.Q.V., On a multicriteria shortest path problem. Eur. J. Oper. Res. 16 (1984), 236–245.
155. Mesquita, M., Paixão, J., Multiple depot vehicle scheduling problem: a new heuristic based on quasi-assignment algorithms. Desrochers, M., Rousseau, J.-M., (eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, 1992, Springer Verlag, Evanston, Ill., 181–195.
156. Miller, C., Tucker, A., Zemlin, R., Integer programming formulations and traveling salesman problems. J.A.C.M. 7 (1960), 326–329.
157. (in French)Minoux, M., Plus court chemin avec contraintes: algorithmes et applications. Ann. Télécom. 30 (1975), 1–12.
158. Mitra, G., Darby-Dowman, K., CRU-SCHED: A computer based bus crew scheduling system using integer programming. Rousseau, J.-M., (eds.) Computer Scheduling of Public Transport 2, 1983, North-Holland, Berlin, Heidelberg, 223–232.
159. Moore, E.F., The shortest path trough a maze. Proc. Int. Symp. on the Theory of Switching, Part II, April 2–5, 1957, 1959, Harvard University Press, Amsterdam.
160. Nemhauser, G.L., Wolsey, L.A., Integer and Combinatorial Optimisation. 1988, John Wiley & Sons, Cambridge, Mass.
161. Or, I., Travelling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. Dissertation, 1976, Department of Industrial Engineering and Management Sciences Northwestern University, New York, N.Y.
162. Orloff, C., Route constrained fleet scheduling. Transp. Sci. 10 (1976), 149–168.
163. Paixão, J., Branco, I.M., A quasi-assignment algorithm for bus Scheduling. Networks 17 (1987), 249–270.
164. Pallottino, S., Shortest path methods: complexity, interrelations and new propositions. Networks 14 (1984), 257–267.
165. Papadimitriou, C., The Euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4 (1977), 237–244.
166. Pape, U., Algorithm 562: shortest path lengths. ACM Trans. Math. Software 6 (1980), 450–455.
167. Potvin, J.-Y., Rousseau, J.-M., A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66 (1993), 331–340.
168. Potvin, J.-Y., Lapalme, G., Rousseau, J.-M., A generalized K-opt exchange procedure for the MTSP. INFOR 27 (1989), 474–481.
169. Potvin, J.-Y., Kervahut, T., Rousseau, J.-M., A Tabu search heuristic for the vehicle routing problem with time windows. Publication 855, 1992, Centre de Recherche sur les Transports, Université de Montréal, Evanston, Ill.
170. Psaraftis, H., A dynamic programming solution to the single-vehicle, many-to-many, immediate request dial-a-ride problem. Transp. Sci. 14 (1980), 130–154.
171. Psaraftis, H., An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows. Transp. Sci. 17 (1983), 351–357.
172. Psaraftis, H., Scheduling large-scale advance-request dial-a-ride systems. Am. J. Math. Manage. Sci. 6 (1986), 327–367.
173. Psaraftis, H.N., Orlin, J.B., Bienstock, D., Thompson, P.M., Analysis and solution algorithms of sealift routing and scheduling problems: Final report. Working Paper 1700-85, 1985, M.I.T., Sloan School of Management, Boston, Mass.
174. Psaraftis, H., Solomon, M.M., Magnanti, T.L., Kim, T., Routing and scheduling on the shoreline with release times. Manage. Sci. 36 (1990), 212–223.
175. Pullen, H., Webb, M., A computer application to a transport scheduling problem. Comput. J. 10 (1967), 10–13.
176. Rappoport, H.K., Levy, L.S., Golden, B.L., Toussaint, K., A planning heuristic for military airlift. Interfaces 22 (1992), 73–87.
177. Rappoport, H.K., Levy, L.S., Toussaint, K., Golden, B.L., A transportation problem formulation for the MAC airlift planning problem. Working Paper, 1992, University of Maryland, Boston, Mass.
178. Ribeiro, C., Soumis, F., A column generation approach to the multiple depot vehicle scheduling problem. Oper. Res. 42 (1994), 41–52.
179. Rousseau, J.-M., (eds.) Computer Scheduling of Public Transport 2, 1985, North-Holland, College Park, Md.
180. Roy, S., Rousseau, J.-M., Lapalme, G., Ferland, J.A., Routing and scheduling for the transportation of disabled persons — the algorithm. Working Paper TP 5596E, 1984, Transport Canada, Transport Development Center, Amsterdam.
181. Roy, S., Rousseau, J.-M., Lapalme, G., Ferland, J.A., Routing and scheduling for the transportation of disabled persons — the tests. Working Paper TP 5598E, 1984, Transport Canada, Transport Development Center, Montreal.
182. Russell, R., An effective heuristic for the M-tour traveling salesman problem with some side conditions. Oper. Res. 25 (1977), 517–524.
183. Ryan, D.M., Foster, B.A., An integer programming approach to scheduling. Wren, A., (eds.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, 1981, North-Holland, Montreal, 269–280.
184. Ryan, D.M., Garner, K.M., The solution of air-crew scheduling problems for Air New Zealand. Proc. 21st Annu. Conf. of O.R.S.N.Z., 1985, 42–48.
185. Sansó, B., Desrochers, M., Desrosiers, J., Dumas, Y., Soumis, F., Modeling and solving routing and scheduling problems: GENCOL User Guide. 1990, GERAD, Amsterdam.
186. Savelsbergh, M.W.P., Local search in routing problems with time windows. Ann. Oper. Res. 4 (1985), 285–305.
187. Savelsbergh, M.W.P., Computer aided routing. Ph.D. Dissertation, 1988, Centre for Mathematics and Computer Science, 5255 Decelles, Montréal.
188. Savelsbergh, M.W.P., The vehicle routing problem with time windows: minimizing route duration. Working Paper, 1989, Centre for Mathematics and Computer Science, Amsterdam.
189. Sexton, T., Bodin, L., Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transp. Sci. 19 (1985), 378–410.
190. Sexton, T., Bodin, L., Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transp. Sci. 19 (1985), 411–435.
191. Sexton, T., Choi, Y., Pickup and delivery of partial loads with time windows. Am. J. Math. Manage. Sci. 6 (1986), 369–398.
192. Smith, B., Wren, A., VAMPIRES and TASC: Two successfully applied bus scheduling programs. Wren, A., (eds.) Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, 1981, North-Holland, Amsterdam, 97–124.
193. Smith, B.M., Wren, A., A bus crew scheduling system using a set covering formulation. Transp. Res. 22A (1988), 97–108.
194. Solanki, R.S., Southworth, F., An execution planning algorithm for military airlift. Interfaces 21 (1991), 121–131.
195. Solomon, M.M., The vehicle routing and scheduling problem with time window constraints: models and algorithms. Ph.D. Dissertation, 1983, Department of Decision Sciences, University of Pennsylvania, Amsterdam.
196. Solomon, M.M., On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks 16 (1986), 161–174.
197. Solomon, M.M., Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35 (1987), 254–265.
198. Solomon, M.M., Desrosiers, J., Time window constrained routing and scheduling problems. Transp. Sci. 22 (1988), 1–13.
199. Solomon, M.M., Baker, E., Schaffer, J., Vehicle routing and scheduling problems with time window constraints: efficient implementations of solution improvement procedures. Golden, B.L., Assad, A.A., (eds.) Vehicle Routing: Methods and Studies, 1988, North-Holland, Philadelphia, Pa, 85–106.
200. Soumis, F., Ferland, J., Rousseau, J.-M., A large scale model for airline fleet planning and scheduling problem. Transp. Res. 14B (1980), 191–201.
201. Soumis, F., Desrosiers, J., Desrochers, M., Optimal urban bus routing with scheduling flexibilities. Thoft Christensen, P., (eds.) Lecture Notes in Control and Information Sciences 59, 1985, Springer-Verlag, Amsterdam, 155–165.
202. Swersey, A., Ballard, W., Scheduling school buses. Manage. Sci. 30 (1983), 844–853.
203. Teodorović, D., Airlines Operations Research. 1988, Gordon and Breach, Berlin, Heidelberg.
204. Thompson, P.M., Psaraftis, H.N., Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Working Paper 89-008, 1989, Leavey School of Business and Administration, Santa Clara University, New York, N.Y.
205. Tsitsiklis, J., Special cases of the traveling salesman and repairman problems with time windows. Networks 22 (1992), 263–282.
206. Van der Bruggen, L.J.J., Lenstra, J.K., Schuur, P.C., Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transp. Sci. 27 (1993), 298–311.
207. Wedelin, D., Efficient algorithms for probabilistic inference, combinatorial optimization and the discovery of causal structure from data. Ph.D. Dissertation, 1993, Department of Computer Sciences, Chalmers University of Technology, Calif.
208. Wilson, H., Colvin, N., Computer control of the rochester dial-a-ride system. Report R77-31, 1977, Dept. of Civil Engineering, M.I.T., Göteborg.
209. Wilson, H., Weissberg, H., Advanced dial-a-ride algorithms research project: Final report. Report R76-20, 1976, Dept. of Civil Engineering, M.I.T., Boston, Mass.
210. Wilson, H., Sussman, J., Wang, H., Higonnet, B., Scheduling algorithms for dial-a-ride systems. Urban Systems Laboratory Report USL TR-70-13, 1971, M.I.T., Boston, Mass.
211. Wren, A., (eds.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, 1981, North-Holland, Boston, Mass.
212. Wren, A., Smith, B.M., Miller, A.J., Complementary approaches to crew scheduling. Rousseau, J.-M., (eds.) Computer Scheduling of Public Transport 2, 1985, North-Holland, Amsterdam, 263–278.
213. Yano, C., Chan, T., Richter, L., Cutler, T., Murty, K., McGettigan, D., Vehicle routing at quality stores. Interfaces 17 (1987), 52–63.