A Dynamic Sharing Mobility Model with Passengers'Sharing Probability
This paper aggregates sharing mobilityridesharing requests from passengers into sharing mobilitypooled ride-share tasks and constructs a request-task-vehicle graph. A multi-objective cost function is designed to solve the re-quest-task-vehicle graph and obtain the corresponding alloca-tion results of vehicles and requests. Using taxi mobility data in Jianghan District,Wuhan,China,the model is verified and explores three submodels with different parameters,which are the most comfortable travel with the shortest average sharing time,the most timely travel with the shortest average delay time,and the lowest carbon travel with the least total mile-age. The results show that ①regardless of the changes in car-pooling ridesharing willingness,compared to timely travel and eco-travel,comfortable travel can reduce 99％ of shared time;②as the carpooling ridesharing willingness increases from 0.1 to 1,the delay time of timely travel decreases by 5％ to 10％ compared to comfortable travel,and the total mileage of eco-travel can be reduced by 50 to 400 kilometers per day com-pared to comfortable travel. The experimental results can pro-vide a reference for the urban shared transportation scheme in the future intelligent transportation system,and improve the utilization efficiency of urban mobility resources.
NETL
NSTL
万方数据
