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

最大限度地提高在线拨号乘车的收入

Maximizing Revenues for Online-Dial-a-Ride

Ananya Christman, William Forcier

摘要:

在经典的Dial-a-Ride问题中,服务器在某个度量空间中移动以服务乘车请求。每个请求都有一个源、目的地和释放时间。我们研究这个问题的一个变体,其中每个请求也有一个收入,如果请求得到满足。我们的目标是在一定的时间限制内满足请求,从而使总收入最大化。我们首先证明了这个问题的版本,在输入图中的边有不同的权重是NP-完全的。我们还证明,没有算法可以竞争这个问题。因此,我们考虑的版本,在图中的边缘有单位的重量,并开发一个2-竞争力的算法,这个问题。

英文摘要:

In the classic Dial-a-Ride Problem, a server travels in some metric space to serve requests for rides. Each request has a source, destination, and release time. We study a variation of this problem where each request also has a revenue that is earned if the request is satisfied. The goal is to serve requests within a time limit such that the total revenue is maximized. We first prove that the version of this problem where edges in the input graph have varying weights is NP-complete. We also prove that no algorithm can be competitive for this problem. We therefore consider the version where edges in the graph have unit weight and develop a 2-competitive algorithm for this problem.

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

↑