arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.11829math.OC
收藏

一类资源分配问题的约化

On a reduction for a class of resource allocation problems

Martijn H. H. Schoot Uiterkamp, Marco E. T. Gerards, Johann L. Hurink

摘要:

在资源分配问题(RAP)中,目标是将给定数量的资源分配给一组活动,同时使分配成本最小化,并可能满足对活动子集的分配约束。RAP及其扩展的大多数解决方案都允许每个活动有自己的费用函数。然而,在许多应用中,目标函数的结构通常对于每个活动是相同的,并且费用函数之间的差异在于不同的参数选择,例如,倍增因素。在这篇文章中,我们介绍了一类新的目标函数,捕获的目标发生在研究的应用程序。这些目标的特征在于取决于两个输入参数的费用函数的共享结构。我们表明,给定两个输入参数,存在一个解决方案的RAP是最佳的共享结构的任何选择。因此,这个问题减少到二次RAP,使得大量的解决方案和算法的后一个问题。我们显示了我们的减少结果的影响,在几个应用程序中,特别是,我们提高了最好的已知的最坏情况下的复杂性界的两个重要问题,在船舶路由和处理器调度从$O(n^2)$到$O(n \log n)$。

英文摘要:

In the resource allocation problem (RAP), the goal is to divide a given amount of resource over a set of activities while minimizing the cost of this allocation and possibly satisfying constraints on allocations to subsets of the activities. Most solution approaches for the RAP and its extensions allow each activity to have its own cost function. However, in many applications, often the structure of the objective function is the same for each activity and the difference between the cost functions lies in different parameter choices such as, e.g., the multiplicative factors. In this article, we introduce a new class of objective functions that captures the majority of the objectives occurring in studied applications. These objectives are characterized by a shared structure of the cost function depending on two input parameters. We show that, given the two input parameters, there exists a solution to the RAP that is optimal for any choice of the shared structure. As a consequence, this problem reduces to the quadratic RAP, making available the vast amount of solution approaches and algorithms for the latter problem. We show the impact of our reduction result on several applications and, in particular, we improve the best known worst-case complexity bound of two important problems in vessel routing and processor scheduling from $O(n^2)$ to $O(n \log n)$.

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

↑