.png){kind=icon}
.png){kind=icon}
Return
A Q-learning based artificial bee colony algorithm for solving surgery scheduling problems with setup time
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101686.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the increasing demand for surgeries, surgery scheduling become an important problem in hospital management. Efficient surgery scheduling can enhance the optimal use of surgical resources, leading to high efficiency of surgery assignments. This work addresses surgery scheduling problems with surgical resources setup time. A mathematical model is established to describe the considered problems with the objective of minimizing the maximum completion time of the surgeries (makespan). Second, a modified artificial bee colony (ABC) algorithm is proposed, named QABC. Six local search operators are developed based on the characteristics of the problem, aiming to strengthen the local search capability of the algorithm. To further improve the performance of the algorithm, this study combines a Q-learning strategy with ABC algorithm. During each iteration of the algorithm, the Q-learning strategy is employed to guide the selection of search operators. Finally, the effectiveness of the local search operators and Q-learning based local search selection is verified by solving 20 cases with varying scales. And the results obtained by the Gurobi solver are compared with the proposed QABC. Furthermore, the proposed QABC is compared with the state-of-the-art algorithms. The experimental results and comparisons show that QABC is more effective than its peers for solving the surgery scheduling problems with setup time.
Keywords:
Surgery scheduling
Q-learning
Artificial bee colony
Makespan
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W
View more organizations