Multiplayer battle game-inspired optimizer for complex optimization problems

• Published in: Cluster computing 2024-09, Vol.27 (6), p.8307-8331
• Main Authors: Xu, Yuefeng, Zhong, Rui, Zhang, Chao, Yu, Jun
• Format: Article
• Language: English
• Subjects: Algorithms; Benchmarks; Computer Communication Networks; Computer Science; Convergence; Design engineering; Exploitation; Games; Heuristic methods; Linear programming; Operating Systems; Optimization algorithms; Optimization techniques; Performance evaluation; Processor Architectures; Researchers; Statistical analysis
• ISSN: 1386-7857; 1573-7543
• DOI: 10.1007/s10586-024-04448-w

Various popular multiplayer battle royale games share a lot of common elements. Drawing from our observations, we summarized these shared characteristics and subsequently proposed a novel heuristic algorithm named multiplayer battle game-inspired optimizer (MBGO). The proposed MBGO streamlines mainstream multiplayer battle royale games into two discrete phases: movement and battle. Specifically, the movement phase incorporates the principles of commonly encountered “safe zones” to incentivize participants to relocate to areas with a higher survival potential. The battle phase simulates a range of strategies players adopt in various situations to enhance the diversity of the population. To evaluate and analyze the performance of the proposed MBGO, we executed it alongside ten other algorithms, including three classics and five latest ones, across multiple diverse dimensions within the CEC2017 and CEC2020 benchmark functions. In addition, we employed several industrial design problems to evaluate the scalability and practicality of the proposed MBGO. The statistical analysis results reveal that the novel MBGO demonstrates significant competitiveness, excelling in convergence speed and achieving high levels of convergence accuracy across both benchmark functions and real-world problems.