In this paper, a new hybrid algorithm, GA-HIDMS-PSO, is introduced by hybridising the state-of-the-art particle swarm optimisation (PSO) variant, the heterogeneous improved dynamic multi-swarm PSO (HIDMS-PSO) with a genetic algorithm (GA). The new hybrid model exploits the heterogeneous features of HIDMS-PSO and the evolutionary characteristics of the GA. In the GA-HIDMS-PSO architecture, HIDMS-PSO acts as the primary search engine, and the GA is employed as the secondary method to assist and slow down the loss of diversity for selected proportions of homogeneous and heterogeneous subpopulations of the HIDMS-PSO algorithm. Both methods run consecutively. As the primary search method, HIDMS-PSO runs for longer periods compared with the GA. The HIDMS-PSO pro-vides the initial solutions for the GA from both homogeneous and heterogeneous subpopulations and final solutions returned from the GA replace prior solutions in the HIDMS-PSO which resumes the search process with potentially more diverse particles to guide the swarm. The GA-HIDMS-PSO algorithm’s performance was tested on the 30 and 50 dimensional CEC’05 and CEC’17 test suites. The results were compared with 24 algorithms, with 12 state-of-the-art PSO variants and 12 other metaheuristics. GA-HIDMS-PSO outperformed all 24 comparison algorithms on both test suites for both 30 and 50 dimensions.
History
Publication status
Published
File Version
Accepted version
Journal
Proceedings of IEEE Congress on Evolutionary Computation (CEC)