arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.3953cs.DS
收藏

两个带单位时间窗的多车辆路径问题

Two Multivehicle Routing Problems with Unit-Time Windows

Greg N. Frederickson, Barry Wittman

摘要:

两个多车辆路由问题被认为是在框架内,访问一个位置必须发生在一个特定的时间窗口,以计数和所有的时间窗口是相同的长度。在第一个问题中,目标是使用固定数量的车辆访问尽可能多的地点。第二个目标是使用尽可能少的车辆访问所有地点。对于第一个问题,我们提出了一个近似算法,其输出路径收集的奖励在一个恒定的因素,最佳的任何固定数量的车辆。对于第二个问题,我们的算法在树度量上找到了问题的6-近似值,只要一辆车可以在其时间窗口内访问所有位置。

英文摘要:

Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to visit as many locations as possible using a fixed number of vehicles. In the second, the goal is to visit all locations using the smallest number of vehicles possible. For the first problem, we present an approximation algorithm whose output path collects a reward within a constant factor of optimal for any fixed number of vehicles. For the second problem, our algorithm finds a 6-approximation to the problem on a tree metric, whenever a single vehicle could visit all locations during their time windows.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑