Simultaneous Assignment of Locomotives and Cars to Passenger Trains

References

  • Ben-Kheder N., Kintanar J., Queille C., Stripling W. K. Decision support scheduling systems for SNCF. (1997) Presented at the INFORMS Fall MettingDallas, TexasGoogle Scholar
  • Benders J. F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 45:238–252CrossrefGoogle Scholar
  • Cordeau J.-F., Desaulniers G., Lingaya N., Soumis F., Desrosiers J. Simultaneous locomotive and car assignment at VIA Rail Canada. Trans. Res. (2000) BForthcomingGoogle Scholar
  • Cordeau J.-F., Soumis F., Desrosiers J. A Benders decomposition approach for the locomotive and car assignment problem. Trans. Sci. (2000) 34:133–149LinkGoogle Scholar
  • Cordeau J.-F., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Trans. Sci. (1998) 32:380–404LinkGoogle Scholar
  • CPLEXUsing the CPLEX Callable Library 5.0 (1997) (ILOG Inc., Incline Village, NV) Google Scholar
  • Dantzig G. B., Wolfe P. Decomposition principle for linear programming. Oper. Res. (1960) 8:101–111LinkGoogle Scholar
  • Geoffrion A. M. Lagrangean relaxation for integer programming. Math. Programming Stud. (1974) 2:82–113CrossrefGoogle Scholar
  • Magnanti T. L., Wong R. T. Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper. Res. (1981) 29:464–484LinkGoogle Scholar
  • McDaniel D., Devine M. A modified Benders partitioning algorithm for mixed integer programming. Management Sci. (1977) 24:312–379LinkGoogle Scholar
  • Ramani K. V., Mandal B. K. Operational planning of passenger trains in Indian railways. Interface (1992) 22(5):39–51LinkGoogle 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.