Service network design in freight transportation

European Journal of Operational Research

Volumn 122, Issue 2, 2000, Pages 272-288

  Crainic, Teodor Gabriel ^a,b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; FREIGHT TRANSPORTATION; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

SERVICE NETWORK DESIGNS; TACTICAL PLANNING;

OPERATIONS RESEARCH;

EID: 0033891974     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00233-7     Document Type: Article

References (56)

1. Assad A.A. Models for rail transportation. Transportation Research A: Policy and Practice. 14:1980;205-220.
2. Balakrishnan A., Magnanti T.L., Mirchandani P. Network design. Dell'Amico M., Maffioli F., Martello S. Annotated Bibliographies in Combinatorial Optimization. 1997;311-334 Wiley, New York.
3. Balakrishnan A., Magnanti T.L., Wong R.T. A dual-ascent procedure for large-scale uncapacitated network design. Operations Research. 37(5):1989;716-740.
4. C. Barnhart, H. Jin, P.H. Vance, Railroad blocking: a network design application, Operations Research, 1997 (forthcoming).
5. Barnhart C., Schneur R.R. Network design for express freight service. Operations Research. 44(6):1996;852-863.
6. D. Berger, B. Gendron, J.-Y. Potvin, S. Raghavan, P. Soriano, Tabu search for a network loading problem with multiple facilities, Publication CRT-98-20, Centre de recherche sur les transports, Université de Montréal, 1998.
7. Braklow J.W., Graham W.W., Hassler S.M., Peck K.E., Powell W.B. Interactive optimization improves service and performance for Yellow Freight System. Interfaces. 22(1):1992;147-172.
8. Cordeau J.-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transportation Science. 32(4):1998;380-404.
9. Crainic T.G. A comparison of two methods for tactical planning in rail freight transportation. Brans J.P. Operational Research'84. 1984;707-720 North-Holland, Amsterdam.
10. Crainic T.G. Rail tactical planning: Issues, models and tools. Bianco L., LaBella A. Freight Transport Planning and Logistics. 1988;463-509 Springer, Berlin.
11. T.G. Crainic, Long haul freight transportation, in: R.W. Hall (Ed.), Handbook of Transportation Science, Kluwer, Norwell, MA, 1999 (forthcoming).
12. Crainic T.G., Ferland J.-A., Rousseau J.-M. A tactical planning model for rail freight transportation. Transportation Science. 18(2):1984;165-184.
13. T.G. Crainic, A. Frangioni, B. Gendron, Bundle-based relaxation methods for multicommodity capacitated network design, Discrete Applied Mathematics (forthcoming).
14. T.G. Crainic, M. Gendreau, Cooperative parallel tabu search for capacitated network design, Publication CRT-98-71, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1998.
15. T.G. Crainic, M. Gendreau, J.M. Farvolden, A simplex-based tabu search method for capacitated network design, INFORMS Journal on Computing, 1999 (forthcoming).
16. Crainic T.G., Laporte G. Planning models for freight transportation. European Journal of Operational Research. 1997;409-438.
17. T.G. Crainic, M.-C. Nicolle, Planification tactique du transport ferroviaire des marchandises: quelques aspects de modélisation, in: Actes du Premier Congrès International en France de Génie Industriel, CEFI-AFCET-GGI, Paris, 1986, pp. 161-174.
18. J.T.G. Crainic, J.-M. Rousseau, Multicommodity, multimode freight transportation: A general modeling and algorithmic framework, Transportation Research B: Methodological 20 (1986) 225-242.
19. Crainic T.G., Roy J. O.R. tools for tactical freight transportation planning. European Journal of Operational Research. 33(3):1988;290-297.
20. Dejax P.J., Crainic T.G. A review of empty flows and fleet management models in freight transportation. Transportation Science. 21(4):1987;227-247.
21. Delorme L., Roy J., Rousseau J.-M. Motor-carrier operation planning models: a state of the art. Bianco L., LaBella A. Freight Transport Planning and Logistics. 1988;510-545 Springer, Berlin.
22. Farvolden J.M., Powell W.B. Subgradient methods for the service network design problem. Transportation Science. 28(3):1994;256-272.
23. Farvolden J.M., Powell W.B., Lustig I.J. A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem. Operations Research. 41(4):1992;669-694.
24. Gendron B., Crainic T.G. Parallel branch-and-bound algorithms: Survey and synthesis. Operations Research. 42(6):1994;1042-1066.
25. B. Gendron, T.G. Crainic, Parallel Implementations of bounding procedures for multicommodity capacitated network design problems, Publication CRT-94-45, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1994.
26. B. Gendron, T.G. Crainic, Relaxations for multicommodity network design problems, Publication CRT-965, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1994.
27. B. Gendron, T.G. Crainic, Bounding procedures for multicommodity capacitated network design problems, Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal, Montréal, QC, Canada, 1996.
28. Gendron B., Crainic T.G., Frangioni A. Multicommodity capacitated network design. Sansó B., Soriano P. Telecommunications Network Planning. 1998;1-19 Kluwer, Norwell, MA.
29. Glover F., Laguna M. Tabu Search. 1997;Kluwer, Norwell, MA.
30. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison-Wesley, Reading, MA.
31. Gorman M.F. An application of genetic and tabu searches to the freight railroad operating plan problem. Annals of Operations Research. 78:1998;51-69.
32. Gorman M.F. Santa Fe Railway uses an operating-plan model to improve its service design. Interfaces. 28(4):1998;1-12.
33. T. Grünert, H.-J. Sebastian, Planning models for long-haul operations of postal and express shipment companies, European Journal of Operational Research 122 (2000) this issue.
34. Haghani A.E. Formulation and solution of combined train routing and makeup, and empty car distribution model. Transportation Research B: Methodological. 23(6):1989;431-433.
35. Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound. Operations Research. 46(2):1998;247-259.
36. K. Holmberg, D. Yuan, A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem, Report LiTH-MAT-R-1996-23, Department of Mathematics, Linköping Institute of Technology, 1996.
37. Keaton M.H. Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transportation Research B: Methodological. 23 B(6):1989;415-431.
38. Keaton M.H. Designing optimal railroad operating plans: a dual adjustment method for implementing Lagrangian relaxation. Transportation Science. 26:1992;263-279.
39. D. Kim, C. Barnhart, Transportation service network design: Models and algorithms, Report, Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, MA, 1997.
40. D. Kim, C. Barnhart, K. Ware, Multimodal Express package delivery: a service network design application, Transportation Science, 1997 (forthcoming).
41. Laarhoven P., Aarts E.H.L. Simulated Annealing: Theory and Applications. 1987;Reidel, Dordrecht.
42. Lamar B.W., Sheffi Y., Powell W.B. A capacity improvement lower bound for fixed charge network design problems. Operations Research. 38(4):1990;704-710.
43. Magnanti T.L., Mirchandani P., Vachani R. The convex hull of two core capacitated network design problems. Mathematical Programming. 60:1993;233-250.
44. Magnanti T.L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Operations Research. 43:1995;142-157.
45. T.L. Magnanti, L.A. Wolsey, Optimal trees, in: M. Ball, M.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Models, vol. 7, Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 1995, pp. 503-615.
46. Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science. 18(1):1986;1-55.
47. Minoux M. Network synthesis and optimum network design problems: Models solution methods and applications. Networks. 19:1986;313-360.
48. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 1988;Wiley, New York.
49. Newton H.N., Barnhart C., Vance P.H. Constructing railroad blocking plans to minimize handling costs. Transportation Science. 32(4):1998;330-345.
50. Powell W.B. A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Science. 20(4):1986;246-357.
51. Powell W.B., Koskosidis Y.A. Shipment routing algorithms with tree constraints. Transportation Science. 26(3):1992;230-245.
52. Powell W.B., Sheffi Y. The load-planning problem of motor carriers: problem description and a proposed solution approach. Transportation Research A: Policy and Practice. 17(6):1983;471-480.
53. Powell W.B., Sheffi Y. Design and implementation of an interactive optimization system for the network design in the motor carrier industry. Operations Research. 37(1):1989;12-29.
54. Roy J., Crainic T.G. Improving intercity freight routing with a tactical planning model. Interfaces. 22(3):1992;31-44.
55. Roy J., Delorme L. NETPLAN: A network optimization model for tactical planning in the less-than-truckload motor-carrier industry. INFOR. 27(1):1989;22-35.
56. Salkin H.M., Mathur K. Foundations of Integer Programming. 1989;North-Holland, Amsterdam.