A Tactical Decision Support System for Empty Railcar Management

Published Online:https://doi.org/10.1287/trsc.32.4.306

References

  • Association of American Railroads Federal car utilization research demonstration program (FCUP): Manual of car utilization practices and procedures. Task Force 1, NTIS (1976) (Springfield, Virginia) Google Scholar
  • Bazaraa M. S. , Jarvis J. J. , Sherali H. D. Linear Programming and Network Flows (1990) 2nd ed. (John Wiley and Sons, Inc., New York) Google Scholar
  • Beaujon G. J. , Turnquist M. A. A model for fleet sizing and vehicle allocation. Transportation Sci. (1991) 25 19 27 LinkGoogle Scholar
  • Charnes A. , Cooper W. W. Management Models and Industrial Applications of Linear Programming (1961) (John Wiley and Sons, Inc., New York) Google Scholar
  • Feeney G. Controlling the distribution of empty freight cars. Proc. 10th National Meeting, Oper. Res. Soc. of America (1957) Google Scholar
  • Glickman T. S. , Sherali H. D. Large-scale network distribution of pooled empty freight cars over time with limited substitution and equitable benefits. Transportation Res. B (Theory) (1985) 19 2 85 94 CrossrefGoogle Scholar
  • Jordan W. C. , Turnquist M. A. A stochastic, dynamic network model for railroad car distribution. Transportation Sci. (1983) 17 123 145 LinkGoogle Scholar
  • Leddon C. D. , Wrathall E. Scheduling empty freight car fleets on the Louisville and Nashville railroad. Cybernetics Electronic Railways (1968) 3 154 158 Google Scholar
  • Mendiratta V. B. , Turnquist M. A. Model for management of empty freight cars. Transportation Res. Record (1982) 838 50 55 Google Scholar
  • Misra S. C. Linear programming of empty wagon disposition. Rail Internat (1972) 3 151 158 Google Scholar
  • Newton H. N. , Barnhart C. , Vance P. H. Finding near-optimal railroad blocking plans. Transportation Sci. (1997) . to appear Google Scholar
  • Philip C. E. , Sussman J. M. Inventory model of the railroad empty car distribution process. Transportation Res. Record (1977) 656 52 60 Google Scholar
  • Sherali H. D. Equivalent weights for lexicographic multi-objective programs: Characterizations and computations. Eur. J. Oper. Res. (1982) 11 367 379 CrossrefGoogle Scholar
  • Sherali H. D. Bounds on penalties for dummy arcs in transportation networks. Eur. J. Oper. Res. (1988) 36 353 359 CrossrefGoogle Scholar
  • Sherali H. D. , Soyster A. L. Preemptive and non-(t min+1)preemptive multi-objective programs: Relationships and counter examples. J. Optim. Theory Appl. (1983) 39 173 186 CrossrefGoogle Scholar
  • Sherali H. D. , Tuncbilek C. H. Static and dynamic time–space strategic models and algorithms for multi-level rail-car fleet management. Management Sci. (1997) 43 235 250 LinkGoogle Scholar
  • Sherali H. D. , Adams W. P. , Driscoll P. J. Exploiting special structures in constructing a hierarchy of relaxations for 0–1 mixed integer problems. Oper. Res. (1998) 46 3 396 405 LinkGoogle Scholar
  • Turnquist M. A. , Jordan W. C. Fleet sizing under production cycles and uncertain travel times. Transportation Sci. (1986) 20 227 236 LinkGoogle Scholar
  • White W. W. Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks (1972) 2 211 236 CrossrefGoogle Scholar
  • White W. W. , Bomberault A. M. A network algorithm for empty freight car allocation. IBM Systems J. (1969) 8 147 169 CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.