Fleet Sizing for Reservation-Based Car-Sharing Services Allowing Cruise Parking

被引:3
作者
Guo, Ge [1 ,2 ]
Hou, Yuqin [3 ]
Sun, Tianyu [3 ]
机构
[1] Northeastern Univ, State Key Lab Synthet Automation Proc Ind, Shenyang 110819, Peoples R China
[2] Northeastern Univ Qinhuangdao, Sch Control Engn, Qinhuangdao 066004, Peoples R China
[3] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
基金
中国国家自然科学基金;
关键词
Servers; Automobiles; Queueing analysis; Space vehicles; Roads; Routing; Approximation algorithms; NETWORKS; SYSTEMS; QUEUES;
D O I
10.1109/MITS.2023.3263941
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Fleet sizing is an important problem in the planning procedure of one-way car-sharing systems. This article investigates the fleet-sizing problem for reservation-based car-sharing systems allowing cruise parking. The system with traffic congestion is modeled as a mixed queuing network with its servers mapping the remaining road capacity. The optimal fleet size with maximum operating profit is derived, taking into account asymptotic performance metrics like reservation, vehicle availability and utilization, and occupancy of parking spaces of each of the stations. The solution is obtained based on an exact mean value analysis (MVA) algorithm and an approximate Schweitzer-Bard MVA (SB-MVA) algorithm. Numerical experiments demonstrate that the proposed method with cruise parking can meet the travel demands with greatly reduced operating cost. Another interesting finding is that a larger reservation time window implies lower parking capacity and smaller fleet size, whereas, as the time window exceeds a threshold, reducing the fleet size may damage the quality of service.
引用
收藏
页码:106 / 120
页数:15
相关论文
共 26 条