Solving of constrained problems via multi-objective vortex search algorithm
Ahmet Özkış Gül Özcan Ahmet Babalik Mustafa Servet Kıran
AbstractIn this study, multi-objective vortex search algorithm (MOVS), a new multi-objective metaheuristic optimizer, has been used to solve 3 different constrained benchmark problems. The performance of the MOVS algorithm is compared with NSGA-II, is a well-known multi-objective evolutionary algorithm, on different performance metrics. Obtained metric results show that the MOVS is a promising algorithm for solving multi-objective benchmarks. This study encourages researchers working on constrained mathematical or real-world problems to use the MOVS algorithm.