IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v89y2016icp91-99.html
   My bibliography  Save this article

The empty wagons adjustment algorithm of Chinese heavy-haul railway

Author

Listed:
  • Zhang, Jinchuan
  • Yang, Hao
  • Wei, Yuguang
  • Shang, Pan

Abstract

The paper studied the problem of empty wagons adjustment of Chinese heavy-haul railway. Firstly, based on the existing study of the empty wagons adjustment of heavy-haul railway in the world, Chinese heavy-haul railway was analyzed, especially the mode of transportation organization and characteristics of empty wagons adjustment. Secondly, the optimization model was set up to solve the empty wagons adjustment of heavy-haul railway and the model took the minimum idling period as the function goal. Finally, through application and solution of one case, validity and practicability of model and algorithm had been proved. So, the model could offer decision support to transport enterprises on adjusting empty wagons.

Suggested Citation

  • Zhang, Jinchuan & Yang, Hao & Wei, Yuguang & Shang, Pan, 2016. "The empty wagons adjustment algorithm of Chinese heavy-haul railway," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 91-99.
    • Handle: RePEc:eee:chsofr:v:89:y:2016:i:c:p:91-99
    DOI: 10.1016/j.chaos.2015.10.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077915003215
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2015.10.011?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
    ---><---

    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. Lin, Bo-Liang & Wang, Zhi-Mei & Ji, Li-Jun & Tian, Ya-Ming & Zhou, Guo-Qing, 2012. "Optimizing the freight train connection service network of a large-scale rail system," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 649-667.
    2. Caserta, Marco & Schwarze, Silvia & Voß, Stefan, 2012. "A mathematical formulation and complexity considerations for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 219(1), pages 96-104.
    3. Morlok, Edward K. & Chang, David J., 2004. "Measuring capacity flexibility of a transportation system," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(6), pages 405-420, July.
    4. Chen, Anthony & Kasikitwiwat, Panatda, 2011. "Modeling capacity flexibility of transportation networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(2), pages 105-117, February.
    5. Bortfeldt, Andreas & Forster, Florian, 2012. "A tree search procedure for the container pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 217(3), pages 531-540.
    6. Ziyou, Gao & Yifan, Song, 2002. "A reserve capacity model of optimal signal control with user-equilibrium route choice," Transportation Research Part B: Methodological, Elsevier, vol. 36(4), pages 313-323, May.
    7. Berdica, Katja, 2002. "An introduction to road vulnerability: what has been done, is done and should be done," Transport Policy, Elsevier, vol. 9(2), pages 117-127, April.
    8. Amar Kumar Narisetty & Jean-Philippe P. Richard & David Ramcharan & Deby Murphy & Gayle Minks & Jim Fuller, 2008. "An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad," Interfaces, INFORMS, vol. 38(2), pages 89-102, April.
    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. Wang, Dian & Zhao, Jun & Peng, Qiyuan, 2022. "Optimizing the loaded train combination problem at a heavy-haul marshalling station," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(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. Jansuwan, Sarawut & Chen, Anthony & Xu, Xiangdong, 2021. "Analysis of freight transportation network redundancy: An application to Utah’s bi-modal network for transporting coal," Transportation Research Part A: Policy and Practice, Elsevier, vol. 151(C), pages 154-171.
    2. Gu, Yu & Fu, Xiao & Liu, Zhiyuan & Xu, Xiangdong & Chen, Anthony, 2020. "Performance of transportation network under perturbations: Reliability, vulnerability, and resilience," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    3. Boge, Sven & Goerigk, Marc & Knust, Sigrid, 2020. "Robust optimization for premarshalling with uncertain priority classes," European Journal of Operational Research, Elsevier, vol. 287(1), pages 191-210.
    4. Xu, Xin-yue & Liu, Jun & Li, Hai-ying & Jiang, Man, 2016. "Capacity-oriented passenger flow control under uncertain demand: Algorithm development and real-world case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 130-148.
    5. Sugiura, Satoshi & Chen, Anthony, 2021. "Vulnerability analysis of cut-capacity structure and OD demand using Gomory-Hu tree method," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 111-127.
    6. Zehendner, Elisabeth & Caserta, Marco & Feillet, Dominique & Schwarze, Silvia & Voß, Stefan, 2015. "An improved mathematical formulation for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 415-422.
    7. Lichun Chen & Elise Miller-Hooks, 2012. "Resilience: An Indicator of Recovery Capability in Intermodal Freight Transport," Transportation Science, INFORMS, vol. 46(1), pages 109-123, February.
    8. Shaheen Sardar & Young Hae Lee & Muhammad Saad Memon, 2016. "A Sustainable Outsourcing Strategy Regarding Cost, Capacity Flexibility, and Risk in a Textile Supply Chain," Sustainability, MDPI, vol. 8(3), pages 1-19, March.
    9. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    10. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    11. Ting, Ching-Jung & Wu, Kun-Chih, 2017. "Optimizing container relocation operations at container yards with beam search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 17-31.
    12. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    13. Zheng, Yu & Zhang, Xiaoning & Liang, Zhe, 2020. "Multimodal subsidy design for network capacity flexibility optimization," Transportation Research Part A: Policy and Practice, Elsevier, vol. 140(C), pages 16-35.
    14. Wang, Ning & Jin, Bo & Lim, Andrew, 2015. "Target-guided algorithms for the container pre-marshalling problem," Omega, Elsevier, vol. 53(C), pages 67-77.
    15. Wei, Qinshuang & Gao, Zhenyu & Clarke, John-Paul & Topcu, Ufuk, 2024. "Risk-aware urban air mobility network design with overflow redundancy," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
    16. Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations," European Journal of Operational Research, Elsevier, vol. 267(2), pages 467-477.
    17. Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Ruiz, Rubén, 2019. "Integer programming models for the pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 142-154.
    18. Jovanovic, Raka & Tuba, Milan & Voß, Stefan, 2019. "An efficient ant colony optimization algorithm for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 78-90.
    19. Xu, Xiangdong & Chen, Anthony & Jansuwan, Sarawut & Yang, Chao & Ryu, Seungkyu, 2018. "Transportation network redundancy: Complementary measures and computational methods," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 68-85.
    20. Jin, Bo & Tanaka, Shunji, 2023. "An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules," European Journal of Operational Research, Elsevier, vol. 304(2), pages 494-514.

    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:chsofr:v:89:y:2016:i:c:p:91-99. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.