Humberto Martins Mendonça DuarteRafael Lima de Carvalho
Particle swarm optimization (PSO) is a well-known metaheuristic, whose performance for solving global optimization problems has been thoroughly explored. It has been established that without proper manipulation of the inertia weight parameter, the search for a global optima may fail. In order to handle this problem, we investigate the experimental performance of a PSO-based metaheuristic known as HPSO-SSM, which uses a logistic map sequence to control the inertia weight to enhance the diversity in the search process, and a spiral-shaped mechanism as a local search operator, as well as two dynamic correction factors to the position formula. Thus, we present an application of this variant for solving high-dimensional optimization problems, and evaluate its effectiveness against 24 benchmark functions. A comparison between both methods showed that the proposed variant can escape from local optima, and demonstrates faster convergence for almost every evaluated function.
Ke ChenFengyu ZhouXianfeng Yuan
D. TianBingchun LiChen LiuYani Wang
Leticia CagninaSusana Cecilia EsquivelCarlos A. Coello Coello