EUVIMEDEUVIMED entdecken
Crossref

Scheduling Multiobjective Dynamic Surgery Problems via Q -Learning-Based Meta-Heuristics

Hui Yu, Kaizhou Gao, Naiqi Wu, MengChu Zhou, Ponnuthurai N. Suganthan, Shouguang Wang

IEEE Transactions on Systems, Man, and Cybernetics: Systems · 2024-06 · 54 (6) · 3321-3333

DOI: 10.1109/tsmc.2024.3352522 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2024-06. Verfasst von Hui Yu und 5 weiteren Autor:innen. Die Arbeit wurde bisher 67-mal zitiert (Crossref) und nennt 69 Literaturangaben. Gefördert von: Science and Technology Development Fund (FDCT), Macau, SAR, National Natural Science Foundation of China, Zhuhai Industry-University-Research Project With Hongkong and Macao.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This work addresses multiobjective dynamic surgery scheduling problems with considering uncertain setup time and processing time. When dealing with them, researchers have to consider rescheduling due to the arrivals of urgent patients. The goals are to minimize the fuzzy total medical cost, fuzzy maximum completion time, and maximize average patient satisfaction. First, we develop a mathematical model for describing the addressed problems. The uncertain time is expressed by triangular fuzzy numbers. Then, four meta-heuristics are improved, and eight variants are developed, including artificial bee colony, genetic algorithm, teaching-learning-base optimization, and imperialist competitive algorithm. For improving initial solutions’ quality, two initialization strategies are developed. Six local search strategies are proposed for fine exploitation and a$Q$-learning algorithm is used to choose the suitable strategies among them in the iterative process of the meta-heuristics. The states and actions of$Q$-learning are defined according to the characteristic of the addressed problems. Finally, the proposed algorithms are tested for 57 instances with different scales. The analysis and discussions verify that the improved artificial bee colony with$Q$-learning is the most competitive one for scheduling the dynamic surgery problems among all compared algorithms.

Förderung

  • Science and Technology Development Fund (FDCT), Macau, SAR
  • National Natural Science Foundation of China
  • Zhuhai Industry-University-Research Project With Hongkong and Macao
  • Basic and Applied Basic Research Foundation of Guangdong Province
  • Key Technologies for Scheduling and Optimization of Complex Distributed Manufacturing Systems

Zitieren

APA

Yu, H., Gao, K., Wu, N., Zhou, M., Suganthan, P. N., & Wang, S. (2024). Scheduling Multiobjective Dynamic Surgery Problems via Q -Learning-Based Meta-Heuristics. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 54(6), 3321-3333. https://doi.org/10.1109/tsmc.2024.3352522

Vancouver

Yu H, Gao K, Wu N, Zhou M, Suganthan PN, Wang S. Scheduling Multiobjective Dynamic Surgery Problems via Q -Learning-Based Meta-Heuristics. IEEE Transactions on Systems, Man, and Cybernetics: Systems. 2024;54(6):3321-3333. doi:10.1109/tsmc.2024.3352522

BibTeX
@article{Yu2024,
  author = {Yu, Hui and Gao, Kaizhou and Wu, Naiqi and Zhou, MengChu and Suganthan, Ponnuthurai N. and Wang, Shouguang},
  title = {Scheduling Multiobjective Dynamic Surgery Problems via Q -Learning-Based Meta-Heuristics},
  journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
  year = {2024},
  volume = {54},
  number = {6},
  pages = {3321--3333},
  doi = {10.1109/tsmc.2024.3352522}
}
Kostenlos starten →