.png){kind=icon}
返回
Multi-agent deep Q-network-based metaheuristic algorithm for Nurse Rostering Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2024.101547.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Nurse Rostering Problem (NRP) aims to create an efficient and fair work schedule that balances both the needs of employees and the requirements of hospital operations. Traditional local search-based metaheuristic algorithms, such as adaptive neighborhood search (ANS) and variable neighborhood descent (VND), mainly focus on optimizing the current solution without considering potential long-term consequences, which may easily get stuck in local optima and limit the overall performance. Thus, we propose a multi-agent deep Qnetwork-based metaheuristic algorithm (MDQN-MA) for NRP to harness the strengths of various metaheuristics. Each agent encapsulates a metaheuristic algorithm, where its available actions represent different perspectives of the problem environment. By combining their strengths and various perspectives, these agents can work collaboratively to navigate and search for a broader range of potential solutions effectively. Furthermore, to improve the performance of an individual agent, we model its neighborhood search as a Markov Decision Process model and integrate a deep Q-network to consider long-term impacts for its neighborhood sequential decision-making. The experimental results clearly show that an individual agent in MDQN-MA can outperform ANS and VND, and multiple agents in MDQN-MA even perform better, achieving the best results among metaheuristic algorithms on the Second International Nurse Rostering Competition dataset.
Keyword:
Multi-agent
Deep Q-network
Metaheuristic
Nurse Rostering Problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem一种基于强化学习的异构车辆路径问题超启发式算法
PREAI
分享收藏
查看更多内容