Improved Empty Freight Car Distribution
Published Online:1 May 1998https://doi.org/10.1287/trsc.32.2.163
References
- Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs) Google Scholar
- Dual-ascent methods for large-scale multicommodity flow problems. Naval Res. Logist. (1993) 40 305 324 Crossref, Google Scholar
- Integer multicommodity flow problems. (1996) . Technical paper, Massachusetts Institute of Technology, Center for Transportation Studies, Cambridge, MA Google Scholar
- An implementation of linear and nonlinear multicommodity network flows. (1995) . Technical paper, Statistics and Operations Research Department, Universitat Politècnica de Catalunya Google Scholar
- A real time dynamic optimal freight car management simulation model of the multiple railroad, multicommodity temporal spatial network flow problem. (1986) . Ph.D. thesis, Princeton University, Princeton, NJ Google Scholar
- CPLEX Optimization, Inc. Using the CPLEX Callable Library (1994) (CPLEX Optimization, Inc., Incline Village, NV) Google Scholar
- A tactical planning model for rail freight transportation. Transportation Sci. (1984) 18 165 184 Link, Google Scholar
- A review of empty flows and fleet management models in freight transportation. Transportation Sci. (1987) 21 227 247 Link, Google Scholar
- An out-of-kilter based heuristic for the integer multicommodity transportation problem. Comput. Oper. Res. (1977) 4 13 20 Crossref, Google Scholar
- Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transportation Res. B (1989) 23B 433 452 Crossref, Google Scholar
- The distribution of empty wagons by means of computer: An analytical model of the Swiss federal railways. Rail Internat. (1973) 4 1005 1010 Google Scholar
- Computer-controlled empty wagon distribution on the SBB. Rail Internat. (1977) 8 25 32 Google Scholar
- Lagrangean heuristics for linear cost multicommodity network flow problems. (1995) . Working paper LiTH-MAT-OPT/WP-95-01, Department of Mathematics, Linköping University, Sweden Google Scholar
- A model for distribution of empty freight cars. (1996) . Technical paper LiTH-MAT-R-1996-11, Department of Mathematics, Linköping University, Sweden Google Scholar
- A stochastic, dynamic network model for railroad car distribution. Transportation Sci. (1983) 17 123 145 Link, Google Scholar
- Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches. Transportation Res. B (1989) 23B 415 431 Crossref, Google Scholar
- Designing railroad operating plans: A dual adjustment method for implementing Lagrangian relaxation. Transportation Sci. (1992) 26 263 279 Link, Google Scholar
- A Lagrangean dual scheme for structured linear programs with applications and extensions. (1992) . Ph.D. thesis, Linköping University, Linköping, Sweden Google Scholar
- Applying the LP solution to the daily distribution of freight cars. (1990) . Presented at TIMS/ORSA Joint National Meeting, Las Vegas, NV Google Scholar
- Linear programming of empty wagon disposition. Rail Internat. (1972) 3 151 158 Google Scholar
- An operational planning model for the dynamic vehicle allocation problem with uncertain demands. Transportation Res. B (1987) 21B 217 232 Crossref, Google Scholar
- Real-time optimization of containers and flatcars for intermodal operations. (1996) . Technical paper SOR-96-05, Department of Civil Engineering and Operations Research, Princeton University Google Scholar
- A dynamic multicommodity network flow model for real time optimal rail freight car management. (1985) . Ph.D. thesis, Princeton University, Princeton, NJ Google Scholar
- Railroad car distribution: A fast network model with multiple car types and delays. (1993) . Paper 930064, Transportation Research Board, 72nd Annual Meeting, Washington, DC Google Scholar
- An interactive microcomputer-based planning model for railroad car distribution. (1989) . Presented at TIMS/ORSA Joint National Meeting, Vancouver, BC Google Scholar
- Rechnergesteuerte Leerwagenverteilung (LWV). (1991) (Die Bundesbahn, Germany) 389 431 . No. 4 Google Scholar
- A network algorithm for empty freight car allocation. IBM System J. (1969) 2 147 169 Crossref, Google Scholar

