arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.6210math.OCcs.DS
收藏

Min-Max公平车位分配问题的半分布式算法

A Semi Distributed Approach for Min-Max Fair Car-Parking Slot Assignment Problem

Elisabetta Alfonsetti, Pradeep Chathuranga Weeraddana, Carlo Fischione

摘要:

设计有效的停车机制,可以潜在地集成到未来的智能交通系统是至关重要的。通常,相关的设计问题是组合和最优解方法的最坏情况下的复杂性与问题的大小呈指数增长。因此,这样的最佳方法是不可扩展的并且实际上是不期望的。因此,几乎所有现有的停车位分配方法都是简单而贪婪的方法,其中每个汽车被分配一个更接近其目的地的空闲停车位。此外,没有强调在停车位分配期间优化用户的社会效益。本文以公平性作为衡量用户社会总效益的一个度量,提出了一种基于拉格朗日对偶理论的分布式算法。与最优方法相比,该算法具有良好的可扩展性。此外,它表明,建议的停车机制保留隐私的意义上说,任何汽车参与的算法将无法发现任何其他汽车的目的地在算法迭代。数值结果表明,该算法的性能相比,最优分配和贪婪的方法。他们表明,我们的算法产生了一个很好的实现级的简单性和性能之间的权衡。尽管本文的主要重点在于停车位分配问题,我们的配方和算法,在一般情况下,也可以应用或采用在公平的代理目标分配问题在其他应用领域。

英文摘要:

Designing efficient car parking mechanisms that can be potentially integrated into future intelligent transportation systems is of crucial importance. Usually, the related design problems are combinatorial and the worst-case complexity of optimal solution approaches grows exponentially with the problem sizes. Therefore, such optimal approaches are not scalable and practically undesirable. As a result, almost all existing methods for parking slot assignment are simple and greedy approaches, where each car is assigned a free parking slot, which is closer to its destination. Moreover, no emphasis is placed to optimize the social benefit of the users during the parking slot assignment. In this paper, the fairness as a metric for modeling the aggregate social benefit of the users is considered and a distributed algorithm based on Lagrange duality theory is developed. The proposed algorithm is gracefully scalable compared to the optimal methods. In addition, it is shown that the proposed car parking mechanism preserves privacy in the sense that any car involved in the algorithm will not be able to discover the destination of any other car during the algorithm iterations. Numerical results illustrate the performance of the proposed algorithm compared to the optimal assignment and a greedy method. They show that our algorithm yields a good tradeoff between the implementation-level simplicity and the performance. Even though the main emphasis in this paper resides in the car parking slot assignment problem, our formulation and the algorithms, in general, can also be applied or adopted in fair agent-target assignment problems in other application domains.

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

↑