将实体分配给团队作为一个超图发现问题
Assigning Entities to Teams as a Hypergraph Discovery Problem
AI总结:
本研究将团队实体分配视为超图发现问题,提出基于边依赖顶点加权超图拉普拉斯代数连通性优化的带约束模拟退火团队分配算法,经评估其解的鲁棒性优于原始数据与贪心方法,为相关领域提供新研究思路。
摘要:
我们提出了一种基于超图方法的团队分配算法,该算法聚焦于韧性和扩散优化。具体而言,我们的方法基于对边依赖顶点加权超图的拉普拉斯矩阵的代数连通性进行优化。我们采用了带约束的模拟退火算法,其中约束了智能体执行任务可付出的努力量,以及任务完成所需的最低努力量。我们从将解驱动到可行域所需的不成功修补次数,以及修补成本两个方面评估了我们的方法。结果表明,我们的公式化方法相比原始数据和贪心方法能提供更鲁棒的解。我们希望该方法能推动超图在不同研究领域同类问题中的应用研究,以及对我们方法变体的探索。
英文摘要:
We propose a team assignment algorithm based on a hypergraph approach focusing on resilience and diffusion optimization. Specifically, our method is based on optimizing the algebraic connectivity of the Laplacian matrix of an edge-dependent vertex-weighted hypergraph. We used constrained simulated annealing, where we constrained the effort agents can exert to perform a task and the minimum effort a task requires to be completed. We evaluated our methods in terms of the number of unsuccessful patches to drive our solution into the feasible region and the cost of patching. We showed that our formulation provides more robust solutions than the original data and the greedy approach. We hope that our methods motivate further research in applying hypergraphs to similar problems in different research areas and in exploring variations of our methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。