个人车辆的近似共乘问题
Approximate Ridesharing of Personal Vehicles Problem
摘要:
共乘问题是给定一组行程,每个行程由个人、个人的车辆和一些要求组成,选择行程的子集,并使用所选行程的车辆将所有个人运送到满足要求的目的地。行程的要求由包括源、目的地、车辆容量、驾驶员的优选路径、驾驶员愿意进行的绕行距离和停靠次数以及时间限制的参数指定。分析了两个优化问题的时间复杂度与参数之间的关系:最小化被选车辆数和最小化车辆总行驶距离。我们考虑以下条件:(1)所有行程具有相同的源或相同的目的地,(2)不允许绕行,(3)每个参与者都有一条首选路径,(4)对停靠站的数量没有限制,以及(5)所有行程具有相同的出发时间和相同的到达时间。已知如果条件(1)、(2)和(3)中的一个不满足,则这两个极小化问题都是NP难的。我们证明了这两个问题都是NP-困难的,并进一步证明了如果条件(4)或(5)不满足,则在一个常数因子内逼近这两个问题是NP-困难的。当条件(4)不满足时,我们给出了最小化选择车辆数的$\frac{K+2}{2}$ -近似算法,其中$K$是所有车辆中最大的容量。
英文摘要:
The ridesharing problem is that given a set of trips, each trip consists of an individual, a vehicle of the individual and some requirements, select a subset of trips and use the vehicles of selected trips to deliver all individuals to their destinations satisfying the requirements. Requirements of trips are specified by parameters including source, destination, vehicle capacity, preferred paths of a driver, detour distance and number of stops a driver is willing to make, and time constraints. We analyze the relations between the time complexity and parameters for two optimization problems: minimizing the number of selected vehicles and minimizing total travel distance of the vehicles. We consider the following conditions: (1) all trips have the same source or same destination, (2) no detour is allowed, (3) each participant has one preferred path, (4) no limit on the number of stops, and (5) all trips have the same departure and same arrival time. It is known that both minimization problems are NP-hard if one of Conditions (1), (2) and (3) is not satisfied. We prove that both problems are NP-hard and further show that it is NP-hard to approximate both problems within a constant factor if Conditions (4) or (5) is not satisfied. We give $\frac{K+2}{2}$-approximation algorithms for minimizing the number of selected vehicles when condition (4) is not satisfied, where $K$ is the largest capacity of all vehicles.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。