Simulation for Dynamic Patients Scheduling based on Many Objective Optimization and Coordinator

Abstract

The Patient Admission Scheduling Problem (PASP) involves scheduling patient admissions, hospital time locations, to achieve certain quality of service and cost objectives, making it a multi-objective combinatorial optimization problem and NP-hard in nature. In addition, PASP is used in dynamic scenarios where patients are expected to arrive at the hospital sequentially, which requires dynamic optimization handling. Taking both aspects, optimization and dynamic utilization, we propose a simulation for dynamic patient scheduling based on multi-objective optimization, window, and coordinator. The role of multi-objective optimization deals with many soft constraints and providing a set of non-dominated solution coordinators. The role of the counter is to collect newly arrived patients and previously unconfirmed patients with the aim of passing them on to the coordinator. Finally, the role of the coordinator is to select a subset of patients from the window and pass them to the optimization algorithm. On the other hand, the coordinator is also responsible for those selected from the non-dominant solutions to activate it in the hospital and decide on unconfirmed employees to place them in the window for the next round. Simulator evaluation and comparison between several optimization algorithms show the superiority of NSGA-III in terms of set criticality and soft constraint values. Therefore, it treats PASP as a multi-objective dynamic optimization of a useful solution. NSGA-II is guaranteed 0.96 percent dominance over NSGA-II and 100 percent dominance of all other algorithms. Povzetek: Gre za dinamično razporejanje pacientov z uporabo večciljne optimizacije, ki obravnava kompleksni problem razporejanja sprejema pacientov v bolnišnico, izboljšuje kakovost storitev in učinkovitost z uporabo NSGA-II algoritma za optimizacijo.