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

Real-time scheduling and routing of shared autonomous vehicles considering platooning in intermittent segregated lanes and priority at intersections in urban corridors

Author

Listed:
  • Wang, Zhimian
  • An, Kun
  • Correia, Gonçalo
  • Ma, Wanjing

Abstract

Anticipating the forthcoming integration of shared autonomous vehicles (SAVs) into urban networks, the imperative of devising an efficient real-time scheduling and routing strategy for these vehicles becomes evident if one is to maximize their potential in enhancing travel efficiency. In this study, we address the problem of jointly scheduling and routing SAVs across an urban network with the possibility of platooning the vehicles at intersections to reduce their travel time. We argue that this is especially useful in large urban areas. We introduce a novel vehicle scheduling and routing method that allows a specific number of SAVs to converge at the intersections of urban corridors within designated time intervals, facilitating the formation of SAV platoons. Dedicated lanes and signal priority control are activated to ensure that these platoons go through the corridors efficiently. Based on the above concept, we propose a linear integer programming model to minimize the total travel time of SAVs and the delays experienced by the conventional vehicles due to SAV priority, thereby optimizing the overall performance of the road network. For large instances, we develop a two-stage heuristic algorithm to solve it faster. In the first stage, leveraging an evaluation index that manifests the compatibility of each vehicle-to-request combination, we allocate passenger requests to a fleet of SAVs. In the second stage, a customized genetic algorithm is designed to coordinate the paths of various SAVs, thus achieving the desired vehicle platooning effect. The optimization method is tested on a real-world road network in Shanghai, China. The results display a remarkable reduction of 15.76 % in the total travel time of the SAVs that formed platoons. The overall performance of the road network could be improved with the total travel time increase of conventional vehicles significantly smaller than the reduction observed in SAVs’ total travel time.

Suggested Citation

  • Wang, Zhimian & An, Kun & Correia, Gonçalo & Ma, Wanjing, 2024. "Real-time scheduling and routing of shared autonomous vehicles considering platooning in intermittent segregated lanes and priority at intersections in urban corridors," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
  • Handle: RePEc:eee:transe:v:186:y:2024:i:c:s1366554524001376
    DOI: 10.1016/j.tre.2024.103546
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2024.103546?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. 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.
    2. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    3. Cokyasar, Taner & Larson, Jeffrey, 2020. "Optimal assignment for the single-household shared autonomous vehicle problem," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 98-115.
    4. Rey, David & Levin, Michael W., 2019. "Blue phase: Optimal network traffic control for legacy and autonomous vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 130(C), pages 105-129.
    5. Levin, Michael W. & Boyles, Stephen D. & Patel, Rahul, 2016. "Paradoxes of reservation-based intersection controls in traffic networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 90(C), pages 14-25.
    6. Anderson, Paul & Daganzo, Carlos F., 2020. "Effect of transit signal priority on bus service reliability," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 2-14.
    7. Quentin K. Wan & Hong K. Lo, 2009. "Congested multimodal transit network design," Public Transport, Springer, vol. 1(3), pages 233-251, August.
    8. Ghiasi, Amir & Hussain, Omar & Qian, Zhen (Sean) & Li, Xiaopeng, 2017. "A mixed traffic capacity analysis and lane management model for connected automated vehicles: A Markov chain method," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 266-292.
    9. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    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. Wang, Hua & Meng, Qiang & Chen, Shukai & Zhang, Xiaoning, 2021. "Competitive and cooperative behaviour analysis of connected and autonomous vehicles across unsignalised intersections: A game-theoretic approach," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 322-346.
    2. Zhang, Li & Liu, Zhongshan & Yu, Bin & Long, Jiancheng, 2024. "A ridesharing routing problem for airport riders with electric vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    3. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    4. Amir Saeed Nikkhah Qamsari & Seyyed-Mahdi Hosseini-Motlagh & Seyed Farid Ghannadpour, 2022. "A column generation approach for an inventory routing problem with fuzzy time windows," Operational Research, Springer, vol. 22(2), pages 1157-1207, April.
    5. Yuanyuan Wu & Feng Zhu, 2021. "Junction Management for Connected and Automated Vehicles: Intersection or Roundabout?," Sustainability, MDPI, vol. 13(16), pages 1-18, August.
    6. Cui, Shaohua & Ma, Xiaolei & Zhang, Mingheng & Yu, Bin & Yao, Baozhen, 2022. "The parallel mobile charging service for free-floating shared electric vehicle clusters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    7. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    8. Yu, Vincent F. & Jodiawan, Panca & Redi, A.A.N. Perwira, 2022. "Crowd-shipping problem with time windows, transshipment nodes, and delivery options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    9. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    10. Kassens-Noor, Eva & Dake, Dana & Decaminada, Travis & Kotval-K, Zeenat & Qu, Teresa & Wilson, Mark & Pentland, Brian, 2020. "Sociomobility of the 21st century: Autonomous vehicles, planning, and the future city," Transport Policy, Elsevier, vol. 99(C), pages 329-335.
    11. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2022. "Fleet sizing and routing of healthcare automated guided vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    12. Lin, Na & Akkerman, Renzo & Kanellopoulos, Argyris & Hu, Xiangpei & Wang, Xuping & Ruan, Junhu, 2023. "Vehicle routing with heterogeneous service types: Optimizing post-harvest preprocessing operations for fruits and vegetables in short food supply chains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    13. Huang, Baobin & Tang, Lixin & Baldacci, Roberto & Wang, Gongshu & Sun, Defeng, 2023. "A metaheuristic algorithm for a locomotive routing problem arising in the steel industry," European Journal of Operational Research, Elsevier, vol. 308(1), pages 385-399.
    14. 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.
    15. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    16. Sun, Xuting & Fang, Minghao & Guo, Shu & Hu, Yue, 2024. "UAV-rider coordinated dispatching for the on-demand delivery service provider," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    17. Liu, Chuanju & Zhang, Junlong & Lin, Shaochong & Shen, Zuo-Jun Max, 2023. "Service network design with consistent multiple trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    18. Si, Jinhua & He, Fang & Lin, Xi & Tang, Xindi, 2024. "Vehicle dispatching and routing of on-demand intercity ride-pooling services: A multi-agent hierarchical reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    19. Zhen, Lu & Baldacci, Roberto & Tan, Zheyi & Wang, Shuaian & Lyu, Junyan, 2022. "Scheduling heterogeneous delivery tasks on a mixed logistics platform," European Journal of Operational Research, Elsevier, vol. 298(2), pages 680-698.
    20. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.

    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:transe:v:186:y:2024:i:c:s1366554524001376. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.