Article,
Trading off costs and service rates in a first-mile ride-sharing service
Affiliations
- [1] University of Copenhagen [NORA names: KU University of Copenhagen; University; Denmark; Europe, EU; Nordic; OECD]
Abstract
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.
Keywords
Pareto solutions,
algorithm,
combinatorial nature,
cost,
customers,
data,
destination,
evolutionary algorithm,
front,
multi-objective optimization problem,
nature,
non-dominated fronts,
operating costs,
optimal route,
optimization problem,
problem,
rate,
real-life data,
ride-sharing problem,
ride-sharing services,
route,
service rate,
services,
solution,
solution sorting,
sorting,
trade,
transport customers,
trips,
vehicle