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

Links

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

Published

Standard

Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. / Hou, Liwen; Li, Dong; Zhang, Dali.
In: Transportation Research Part E: Logistics and Transportation Review, Vol. 118, 31.10.2018, p. 143-162.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Hou, L, Li, D & Zhang, D 2018, 'Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic', Transportation Research Part E: Logistics and Transportation Review, vol. 118, pp. 143-162. https://doi.org/10.1016/j.tre.2018.07.003

APA

Hou, L., Li, D., & Zhang, D. (2018). Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. Transportation Research Part E: Logistics and Transportation Review, 118, 143-162. https://doi.org/10.1016/j.tre.2018.07.003

Vancouver

Hou L, Li D, Zhang D. Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. Transportation Research Part E: Logistics and Transportation Review. 2018 Oct 31;118:143-162. Epub 2018 Aug 4. doi: 10.1016/j.tre.2018.07.003

Author

Hou, Liwen ; Li, Dong ; Zhang, Dali. / Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. In: Transportation Research Part E: Logistics and Transportation Review. 2018 ; Vol. 118. pp. 143-162.

Bibtex

@article{79a0ca61be7e46198479bb10143f7d32,
title = "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic",
abstract = "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{\textquoteright} 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.",
author = "Liwen Hou and Dong Li and Dali Zhang",
year = "2018",
month = oct,
day = "31",
doi = "10.1016/j.tre.2018.07.003",
language = "English",
volume = "118",
pages = "143--162",
journal = "Transportation Research Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",

}

RIS

TY - JOUR

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

AU - Hou, Liwen

AU - Li, Dong

AU - Zhang, Dali

PY - 2018/10/31

Y1 - 2018/10/31

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

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

U2 - 10.1016/j.tre.2018.07.003

DO - 10.1016/j.tre.2018.07.003

M3 - Journal article

VL - 118

SP - 143

EP - 162

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

SN - 1366-5545

ER -