Heterogeneous differential evolution particle swarm optimization with local search

To develop a high performance and widely applicable particle swarm optimization (PSO) algorithm, a heterogeneous differential evolution particle swarm optimization (HeDE-PSO) is proposed in this study. HeDE-PSO adopts two differential evolution (DE) mutants to construct different characteristics of learning exemplars for PSO, one DE mutant is for enhancing exploration and the other is for enhance exploitation. To further improve search accuracy in the late stage of optimization, the BFGS (Broyden–Fletcher–Goldfarb–Shanno) local search is employed. To assess the performance of HeDE-PSO, it is tested on the CEC2017 test suite and the industrial refrigeration system design problem. The test results are compared with seven recent PSO algorithms, JADE (adaptive differential evolution with optional external archive) and four meta-heuristics. The comparison results show that with two DE mutants to construct learning exemplars, HeDE-PSO can balance exploration and exploitation and obtains strong adaptability on different kinds of optimization problems. On 10-dimensional functions and 30-dimensional functions, HeDE-PSO is only outperformed by the most competitive PSO algorithm on seven and six functions, respectively. HeDE-PSO obtains the best performance on sixteen 10-dimensional functions and seventeen-30 dimensional functions. Moreover, HeDE-PSO outperforms other compared PSO algorithms on the industrial refrigeration system design problem.