EUVIMEDEUVIMED entdecken
Open Access · CC BY-SA 4.0

A comparative analysis of classical and cooperative coevolutionary genetic algorithms for solving nurse scheduling problems

Maizatul Farhana Mohamad Nazri, Zeratul Izzah Mohd Yusoh, Halizah Basiron, Azlina Daud

International Journal of Advances in Intelligent Informatics · 31.08.2026 · 12 (3) · 963

DOI: 10.26555/ijain.v12i3.2409 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Advances in Intelligent Informatics, online erschienen am 31.08.2026. Verfasst von Maizatul Farhana Mohamad Nazri und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The Nurse Scheduling Problem (NSP) is a complex workforce planning task that involves assigning nurses to shifts while satisfying operational feasibility, legal regulations and preference-based quality requirements. Classical Genetic Algorithms (GA) are widely applied to NSP but rely on monolithic optimisation structures that evaluate all constraints within a single population, which can lead to constraint interference and reduced stability as problem realism increases. This study investigates a Cooperative Co-Evolutionary approach for NSP (Coop-NSP), which decomposes optimisation into two interacting subpopulations corresponding to hard and soft constraints. Both subpopulations employ an identical nurse-by-day chromosome representation and evolve independently under specialised objectives, with cooperation introduced through contextual fitness evaluation. Experiments were conducted on a weekly NSP with a seven-day planning horizon and multiple nurse roles, evaluated for 15,000 generations across 30 independent runs under identical parameter settings. The Classical GA achieved a mean best penalty of 651.30 ± 37.90, with a minimum best penalty of 581.7, while Coop-NSP obtained a higher mean best penalty of 768.72 but achieved a lower minimum best penalty of 507.64. The Classical GA exhibited rapid convergence, whereas Coop-NSP demonstrated stepwise convergence with sustained population diversity. Although Coop-NSP incurred higher computational cost, its structured cooperative optimisation framework provides a stable and extensible foundation for future integrated healthcare scheduling research.

Zitieren

APA

Nazri, M. F. M., Yusoh, Z. I. M., Basiron, H., & Daud, A. (2026). A comparative analysis of classical and cooperative coevolutionary genetic algorithms for solving nurse scheduling problems. International Journal of Advances in Intelligent Informatics, 12(3), 963. https://doi.org/10.26555/ijain.v12i3.2409

Vancouver

Nazri MFM, Yusoh ZIM, Basiron H, Daud A. A comparative analysis of classical and cooperative coevolutionary genetic algorithms for solving nurse scheduling problems. International Journal of Advances in Intelligent Informatics. 2026;12(3):963. doi:10.26555/ijain.v12i3.2409

BibTeX
@article{Nazri2026,
  author = {Nazri, Maizatul Farhana Mohamad and Yusoh, Zeratul Izzah Mohd and Basiron, Halizah and Daud, Azlina},
  title = {A comparative analysis of classical and cooperative coevolutionary genetic algorithms for solving nurse scheduling problems},
  journal = {International Journal of Advances in Intelligent Informatics},
  year = {2026},
  volume = {12},
  number = {3},
  pages = {963},
  doi = {10.26555/ijain.v12i3.2409}
}
Kostenlos starten →