A hybrid particle swarm optimization algorithm based on nonlinear simplex method and tabu search

  • Authors:
  • Zhanchao Li;Dongjian Zheng;Huijing Hou

  • Affiliations:
  • College of Water Conservancy and Hydropower Engineering, Hohai University, Nanjing, Jiangsu, China;College of Water Conservancy and Hydropower Engineering, Hohai University, Nanjing, Jiangsu, China;College of Water Conservancy and Hydropower Engineering, Hohai University, Nanjing, Jiangsu, China

  • Venue:
  • ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle swarm optimization (PSO) algorithm is an intelligent search method based on swarm intelligence It has been widely used in many fields because of its conciseness and easy implementation But it is also easy to be plunged into local solution and its later convergence speed is very slow In order to increase its convergence speed, nonlinear simplex method (NSM) is integrated into it, which not only can increase its later convergence speed but also can effectively avoid dependence on initial conditions of NSM In order to bring particles jump out of local solution regions, tabu search (TS) algorithm is integrated into it to assign tabu attribute to these regions, which make it with global search ability Thus the hybrid PSO algorithm is an organic composition of the PSO, NSM and TS algorithms Finally its basic operation process and optimization characteristics are analyzed through some benchmark functions and its effectiveness is also verified.