arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.05875cs.AImath.OC
收藏

超越人工规划:大型组织的座位分配

Beyond Manual Planning: Seating Allocation for Large Organizations

Anton Ipsen, Michael Cashmore, Kirsty Fielding, Nicolas Marchesotti, Parisa Zehtabi, Daniele Magazzeni, Manuela Veloso

AI总结:

本文提出了一种端到端框架,利用概率道路图和快速探索随机树结合启发式搜索和动态规划,解决大型组织的分层座位分配问题,以提高座位安排的效率和优化程度。

摘要:

我们引入了分层座位分配问题(HSAP),该问题旨在对具有层次结构的组织团队进行最优分配,以物理布局上的座位安排。这个问题由大型组织需要确保具有紧密层次关系的团队被安排在彼此附近的需求驱动,例如确保一个研究小组占据连续区域。目前,这个问题是通过手动管理来解决的,导致重新规划的频率低且效果不佳。为了缓解这一手动过程,我们提出了一种端到端的框架来解决HSAP。一种可扩展的方法用于计算任意一对座位之间的距离,使用概率道路图(PRM)和快速探索随机树(RRT),并结合启发式搜索和动态规划方法,通过整数规划解决HSAP。我们通过评估PRM框架和随后的分配在定量和定性上展示了我们的方法在不同规模的实例中的表现。

英文摘要:

We introduce the Hierarchical Seating Allocation Problem (HSAP) which addresses the optimal assignment of hierarchically structured organizational teams to physical seating arrangements on a floor plan. This problem is driven by the necessity for large organizations with large hierarchies to ensure that teams with close hierarchical relationships are seated in proximity to one another, such as ensuring a research group occupies a contiguous area. Currently, this problem is managed manually leading to infrequent and suboptimal replanning efforts. To alleviate this manual process, we propose an end-to-end framework to solve the HSAP. A scalable approach to calculate the distance between any pair of seats using a probabilistic road map (PRM) and rapidly-exploring random trees (RRT) which is combined with heuristic search and dynamic programming approach to solve the HSAP using integer programming. We demonstrate our approach under different sized instances by evaluating the PRM framework and subsequent allocations both quantitatively and qualitatively.

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

↑