我们可以通过拼车服务多少乘客？
How Many Passengers Can We Serve with Ride-sharing?
摘要：
拼车可以减少交通拥堵，从而减少气体排放并节省出行时间。然而，由于出租率低，出行需求高等因素，目前具有乘车共享的交通系统效率低下。现有文献没有考虑在一次旅行中分组的多请求的共乘。本文首先提出了一种基于图的算法，该算法可以在多项式时间内得到一个近似解，然后提出了一种精确算法，该算法以最大化在$O(1.2312^{|\mathcal{E}|})$时间内服务的乘客数为目标来求解该问题。
英文摘要：
Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. However, transportation system with ride-sharing is currently inefficient due to low occupancy rate, high travel demand and some other factors. Existing literature did not consider ride-sharing with multi-request grouped in one trip. In our paper, we firstly proposed a graph-based algorithm that can obtain an approximation solution in polynomial time and then proposed an exact algorithm to solve this problem with maximizing the number of passenegers served in $O(1.2312^{|\mathcal{E}|})$ time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
