IDEAS home Printed from https://ideas.repec.org/a/eee/energy/v296y2024ics0360544224007710.html
   My bibliography  Save this article

Assessing the sustainability of time-dependent electric demand responsive transit service through deep reinforcement learning

Author

Listed:
  • Wang, Hongfei
  • Guan, Hongzhi
  • Qin, Huanmei
  • Zhao, Pengfei

Abstract

Demand responsive transit (DRT) is expected to offer enormous possibilities for fulfilling the ever-growing diversified demand while promoting the urban sustainability. Nevertheless, it seems to remain critical but intractable to make the routing decision in response to the time-dependent travel speeds. Considering the risk of speed uncertainty, deep reinforcement learning (DRL) algorithm is presented to address the time-dependent electric DRT problem in this study. Long short-term memory (LSTM) is integrated into the attention mechanism at the decoding process. To evaluate the sustainability, the reward function can be subdivided into the number of served passengers, regret utility, and carbon emissions. To testify the effectiveness, we made a comparison between the CPLEX solver, NSGA-II, and the proposed algorithm in a realistic transportation network of Beijing. The computational results demonstrate that DRL algorithm with shorter computation time and better solutions is dramatically superior to the other approaches. Therefore, the DRL algorithm provides a more efficient framework for addressing the time-dependent electric DRT problem while improving the sustainability of the environment and society.

Suggested Citation

  • Wang, Hongfei & Guan, Hongzhi & Qin, Huanmei & Zhao, Pengfei, 2024. "Assessing the sustainability of time-dependent electric demand responsive transit service through deep reinforcement learning," Energy, Elsevier, vol. 296(C).
  • Handle: RePEc:eee:energy:v:296:y:2024:i:c:s0360544224007710
    DOI: 10.1016/j.energy.2024.130999
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0360544224007710
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.energy.2024.130999?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. Perugu, Harikishan & Collier, Sonya & Tan, Yi & Yoon, Seungju & Herner, Jorn, 2023. "Characterization of battery electric transit bus energy consumption by temporal and speed variation," Energy, Elsevier, vol. 263(PC).
    2. Wang, Yi & Qiu, Dawei & He, Yinglong & Zhou, Quan & Strbac, Goran, 2023. "Multi-agent reinforcement learning for electric vehicle decarbonized routing and scheduling," Energy, Elsevier, vol. 284(C).
    3. K. S. Krishnan, 1977. "Incorporating Thresholds of Indifference in Probabilistic Choice Models," Management Science, INFORMS, vol. 23(11), pages 1224-1233, July.
    4. Schilde, M. & Doerner, K.F. & Hartl, R.F., 2014. "Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 18-30.
    5. Gao, Zhiming & Lin, Zhenhong & LaClair, Tim J. & Liu, Changzheng & Li, Jan-Mou & Birky, Alicia K. & Ward, Jacob, 2017. "Battery capacity and recharging needs for electric buses in city transit service," Energy, Elsevier, vol. 122(C), pages 588-600.
    6. Shao, Shuai & Tan, Zhijia & Liu, Zhiyuan & Shang, Wenlong, 2022. "Balancing the GHG emissions and operational costs for a mixed fleet of electric buses and diesel buses," Applied Energy, Elsevier, vol. 328(C).
    7. Arun Prakash, A., 2020. "Algorithms for most reliable routes on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 202-220.
    8. Di, Xuan & Liu, Henry X., 2016. "Boundedly rational route choice behavior: A review of models and methodologies," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 142-179.
    9. Yu, Qian & Li, Tiezhu & Li, Hu, 2016. "Improving urban bus emission and fuel consumption modeling by incorporating passenger load factor for real world driving," Applied Energy, Elsevier, vol. 161(C), pages 101-111.
    10. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    11. Li, Mingyang & Tang, Jinjun, 2023. "Simulation-based optimization considering energy consumption for assisted station locations to enhance flex-route transit," Energy, Elsevier, vol. 277(C).
    12. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    13. Chorus, Caspar G. & Arentze, Theo A. & Timmermans, Harry J.P., 2008. "A Random Regret-Minimization model of travel choice," Transportation Research Part B: Methodological, Elsevier, vol. 42(1), pages 1-18, January.
    14. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    15. Foda, Ahmed & Abdelaty, Hatem & Mohamed, Moataz & El-Saadany, Ehab, 2023. "A generic cost-utility-emission optimization for electric bus transit infrastructure planning and charging scheduling," Energy, Elsevier, vol. 277(C).
    16. Sai Shao & Wei Guan & Bin Ran & Zhengbing He & Jun Bi, 2017. "Electric Vehicle Routing Problem with Charging Time and Variable Travel Time," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-13, January.
    17. David E. Bell, 1982. "Regret in Decision Making under Uncertainty," Operations Research, INFORMS, vol. 30(5), pages 961-981, October.
    18. Ke, Bwo-Ren & Chung, Chen-Yuan & Chen, Yen-Chang, 2016. "Minimizing the costs of constructing an all plug-in electric bus transportation system: A case study in Penghu," Applied Energy, Elsevier, vol. 177(C), pages 649-660.
    19. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
    20. Wang, Xiaolei & Liu, Wei & Yang, Hai & Wang, Dan & Ye, Jieping, 2020. "Customer behavioural modelling of order cancellation in coupled ride-sourcing and taxi markets," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 358-378.
    21. He, Yi & Liu, Zhaocai & Zhang, Yiming & Song, Ziqi, 2023. "Time-dependent electric bus and charging station deployment problem," Energy, Elsevier, vol. 282(C).
    22. van Engelen, Matti & Cats, Oded & Post, Henk & Aardal, Karen, 2018. "Enhancing flexible transport services with demand-anticipatory insertion heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 110-121.
    23. Paquay, Célia & Crama, Yves & Pironet, Thierry, 2020. "Recovery management for a dial-a-ride system with real-time disruptions," European Journal of Operational Research, Elsevier, vol. 280(3), pages 953-969.
    24. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    3. 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.
    4. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    5. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.
    6. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
    7. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.
    8. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    9. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    10. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    12. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    13. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
    14. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    15. Zhang, Zhenzhen & Liu, Mengyang & Lim, Andrew, 2015. "A memetic algorithm for the patient transportation problem," Omega, Elsevier, vol. 54(C), pages 60-71.
    16. Su, Yue & Dupin, Nicolas & Puchinger, Jakob, 2023. "A deterministic annealing local search for the electric autonomous dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1091-1111.
    17. Jun, Sungbum & Lee, Seokcheon & Yih, Yuehwern, 2021. "Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1153-1168.
    18. Basma, Hussein & Mansour, Charbel & Haddad, Marc & Nemer, Maroun & Stabat, Pascal, 2023. "A novel method for co-optimizing battery sizing and charging strategy of battery electric bus fleets: An application to the city of Paris," Energy, Elsevier, vol. 285(C).
    19. Yunlin Guan & Yun Wang & Xuedong Yan & Haonan Guo & Yi Zhao, 2022. "The One E-Ticket Customized Bus Service Mode for Passengers with Multiple Trips and the Routing Problem," Sustainability, MDPI, vol. 14(4), pages 1-17, February.
    20. 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.

    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:energy:v:296:y:2024:i:c:s0360544224007710. 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.journals.elsevier.com/energy .

    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.