Home > Research > Publications & Outputs > Ride-matching and routing optimisation: Models ...


Text available via DOI:

View graph of relations

Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>31/10/2018
<mark>Journal</mark>Transportation Research Part E: Logistics and Transportation Review
Number of pages20
Pages (from-to)143-162
Publication StatusPublished
Early online date4/08/18
<mark>Original language</mark>English


This 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.