IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v97y1997i2p281-292.html
   My bibliography  Save this article

Locomotive assignment with heterogeneous consists at CN North America

Author

Listed:
  • Ziarati, Koorush
  • Soumis, Francois
  • Desrosiers, Jacques
  • Gelinas, Sylvie
  • Saintonge, Andre

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:97:y:1997:i:2:p:281-292
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00198-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Desaulniers, G. & Desrosiers, J. & Dumas, Y. & Marc, S. & Rioux, B. & Solomon, M. M. & Soumis, F., 1997. "Crew pairing at Air France," European Journal of Operational Research, Elsevier, vol. 97(2), pages 245-259, March.
    2. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    3. Glenn W. Graves & Richard D. McBride & Ira Gershkoff & Diane Anderson & Deepa Mahidhara, 1993. "Flight Crew Scheduling," Management Science, INFORMS, vol. 39(6), pages 736-745, June.
    4. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    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. 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.
    2. Philimon Nyamugure & Siphosenkosi Dube Swene & Edward T. Chiyaka & Farikayi K. Mutasa, 2014. "Train Schedule Optimization: A Case Study of the National Railways of Zimbabwe," International Journal of Management Sciences, Research Academy of Social Sciences, vol. 3(1), pages 1-20.
    3. Hong, Sung-Pil & Kim, Kyung Min & Lee, Kyungsik & Hwan Park, Bum, 2009. "A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway," Omega, Elsevier, vol. 37(3), pages 637-645, June.
    4. Peng Zhao & Yawei Li & Baoming Han & Ruixia Yang & Zhiping Liu, 2022. "Integrated Optimization of Rolling Stock Scheduling and Flexible Train Formation Based on Passenger Demand for an Intercity High-Speed Railway," Sustainability, MDPI, vol. 14(9), pages 1-22, May.
    5. Rouillon, Stéphane & Desaulniers, Guy & Soumis, François, 2006. "An extended branch-and-bound method for locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 404-423, June.
    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. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Balachandran Vaidyanathan & Ravindra K. Ahuja & James B. Orlin, 2008. "The Locomotive Routing Problem," Transportation Science, INFORMS, vol. 42(4), pages 492-507, November.
    13. 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.
    14. Zhong, Qingwei & Lusby, Richard M. & Larsen, Jesper & Zhang, Yongxiang & Peng, Qiyuan, 2019. "Rolling stock scheduling with maintenance requirements at the Chinese High-Speed Railway," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 24-44.
    15. 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.
    16. Bach, Lukas & Gendreau, Michel & Wøhlk, Sanne, 2015. "Freight railway operator timetabling and engine scheduling," European Journal of Operational Research, Elsevier, vol. 241(2), pages 309-319.
    17. 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.
    18. Ralf Borndörfer & Markus Reuther & Thomas Schlechte & Kerstin Waas & Steffen Weider, 2016. "Integrated Optimization of Rolling Stock Rotations for Intercity Railways," Transportation Science, INFORMS, vol. 50(3), pages 863-877, August.
    19. Lin, Boliang & Zhao, Yinan, 2021. "Synchronized optimization of EMU train assignment and second-level preventive maintenance scheduling," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    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. 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.
    22. Lusby, Richard M. & Haahr, Jørgen Thorlund & Larsen, Jesper & Pisinger, David, 2017. "A Branch-and-Price algorithm for railway rolling stock rescheduling," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 228-250.
    23. 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.
    24. Chung, Ji-Won & Oh, Seog-Moon & Choi, In-Chan, 2009. "A hybrid genetic algorithm for train sequencing in the Korean railway," Omega, Elsevier, vol. 37(3), pages 555-565, June.

    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. Jean-François Cordeau & Goran Stojković & François Soumis & Jacques Desrosiers, 2001. "Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling," Transportation Science, INFORMS, vol. 35(4), pages 375-388, November.
    2. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    3. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
    4. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    5. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
    6. Yan, Shangyao & Chang, Jei-Chi, 2002. "Airline cockpit crew scheduling," European Journal of Operational Research, Elsevier, vol. 136(3), pages 501-511, February.
    7. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    8. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    9. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    10. Desaulniers, G. & Desrosiers, J. & Dumas, Y. & Marc, S. & Rioux, B. & Solomon, M. M. & Soumis, F., 1997. "Crew pairing at Air France," European Journal of Operational Research, Elsevier, vol. 97(2), pages 245-259, March.
    11. Ioachim, Irina & Desrosiers, Jacques & Soumis, Francois & Belanger, Nicolas, 1999. "Fleet assignment and routing with schedule synchronization constraints," European Journal of Operational Research, Elsevier, vol. 119(1), pages 75-90, November.
    12. Nissen, Rüdiger & Haase, Knut, 2004. "Duty-period-based network model for airline crew rescheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 581, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Frédéric Quesnel & Guy Desaulniers & Frédéric Quesnel, 2020. "Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem," Transportation Science, INFORMS, vol. 54(1), pages 97-114, January.
    14. Jacques Desrosiers & Arielle Lasry & Daniel McInnis & Marius M. Solomon & François Soumis, 2000. "Air Transat Uses ALTITUDE to Manage Its Aircraft Routing, Crew Pairing, and Work Assignment," Interfaces, INFORMS, vol. 30(2), pages 41-53, April.
    15. Amy Mainville Cohn & Cynthia Barnhart, 2003. "Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions," Operations Research, INFORMS, vol. 51(3), pages 387-396, June.
    16. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, August.
    17. Yan, Shangyao & Tu, Yu-Ping, 2002. "A network model for airline cabin crew scheduling," European Journal of Operational Research, Elsevier, vol. 140(3), pages 531-540, August.
    18. Bouarab, Hocine & El Hallaoui, Issmail & Metrane, Abdelmoutalib & Soumis, François, 2017. "Dynamic constraint and variable aggregation in column generation," European Journal of Operational Research, Elsevier, vol. 262(3), pages 835-850.
    19. Omar Foutlane & Issmail Hallaoui & Pierre Hansen, 2022. "Distributed Integral Column Generation for Set Partitioning Problems," SN Operations Research Forum, Springer, vol. 3(2), pages 1-22, June.
    20. Guy Desaulniers & Daniel Villeneuve, 2000. "The Shortest Path Problem with Time Windows and Linear Waiting Costs," Transportation Science, INFORMS, vol. 34(3), pages 312-319, August.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:97:y:1997:i:2:p:281-292. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.