A PSO based approach: Scout particle swarm algorithm for continuous global optimization problems

Abstract

Abstract In the literature, most studies focus on designing new methods inspired by biological processes, however hybridization of methods and hybridization way should be examined carefully to generate more suitable optimization methods. In this study, we handle Particle Swarm Optimization (PSO) and an efficient operator of Artificial Bee Colony Optimization (ABC) to design an efficient technique for continuous function optimization. In PSO, velocity and position concepts guide particles to achieve convergence. At this point, variable and stable parameters are ineffective for regenerating awkward particles that cannot improve their personal best position (Pbest). Thus, the need for external intervention is inevitable once a useful particle becomes an awkward one. In ABC, the scout bee phase acts as external intervention by sustaining the resurgence of incapable individuals. With the addition of a scout bee phase to standard PSO, Scout Particle Swarm Optimization (ScPSO) is formed which eliminates the most important handicap of PSO. Consequently, a robust optimization algorithm is obtained. ScPSO is tested on constrained optimization problems and optimum parameter values are obtained for the general use of ScPSO. To evaluate the performance, ScPSO is compared with Genetic Algorithm (GA), with variants of the PSO and ABC methods, and with hybrid approaches based on PSO and ABC algorithms on numerical function optimization. As seen in the results, ScPSO results in better optimal solutions than other approaches. In addition, its convergence is superior to a basic optimization method, to the variants of PSO and ABC algorithms, and to the hybrid approaches on different numerical benchmark functions. According to the results, the Total Statistical Success (TSS) value of ScPSO ranks first (5) in comparison with PSO variants; the second best TSS (2) belongs to CLPSO and SP-PSO techniques. In a comparison with ABC variants, the best TSS value (6) is obtained by ScPSO, while TSS of BitABC is 2. In comparison with hybrid techniques, ScPSO obtains the best Total Average Rank (TAR) as 1.375, and TSS of ScPSO ranks first (6) again. The fitness values obtained by ScPSO are generally more satisfactory than the values obtained by other methods. Consequently, ScPSO achieve promising gains over other optimization methods; in parallel with this result, its usage can be extended to different working disciplines. Highlights PSO parameters are ineffective to regenerate the awkward particle that cannot improve its pbest. An external intervention is inevitable once a particle becomes an awkward one. ScPSO is obtained with the addition of scout bee phase into the PSO. So an evolutionary method eliminating the most important handicap of PSO is gained. ScPSO is compared with the variants and with hybrid versions of PSO and ABC methods. According to the experiments, ScPSO results in better optimal solutions. The fitness values of ScPSO are generally more satisfactory than the others. Consequently, ScPSO achieve promising gains over other optimization methods. In parallel with this, its usage can be extended to different working disciplines.