Simulation for dynamic patients scheduling based on many objective optimization and coordinator

Mahmed, Ali Nader and Mohd Nizam, Mohmad Kahar (2024) Simulation for dynamic patients scheduling based on many objective optimization and coordinator. Informatica (Slovenia), 48 (1). pp. 91-106. ISSN 0350-5596. (Published)

[img]
Preview
Pdf
Simulation for dynamic patients scheduling based on many objective.pdf
Available under License Creative Commons Attribution.

Download (909kB) | Preview

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.

Item Type: Article
Additional Information: Indexed by Scopus
Uncontrolled Keywords: Dynamic; Hospital admission and scheduling; Many objective optimizations; Multi-objective optimization; Non-dominated optimization; Patients' admission scheduling
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
Faculty/Division: Institute of Postgraduate Studies
Faculty of Computing
Depositing User: Mr Muhamad Firdaus Janih@Jaini
Date Deposited: 28 May 2024 08:12
Last Modified: 28 May 2024 08:12
URI: http://umpir.ump.edu.my/id/eprint/40973
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item