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.

中文翻译：

---

在第一英里拼车服务中权衡成本和服务费率

给定一组地理上分散的车辆，第一英里拼车问题寻求通过共享行程将客户运送到共同目的地（例如，中转站）的最佳路线。在本文中，我们将解决运营成本和服务费率之间的权衡问题。由此产生的多目标优化问题具有组合性质。为了获得帕累托解，我们提出了一种基于高效非支配解排序的进化算法。基于现实生活数据的广泛测试表明该算法能够找到高质量的非支配前沿。