arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.02856cs.AIcs.LG
收藏

时间约束指派问题的强化学习

Reinforcement Learning for Assignment Problem with Time Constraints

University of Georgia(佐治亚大学)

Sharmin Pathan, Vyom Shrivastava

摘要:

我们提出了一个端到端的框架分配问题的多个任务映射到一组工人,使用强化学习,同时保留许多约束。任务和工作者都有时间限制,并且将工作者分配给任务会产生成本。每个工作者可以执行多个任务,直到耗尽其允许的时间单位(容量)。我们训练一个强化学习代理,通过最小化与分配相关的总成本,同时保持硬约束,找到接近最优的解决方案的问题。我们使用近端策略优化来优化模型参数。该模型实时生成一系列动作,这些动作对应于工人的任务分配,而不必针对环境动态状态的变化进行重新训练。在我们的问题设置中,奖励被计算为分配成本的负数。我们还展示了我们的结果装箱和容量限制的车辆路径问题,使用相同的框架。在解决方案质量和计算时间方面,我们的结果优于使用MIP和CP-SAT求解器的Google OR工具。

英文摘要:

We present an end-to-end framework for the Assignment Problem with multiple tasks mapped to a group of workers, using reinforcement learning while preserving many constraints. Tasks and workers have time constraints and there is a cost associated with assigning a worker to a task. Each worker can perform multiple tasks until it exhausts its allowed time units (capacity). We train a reinforcement learning agent to find near optimal solutions to the problem by minimizing total cost associated with the assignments while maintaining hard constraints. We use proximal policy optimization to optimize model parameters. The model generates a sequence of actions in real-time which correspond to task assignment to workers, without having to retrain for changes in the dynamic state of the environment. In our problem setting reward is computed as negative of the assignment cost. We also demonstrate our results on bin packing and capacitated vehicle routing problem, using the same framework. Our results outperform Google OR-Tools using MIP and CP-SAT solvers with large problem instances, in terms of solution quality and computation time.

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

↑