TRE_HouLiZhang_Final.pdf (380.81 kB)
Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic
journal contribution
posted on 2018-07-24, 13:46 authored by Liwen Hou, Dong Li, Dali ZhangThis paper considers a ridesharing problem on how to match riders to drivers and how to choose the best routes for vehicles. Unlike the others in the literature, we are concerned with the maximization of the average loading ratio of the entire system. Moreover, we develop a flow-dependent version of the model to characterize the impact of pick-up and drop-off congestion. In another extended model we take into account the riders’ individual evaluation on different transportation modes. Due to the large size of the resulting models, we develop a large neighbourhood search algorithm and demonstrate its efficiency.
History
School
- Business and Economics
Department
- Business
Published in
Transportation Research Part E: Logistics and Transportation ReviewVolume
118Pages
143-162Citation
HOU, L., LI, D. and ZHANG, D., 2018. Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. Transportation Research Part E: Logistics and Transportation Review, 118, pp.143-162.Publisher
ElsevierVersion
- AM (Accepted Manuscript)
Publisher statement
This paper was accepted for publication in the journal Transportation Research Part E: Logistics and Transportation Review and the definitive published version is available at https://doi.org/10.1016/j.tre.2018.07.003Acceptance date
2018-07-10Publication date
2018-08-04ISSN
1366-5545Publisher version
Language
- en