Preliminary Review on Population Based Approaches for Physician Scheduling

摘要

Physician scheduling is an important scheduling in hospital and has been in researches for years. In the scheduling, a mathematical model is developed to represent personnel arrangement in a hospital. Afterward, we need algorithm to solve the mathematical model in which they can be exact or metaheuristic algorithm. Exact algorithm can provide a global optimum in the solution, however finding optimal solution for complex and vast number of constraints is time consuming since physician scheduling is NP-Hard problem. On the other hand, metaheuristic approach provides solution to the scheduling problems in much less time compared to exact algorithm. Therefore, metaheuristic approach is considered more appropriate to solve physician scheduling problem. In this paper, we conduct a preliminary review of the latest population bases approaches in hospital related scheduling, especially Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) based algorithms, to understand strengths and weaknesses of each algorithm and recommend the most suitable one applicable to solve physician scheduling problem. Future work will be suggested for further improvements on the algorithm.