The Nurse Scheduling Problem (NSP) is a complex NP-hard combinatorial optimization task that involves assigning nursing staff to shifts while satisfying operational constraints such as staffing requirements, labor regulations, and personal preferences. Efficient and equitable scheduling is essential for effective healthcare decision-making. This paper proposes a Quantum-Inspired Genetic Algorithm (QIGA) that integrates quantum computing concepts—such as quantum state encoding and dynamic probability amplitude adjustment—into a classical genetic algorithm framework to enhance solution quality and search efficiency. An adaptive parameter control mechanism guides the algorithm from exploration to exploitation. Experimental results on 12 NSP instances of varying difficulty show that QIGA outperforms a standard GA, achieving better fitness values in nine instances and reducing computational time across all cases.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Quantum-Inspired Genetic Algorithm for Efficient Decision Support in Nurse Scheduling

  • Shady Salama,
  • Alarith Uhde

摘要

The Nurse Scheduling Problem (NSP) is a complex NP-hard combinatorial optimization task that involves assigning nursing staff to shifts while satisfying operational constraints such as staffing requirements, labor regulations, and personal preferences. Efficient and equitable scheduling is essential for effective healthcare decision-making. This paper proposes a Quantum-Inspired Genetic Algorithm (QIGA) that integrates quantum computing concepts—such as quantum state encoding and dynamic probability amplitude adjustment—into a classical genetic algorithm framework to enhance solution quality and search efficiency. An adaptive parameter control mechanism guides the algorithm from exploration to exploitation. Experimental results on 12 NSP instances of varying difficulty show that QIGA outperforms a standard GA, achieving better fitness values in nine instances and reducing computational time across all cases.