Operating Room Scheduling by Using Hybrid Genetic Algorithm

Abstract

Hospitals are among the most important institutions of today. For hospitals, efficient use of operating rooms is of great importance. Efficient use of operating rooms is a problem that needs to be solved. The operating room scheduling problem is a very complex problem with large number of constraints. This type of problem called as NP-Hard type problem. NP-Hard type problems do not consist of polynomial values. Therefore, the solution of these problems is very complex and difficult. Solutions consisting of polynomial values can be solved effectively with existing mathematical methods. However, more effective algorithms were needed to solve NP-hard type problems. As a result of the studies, many heuristic, meta-heuristic algorithms such as Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Taboo Search Algorithm have been developed to solve the complexity of NP-Hard problems. In this article, the operating room scheduling problem solved with a hybrid genetic algorithm. In this solution, it shows how the algorithm affects the solution area in the changes in the number of surgeons, operating rooms and operating room reservations, which are among the operating room parameters. In the developed software, C# programming language has been preferred in order to provide comfortable use of the end user.

Keywords

• ameliyat odası çizelgeleme
• genetik algoritma
• tamir operatörü
• kısıtlı optimizasyon
• operating room scheduling
• genetic algorithm
• repair operator
• constrained optimization