Dynamic Ridesharing Matching of Shared Autonomous Vehicles as Connection to Metro

被引:0
|
作者
Huo Y.-Y. [1 ,2 ]
Zhang Y. [1 ]
Li X.-J. [3 ]
Chen G.-Q. [2 ]
机构
[1] Transportation Institute, Inner Mongolia University, Inner Mongolia, Hohhot
[2] School of Mathematical Sciences, Inner Mongolia University, Inner Mongolia, Hohhot
[3] College of Urban Rail Transit and Logistics, Beijing Union University, Beijing
基金
中国国家自然科学基金;
关键词
dynamic ridesharing matching; metro connection; path selection; shared autonomous vehicles; traffic engineering;
D O I
10.19721/j.cnki.1001-7372.2024.06.024
中图分类号
学科分类号
摘要
To integrate shared autonomous vehicles (SAV) with the metro, this study proposes the use of SAV as the connection of the metro's first mile (FM) and last mile (LM). A dynamic ridesharing matching system was constructed to clarify the framework and operating rules of SAV connected to the metro. The system inputs arc the road network data, SAV data (location, passenger status, etc.), and traveler data (origin, destination, etc.), and the outputs are the matching results and travel paths. Travel path and travel matching models were developed to realize the ridesharing matching function of the system. The travel path model considers the minimization of the detour time of travelers, which can output the travel path of any two travelers when ridesharing, and was used for the parameter calculation of the travel matching model. The travel matching model considers the traveler service quality and operator benefits as well as the joint optimization of SAV and metro schedules to obtain the optimal travel matching scheme, including the matching of travelers to SAV and travelers to travelers. The metro in Manhattan, New York was selected for a case study at four travel demand scales (2 160, 4 320, 6 480, and 8 640 trips • h_1). The results show that for FM and LM travels with travel demands of 2 160 and 4 320 trips • h_1, as well as for LM travel with a travel demand of 6 480 trips • h_1, the maximum mean waiting time for travelers is 1. 06 min; the maximum mean detour time for travelers is 1. 11 min; the maximum mean matching time for travelers is 46. 09 s; the maximum vehicle distance saved for the operator is 877. 24 km • h_1; the maximum matching rate is 61.67%; and the maximum mean solution time for the system is 2. 09 s. These results demonstrate the efficiency and stability of the system and model. © 2024 Chang'an University. All rights reserved.
引用
收藏
页码:288 / 301
页数:13
相关论文
共 30 条
  • [1] LI Huan-ping, City autopilot vehicle scheduling under car cloud scheme [D], (2015)
  • [2] NARAYANAN S, CHANIOTAKIS E, ANTONIOU C., Shared autonomous vehicle services
  • [3] A comprehensive review _J], Transportation Research Part C: Emerging Technologies, 111, pp. 255-293, (2020)
  • [4] BOSCH P M, CIARI F, AXHAUSEN K W., Transport policy optimization with autonomous vehicles [J], Transportation Research Record
  • [5] Journal of the Transportation Research Board, 2672, 8, pp. 698-707, (2018)
  • [6] SOTEROPOULOS A, BERGER M, CIARI F., Impacts of automated vehicles on travel behaviour and land use: An international review of modelling studies [J], Transport Reviews, 39, 1, pp. 29-49, (2019)
  • [7] PAKUSCH C, STEVENS G, BODEN A, Et al., Unintended effects of autonomous driving
  • [8] A study on mobility preferences in the future [J], Sustainahility, 10, 7, (2018)
  • [9] SHEN Y, ZHANG H M, ZHAO J H., Integrating shared autonomous vehicle in public transportation system
  • [10] A supply-side simulation of the first-mile service in Singapore [J], Transportation Research Part A: Policy and Practice, 113, pp. 125-136, (2018)