Trading off costs and service rates in a first-mile ride-sharing service
Research output: Contribution to journal › Journal article › Research › peer-review
Documents
- Fulltext
Final published version, 2.17 MB, PDF document
Given a set of geographically dispersed vehicles, the first-mile ride-sharing problem seeks optimal routes to transport customers to a common destination (e.g., a transit station) via shared trips. In this article, we address the trade off between operating costs and service rates. The resulting multi-objective optimization problem is of a combinatorial nature. To obtain Pareto solutions we propose an evolutionary algorithm based on efficient non-dominated solution sorting. Extensive tests based on real-life data illustrate that the algorithm is able to find high-quality non-dominated fronts.
Original language | English |
---|---|
Article number | 104099 |
Journal | Transportation Research Part C: Emerging Technologies |
Volume | 150 |
Number of pages | 23 |
ISSN | 0968-090X |
DOIs | |
Publication status | Published - 2023 |
Bibliographical note
Publisher Copyright:
© 2023 Elsevier Ltd
- Constrained multi-objective optimization problem, Evolutionary algorithm, First-mile ride-sharing problem
Research areas
Number of downloads are based on statistics from Google Scholar and www.ku.dk
ID: 359609970