Improved Beluga Whale Optimization for Solving the Simulation Optimization Problems with Stochastic Constraints

• Published in: Mathematics (Basel) Vol. 11; no. 8; p. 1854
• Main Authors: Horng, Shih-Cheng, Lin, Shieh-Shing
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.04.2023
• Subjects: Algorithms; Approximation; average waiting time; beluga whale optimization; Constraint satisfaction; Constraints; Cost function; Costs; Design optimization; Dynamic programming; emergency department healthcare; Emergency medical care; Emulators; Heuristic; Heuristic methods; Mathematical optimization; Mathematics; Methods; optimal computational effort allocation; Optimization; ordinal optimization; polynomial chaos expansion; Polynomials; Simulation; Stochastic processes; Tests, problems and exercises; Workforce planning; Taiwan
• ISSN: 2227-7390; 2227-7390
• DOI: 10.3390/math11081854

Simulation optimization problems with stochastic constraints are optimization problems with deterministic cost functions subject to stochastic constraints. Solving the considered problem by traditional optimization approaches is time-consuming if the search space is large. In this work, an approach integration of beluga whale optimization and ordinal optimization is presented to resolve the considered problem in a relatively short time frame. The proposed approach is composed of three levels: emulator, diversification, and intensification. Firstly, the polynomial chaos expansion is treated as an emulator to evaluate a design. Secondly, the improved beluga whale optimization is proposed to seek N candidates from the whole search space. Eventually, the advanced optimal computational effort allocation is adopted to determine a superior design from the N candidates. The proposed approach is utilized to seek the optimal number of service providers for minimizing staffing costs while delivering a specific level of care in emergency department healthcare. A practical example of an emergency department with six cases is used to verify the proposed approach. The CPU time consumes less than one minute for six cases, which demonstrates that the proposed approach can meet the requirement of real-time application. In addition, the proposed approach is compared to five heuristic methods. Empirical tests indicate the efficiency and robustness of the proposed approach.