Trading off costs and service rates in a first-mile ride-sharing service
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Dokumenter
- Fulltext
Forlagets udgivne version, 2,17 MB, PDF-dokument
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.
Originalsprog | Engelsk |
---|---|
Artikelnummer | 104099 |
Tidsskrift | Transportation Research Part C: Emerging Technologies |
Vol/bind | 150 |
Antal sider | 23 |
ISSN | 0968-090X |
DOI | |
Status | Udgivet - 2023 |
Bibliografisk note
Publisher Copyright:
© 2023 Elsevier Ltd
ID: 359609970