Centralized and decentralized train scheduling for intermodal operations

References

• Aggarwal , A.K. , Oblak , M. and Vermuganti , R.R. , ( 1995 ) A heuristic solution procedure for multicommodity integer flows. Computers and Operations Research , 22 ( 10 ), 1075 – 1087 .
   Web of Science ®Google Scholar
• Bamhart , C. , Hane , C.A. and Vance , P.H. , ( 1996 ) Integer multicommodity flow problems , Integer Programming and Combinatorial Optimization, 5th International IPCO Conference Proceedings , Springer-Verlag , Berlin , Germany , 58 – 71 .
   Google Scholar
• Barnhart , C. and Ratliff , H.D. , ( 1993 ) Modeling intermodal routing. Journal of Business Logistics , 14 ( 1 ), 205 – 223 .
   Google Scholar
• Chu , S.C.K. , Lin , C.K.Y. and Ng , K.Y.K. , ( 1991 ) Centralized versus decentralized manpower resource planning The case of a Hong Kong company. Journal of the Operational Research Society , 42 ( 7 ), 525 – 536 .
   Web of Science ®Google Scholar
• Crainic , T.G. and Rousseau , J.M. , ( 1986 ) Multicommodity, multimode freight transportation a general modeling and algorithmic framework for the service network design problem. Transportation Research , 20B ( 3 ), 225 – 242 .
   Google Scholar
• Folk , J.F. and Bharadwaj , A.K. , ( 1980 ) Conrail's use of linear programming to distribute empty freight cars. Proceedings of the Transportation Research Forum , 21 ( 1 ), 119 – 125 .
   Google Scholar
• Glickman , T.S. and Sherali , H.D. , ( 1985 ) Large-scale network distribution of pooled empty freight cars over time, with limited substitution and equitable benefits. Transportation Research , 19B ( 2 ), 85 – 94 .
   Google Scholar
• Gorman , M.F. , ( 1998a ) An application of genetic and tabu searches to the freight railroad operating plan problem. Annals of Operations Research , 78 , 51 – 69 .
   Web of Science ®Google Scholar
• Gorman , M.F. , ( 1998b ) Operating plan model improves service design at Santa Fe Railroad. Interfaces , 28 ( 4 ), 1 – 12 .
   Google Scholar
• Haghani , A.E. , ( 1989 ) Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transportation Research , 23B ( 6 ), 433 – 452 .
   Google Scholar
• Herrmann , J.W. , Ioannou , G. , Proth , J.M. and Minis , I. , ( 1996 ) A dual ascent approach to the fixed-charge capacitated network design problem. European Journal of Operational Research , 95 ( 3 ), 476 – 490 .
   Web of Science ®Google Scholar
• Hochbaum , D.S. and Segev , A. , ( 1989 ) Analysis of a flow problem with fixed charges. Networks , 19 ( 3 ), 291 – 312 .
   Web of Science ®Google Scholar
• Keaton , M. , ( 1989 ) Designing optimal railroad operating plans Lagrangian relaxation and heuristic approaches. Transportation Research , 23B ( 6 ), 415 – 431 .
   Google Scholar
• Keaton , M. , ( 1992 ) Designing railroad operating plans a dual adjustment method for implementing Lagrangian relaxation. Transportation Science , 26 ( 4 ), 263 – 279 .
   Web of Science ®Google Scholar
• Kikuchi , S. , ( 1985 ) Empty freight car dispatching model under freight car pool concept. Transportation Research , 19B ( 3 ), 169 – 185 .
   Google Scholar
• Kouvelis , P. and Gutierrez , G. , ( 1997 ) The newsvendor problem in a global market optimized centralized and decentralized control policies for a two-market stochastic inventory system. Management Science , 45 ( 5 ), 571 – 585 .
   Web of Science ®Google Scholar
• Kung , S.K. and Marsden , J.R. , ( 1995 ) A methodology and experimental shell for formally addressing centralized/distributed decision making choices. Decision Support Systems , 15 ( 1 ), 45 – 61 .
   Web of Science ®Google Scholar
• Lamar , B.W. , Sheffi , Y. and Powell , W.B. , ( 1990 ) A capacity improvement lower bound for fixed charge network design problems. Operations Research , 38 ( 4 ), 704 – 710 .
   Web of Science ®Google Scholar
• Marin , A. and Salmeron , J. , ( 1996 ) Tactical design of freight networks. part I exact and heuristic methods. European Journal of Operational Research , 90 ( 1 ), 26 – 44 .
   Web of Science ®Google Scholar
• Morlok , E.K. and Peterson , R.B. , ( 1970 ) Final report on a development of a geographic transportation network generation and evaluation model. Journal of the Transportation Research Forum , 11 , 71 – 105 .
   Google Scholar
• Newman , A.M. and Yano , C.A. , ( 1998 ) Scheduling direct and indirect trains and containers in an intermodal setting. Working Paper, Department of Industrial Engineering and Operations Research , University of California , Berkeley , CA . To appear in Transportation Science .
   Google Scholar
• Nozick , L.K. and Morlok , E.K. , ( 1997 ) A model for medium-term operations planning in an intermodal rail-truck service. Transportation Research , 31A ( 2 ), 91 – 107 .
   Google Scholar
• Palekar , U.S. , Karwan , M.H. and Zionts , S. , ( 1990 ) A branch-and-bound method for the fixed charge transportation problem. Management Science. 36 ( 9 ), 1092 – 1105 .
   Web of Science ®Google Scholar
• Schaffer , J.R. and O'Leary , D.E. , ( 1989 ) Use of penalties in a branch and bound procedure for the fixed charge transportation problem. European Journal of Operational Research , 43 ( 3 ), 305 – 312 .
   Web of Science ®Google Scholar
• Yano , C.A. and Newman , A.M. , ( 1998 ) Scheduling trains and containers with dynamic arrivals and due dates. Working Paper, Department of Industrial Engineering and Operations Research , University of California , Berkeley , CA .
   Google Scholar