IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v50y2016i2p366-389.html
   My bibliography  Save this article

From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming

Author

Listed:
  • Belgacem Bouzaiene-Ayari

    (Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544)

  • Clark Cheng

    (Norfolk Southern Corporation, Atlanta, Georgia 30309)

  • Sourav Das

    (Norfolk Southern Corporation, Atlanta, Georgia 30309)

  • Ricardo Fiorillo

    (Norfolk Southern Corporation, Atlanta, Georgia 30309)

  • Warren B. Powell

    (Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544)

Abstract

We present a general optimization framework for locomotive models that captures different levels of detail, ranging from single and multicommodity flow models that can be solved using commercial integer programming solvers, to a much more detailed multiattribute model that we solve using approximate dynamic programming (ADP). Both models have been successfully implemented at Norfolk Southern for different planning applications. We use these models, presented using a common notational framework, to demonstrate the scope of different modeling and algorithmic strategies, all of which add value to the locomotive planning problem. We demonstrate how ADP can be used for both deterministic and stochastic models that capture locomotives and trains at a very high level of detail.

Suggested Citation

  • Belgacem Bouzaiene-Ayari & Clark Cheng & Sourav Das & Ricardo Fiorillo & Warren B. Powell, 2016. "From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming," Transportation Science, INFORMS, vol. 50(2), pages 366-389, May.
    • Handle: RePEc:inm:ortrsc:v:50:y:2016:i:2:p:366-389
    DOI: 10.1287/trsc.2014.0536
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2014.0536
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2014.0536?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2000. "A Benders Decomposition Approach for the Locomotive and Car Assignment Problem," Transportation Science, INFORMS, vol. 34(2), pages 133-149, May.
    2. William C. Jordan & Mark A. Turnquist, 1983. "A Stochastic, Dynamic Network Model for Railroad Car Distribution," Transportation Science, INFORMS, vol. 17(2), pages 123-145, May.
    3. Balachandran Vaidyanathan & Ravindra K. Ahuja & James B. Orlin, 2008. "The Locomotive Routing Problem," Transportation Science, INFORMS, vol. 42(4), pages 492-507, November.
    4. Kaj Holmberg & Martin Joborn & Jan T. Lundgren, 1998. "Improved Empty Freight Car Distribution," Transportation Science, INFORMS, vol. 32(2), pages 163-173, May.
    5. Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
    6. Koorush Ziarati & François Soumis & Jacques Desrosiers & Marius M. Solomon, 1999. "A Branch-First, Cut-Second Approach for Locomotive Assignment," Management Science, INFORMS, vol. 45(8), pages 1156-1168, August.
    7. Ziarati, Koorush & Soumis, Francois & Desrosiers, Jacques & Gelinas, Sylvie & Saintonge, Andre, 1997. "Locomotive assignment with heterogeneous consists at CN North America," European Journal of Operational Research, Elsevier, vol. 97(2), pages 281-292, March.
    8. Lingaya, Norbert & Cordeau, Jean-Françcois & Desaulniers, Guy & Desrosiers, Jacques & Soumis, Françcois, 2002. "Operational car assignment at VIA Rail Canada," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 755-778, November.
    9. Hugo P. Simão & Jeff Day & Abraham P. George & Ted Gifford & John Nienow & Warren B. Powell, 2009. "An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application," Transportation Science, INFORMS, vol. 43(2), pages 178-197, May.
    10. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    11. Pierre J. Dejax & Teodor Gabriel Crainic, 1987. "Survey Paper---A Review of Empty Flows and Fleet Management Models in Freight Transportation," Transportation Science, INFORMS, vol. 21(4), pages 227-248, November.
    12. Glickman, Theodore S. & Sherali, Hanif D., 1985. "Large-scale network distribution of pooled empty freight cars over time, with limited substitution and equitable benefits," Transportation Research Part B: Methodological, Elsevier, vol. 19(2), pages 85-94, April.
    13. Huseyin Topaloglu & Warren B. Powell, 2006. "Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 31-42, February.
    14. Warren Powell & Joel Shapiro & Hugo Simao, 2001. "A Representational Paradigm for Dynamic Resource Transformation Problems," Annals of Operations Research, Springer, vol. 104(1), pages 231-279, April.
    15. Jean-François Cordeau & François Soumis & Jacques Desrosiers, 2001. "Simultaneous Assignment of Locomotives and Cars to Passenger Trains," Operations Research, INFORMS, vol. 49(4), pages 531-548, August.
    16. Haghani, Ali E., 1989. "Formulation and solution of a combined train routing and makeup, and empty car distribution model," Transportation Research Part B: Methodological, Elsevier, vol. 23(6), pages 433-452, December.
    17. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    18. Warren B. Powell & Joel A. Shapiro & Hugo P. Simão, 2002. "An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem," Transportation Science, INFORMS, vol. 36(2), pages 231-249, May.
    19. Vaidyanathan, Balachandran & Ahuja, Ravindra K. & Liu, Jian & Shughart, Larry A., 2008. "Real-life locomotive planning: New formulations and computational results," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 147-168, February.
    20. Ravindra K. Ahuja & Jian Liu & James B. Orlin & Dushyant Sharma & Larry A. Shughart, 2005. "Solving Real-Life Locomotive-Scheduling Problems," Transportation Science, INFORMS, vol. 39(4), pages 503-517, November.
    21. Martin Joborn & Teodor Gabriel Crainic & Michel Gendreau & Kaj Holmberg & Jan T. Lundgren, 2004. "Economies of Scale in Empty Freight Car Distribution in Scheduled Railways," Transportation Science, INFORMS, vol. 38(2), pages 121-134, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Camilo Ortiz-Astorquiza & Jean-François Cordeau & Emma Frejinger, 2021. "The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company," Transportation Science, INFORMS, vol. 55(2), pages 510-531, March.
    2. Lyu, Zhongyuan & Huang, George Q., 2023. "Cross-docking based factory logistics unitisation process: An approximate dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 311(1), pages 112-124.
    3. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    4. Yin, Jiateng & Tang, Tao & Yang, Lixing & Gao, Ziyou & Ran, Bin, 2016. "Energy-efficient metro train rescheduling with uncertain time-variant passenger demands: An approximate dynamic programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 178-210.
    5. Zhou, Shaorui & Zhang, Hui & Shi, Ning & Xu, Zhou & Wang, Fan, 2020. "A new convergent hybrid learning algorithm for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 283(1), pages 33-46.
    6. Liu, Yang & Xie, Jiaohong & Chen, Nan, 2022. "Stochastic one-way carsharing systems with dynamic relocation incentives through preference learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Prashant Premkumar & P. N. Ram Kumar, 2019. "Literature Review of Locomotive Assignment Problem from Service Operations Perspective: The Case of Indian Railways," IIM Kozhikode Society & Management Review, , vol. 8(1), pages 74-86, January.
    2. Camilo Ortiz-Astorquiza & Jean-François Cordeau & Emma Frejinger, 2021. "The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company," Transportation Science, INFORMS, vol. 55(2), pages 510-531, March.
    3. Xu, Xiaoming & Li, Chung-Lun & Xu, Zhou, 2018. "Integrated train timetabling and locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 573-593.
    4. Petr KOZLOV & Sergey VAKULENKO & Nikolay TUSHIN & Elena TIMUKHINA, 2017. "Model To Calculate The Optimal Mode Of Train Locomotives Turnover," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(3), pages 125-133, September.
    5. Warren B. Powell & Belgacem Bouzaiene-Ayari & Coleman Lawrence & Clark Cheng & Sourav Das & Ricardo Fiorillo, 2014. "Locomotive Planning at Norfolk Southern: An Optimizing Simulator Using Approximate Dynamic Programming," Interfaces, INFORMS, vol. 44(6), pages 567-578, December.
    6. Petr KOZLOV & Elena TIMUKHINA & Nikolay TUSHIN, 2018. "Coordination Of Locomotives Turnover And Servicing Modes," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 13(1), pages 19-26, March.
    7. Frisch, Sarah & Hungerländer, Philipp & Jellen, Anna & Primas, Bernhard & Steininger, Sebastian & Weinberger, Dominic, 2021. "Solving a real-world Locomotive Scheduling Problem with Maintenance Constraints," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 386-409.
    8. Scheffler, Martin & Neufeld, Janis S. & Hölscher, Michael, 2020. "An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 64-80.
    9. Piu, F. & Prem Kumar, V. & Bierlaire, M. & Speranza, M.G., 2015. "Introducing a preliminary consists selection in the locomotive assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 217-237.
    10. G Lulli & U Pietropaoli & N Ricciardi, 2011. "Service network design for freight railway transportation: the Italian case," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2107-2119, December.
    11. Prashant Premkumar & P. N. Ram Kumar, 2022. "Locomotive assignment problem: integrating the strategic, tactical and operational level aspects," Annals of Operations Research, Springer, vol. 315(2), pages 867-898, August.
    12. Nourbakhsh, Seyed Mohammad & Ouyang, Yanfeng, 2010. "Optimal fueling strategies for locomotive fleets in railroad networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1104-1114, September.
    13. Canca, David & Barrena, Eva, 2018. "The integrated rolling stock circulation and depot location problem in railway rapid transit systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 115-138.
    14. Martin Joborn & Teodor Gabriel Crainic & Michel Gendreau & Kaj Holmberg & Jan T. Lundgren, 2004. "Economies of Scale in Empty Freight Car Distribution in Scheduled Railways," Transportation Science, INFORMS, vol. 38(2), pages 121-134, May.
    15. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    16. Haahr, J.T. & Wagenaar, J.C. & Veelenturf, L.P. & Kroon, L.G., 2015. "A Comparison of Two Exact Methods for Passenger Railway Rolling Stock (Re)Scheduling," ERIM Report Series Research in Management ERS-2015-007-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Lin, Zhiyuan & Kwan, Raymond S.K., 2016. "A branch-and-price approach for solving the train unit scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 97-120.
    18. Gao, Yuan & Schmidt, Marie & Yang, Lixing & Gao, Ziyou, 2020. "A branch-and-price approach for trip sequence planning of high-speed train units," Omega, Elsevier, vol. 92(C).
    19. Vaidyanathan, Balachandran & Ahuja, Ravindra K. & Liu, Jian & Shughart, Larry A., 2008. "Real-life locomotive planning: New formulations and computational results," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 147-168, February.
    20. Michael F. Gorman & Dharma Acharya & David Sellers, 2010. "CSX Railway Uses OR to Cash In on Optimized Equipment Distribution," Interfaces, INFORMS, vol. 40(1), pages 5-16, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:50:y:2016:i:2:p:366-389. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.