Affiliations: Research Center of Risk Management and Emergency Decision Making, School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing, China
Abstract: Multi-verse optimizer (MVO) is a novel nature-inspired algorithm that has been applied to solve many practical optimization problems. Nevertheless, the original MVO has problems of low convergence speed and accuracy of final solutions. Besides, the failure to strike a balance between exploration and exploitation and the easiness of falling into local optimum in the early stages makes MVO hard to converge. In this paper, we propose a novel hybrid algorithm called Hybrid Queuing Search algorithm with MVO (HQS-MVO) by introducing Queuing Search Algorithm (QSA) and Metropolis rule to overcome these shortcomings. The introduction of QSA is to improve the accuracy of final solutions. At the same time, the Metropolis rule is employed to prevent the algorithm from falling into the local optimum, thus improving the convergence speed of the original MVO. Then, we compare the performance of HQS-MVO on 30 benchmark functions of CEC2014 and 10 benchmark functions of CEC2019 with the other four related algorithms and three latest algorithms. The results show that HQS-MVO has the most accurate solutions in most cases compared with other seven algorithms in most cases, and gains the lowest standard deviations. Moreover, we make convergence curve of the eight algorithms. Compared with other algorithms, HQS-MVO shows outstanding performances and converge faster in general. Finally, we apply the proposed algorithm in a real engineering optimization problem and compare its performance with other algorithms, the results show that HQS-MVO is still the best one in problem of designing of gear train.
