IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v13y2021i8p4173-d532656.html
   My bibliography  Save this article

A Green Transportation Planning Approach for Coal Heavy-Haul Railway System by Simultaneously Optimizing Energy Consumption and Capacity Utilization

Author

Listed:
  • Jianjun Fu

    (School of Traffic and Transportation, Beijing Jiaotong University, No.3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China)

  • Junhua Chen

    (School of Traffic and Transportation, Beijing Jiaotong University, No.3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China)

Abstract

Coal heavy-haul railway has been aiming at maximizing capacity utilization, but ignoring energy consumption for a long time. With the focus on green production, heavy-haul railways need transportation organization plans that can balance energy consumption and capacity utilization. Based on this, this paper proposes a data mining + optimization framework that uses train trajectory data to estimate train energy consumption and then uses a mixed integer programming model to simultaneously optimize plans from energy and capacity aspects. We use Gaussian distribution to describe features of energy consumption under different situations, and build a multi-dimensional cube to store these features to connect with the optimization model. In addition, a branch-and-bound algorithm is design to solve the optimization model. From the sensitivity analyses we can conclude that (1) shortening the departure interval from 13 min to 9 min will generate more energy consumption, about 3.6%; (2) combining short-form trains (50 units) with long-form trains (100 units) while increasing the carrying capacity will generate more energy consumption, about 5~14%; and (3) by controlling weights of the optimization model, capacity–energy-balanced plans can be obtained. The results can contribute to improving the sustainability of railways.

Suggested Citation

  • Jianjun Fu & Junhua Chen, 2021. "A Green Transportation Planning Approach for Coal Heavy-Haul Railway System by Simultaneously Optimizing Energy Consumption and Capacity Utilization," Sustainability, MDPI, vol. 13(8), pages 1-25, April.
  • Handle: RePEc:gam:jsusta:v:13:y:2021:i:8:p:4173-:d:532656
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/13/8/4173/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/13/8/4173/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    2. Ghoseiri, Keivan & Szidarovszky, Ferenc & Asgharpour, Mohammad Jawad, 2004. "A multi-objective train scheduling model and solution," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 927-952, December.
    3. Kirschstein, Thomas & Meisel, Frank, 2015. "GHG-emission models for assessing the eco-friendliness of road and rail freight transports," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 13-33.
    4. Nam Seok Kim & Bert Van Wee, 2009. "Assessment of CO 2 emissions for truck-only and rail-based intermodal freight systems in Europe," Transportation Planning and Technology, Taylor & Francis Journals, vol. 32(4), pages 313-333, June.
    5. Yang, Xin & Chen, Anthony & Ning, Bin & Tang, Tao, 2016. "A stochastic model for the integrated optimization on metro timetable and speed profile with uncertain train mass," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 424-445.
    6. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    7. Bodin, Lawrence D. & Golden, Bruce L. & Schuster, Allan D. & Romig, William, 1980. "A model for the blocking of trains," Transportation Research Part B: Methodological, Elsevier, vol. 14(1-2), pages 115-120.
    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. Hanxiao Zhou & Leishan Zhou & Bin Guo & Zixi Bai & Zeyu Wang & Lu Yang, 2021. "A Scheduling Approach for the Combination Scheme and Train Timetable of a Heavy-Haul Railway," Mathematics, MDPI, vol. 9(23), pages 1-29, November.
    2. Tian, Ai-Qing & Wang, Xiao-Yang & Xu, Heying & Pan, Jeng-Shyang & Snášel, Václav & Lv, Hong-Xia, 2024. "Multi-objective optimization model for railway heavy-haul traffic: Addressing carbon emissions reduction and transport efficiency improvement," Energy, Elsevier, vol. 294(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. Han Zheng & Junhua Chen & Zhaocha Huang & Jianhao Zhu, 2022. "Joint Optimization of Multi-Cycle Timetable Considering Supply-to-Demand Relationship and Energy Consumption for Rail Express," Mathematics, MDPI, vol. 10(21), pages 1-29, November.
    2. Dawei Chen & Fangxu Mo & Ye Chen & Jun Zhang & Xinyu You, 2022. "Optimization of Ramp Locations along Freeways: A Dynamic Programming Approach," Sustainability, MDPI, vol. 14(15), pages 1-13, August.
    3. Fuying Liu & Chen Liu & Qi Zhao & Chenhao He, 2021. "A Hybrid Teaching-Learning-Based Optimization Algorithm for the Travel Route Optimization Problem alongside the Urban Railway Line," Sustainability, MDPI, vol. 13(3), pages 1-17, January.
    4. P. L. van den Berg & J. T. van Essen, 2019. "Scheduling Non-Urgent Patient Transportation While Maximizing Emergency Coverage," Transportation Science, INFORMS, vol. 53(2), pages 492-509, March.
    5. Zhijie Liu & Jianyu Jiang & Zhiqiang Gan & Chengxin Lin, 2022. "Ballast water dynamic allocation optimization model and analysis for safe and reliable operation of floating cranes," Annals of Operations Research, Springer, vol. 311(1), pages 279-294, April.
    6. Ye, Hongbo & Liu, Ronghui, 2016. "A multiphase optimal control method for multi-train control and scheduling on railway lines," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 377-393.
    7. Han Zheng & Junhua Chen & Xingchen Zhang & Zixian Yang, 2019. "Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option," Sustainability, MDPI, vol. 11(18), pages 1-28, September.
    8. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    9. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    10. Yang, Xin & Chen, Anthony & Ning, Bin & Tang, Tao, 2017. "Bi-objective programming approach for solving the metro timetable optimization problem with dwell time uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 22-37.
    11. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    12. Salii, Yaroslav, 2019. "Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization," European Journal of Operational Research, Elsevier, vol. 272(1), pages 32-42.
    13. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    14. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    15. Timo Gschwind & Michael Drexl, 2019. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 53(2), pages 480-491, March.
    16. Tian, Xiaoyu & Zhang, Zhi-Hai, 2019. "Capacitated disassembly scheduling and pricing of returned products with price-dependent yield," Omega, Elsevier, vol. 84(C), pages 160-174.
    17. Tafreshian, Amirmahdi & Abdolmaleki, Mojtaba & Masoud, Neda & Wang, Huizhu, 2021. "Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 227-259.
    18. Albrecht, Amie & Howlett, Phil & Pudney, Peter & Vu, Xuan & Zhou, Peng, 2016. "The key principles of optimal train control—Part 1: Formulation of the model, strategies of optimal type, evolutionary lines, location of optimal switching points," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 482-508.
    19. Jin, Jian Gang & Zhao, Jun & Lee, Der-Horng, 2013. "A column generation based approach for the Train Network Design Optimization problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 1-17.
    20. Lawrence, Martha B. & Shughart, L.A., 1992. "A Railroad Terminal cost model to support network management strategy," Transportation Research Forum Proceedings 1990s 311884, Transportation Research Forum.

    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:gam:jsusta:v:13:y:2021:i:8:p:4173-:d:532656. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.