Boundary Conditions in Particle Swarm Optimization Revisited

In order to enforce particles to search inside the solution space of interest during the optimization procedure, various boundary conditions are currently used in particle swarm optimization (PSO) algorithms. The performances, however, vary considerably with the dimensionality of the problem and the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on antennas and propagation Ročník 55; číslo 3; s. 760 - 765
Hlavní autoři:	Xu, Shenheng, Rahmat-Samii, Yahya
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.03.2007 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Antenna arrays Antennas Applied classical electromagnetism Applied sciences Array antenna Benchmark testing Boundaries Boundary conditions Damping Electromagnetic wave propagation, radiowave propagation Electromagnetism; electron and ion optics evolutionary algorithm Evolutionary computation Exact sciences and technology Fundamental areas of phenomenology (including applications) Mathematical analysis Optimization Optimization methods Particle swarm optimization particle swarm optimization (PSO) Performance evaluation Physics Radiocommunications Robustness Solution space Stochastic processes Studies Telecommunications Telecommunications and information theory Performance evaluation Electromagnetism Evolutionary algorithm Evolutionary computation Global optimum optimization methods Boundary condition Location problem Mathematical function Array antenna Biomimetics Algorithm performance Simulation Real function Optimal solution Swarm intelligence particle swarm optimization (PSO) Antenna array
ISSN:	0018-926X, 1558-2221
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In order to enforce particles to search inside the solution space of interest during the optimization procedure, various boundary conditions are currently used in particle swarm optimization (PSO) algorithms. The performances, however, vary considerably with the dimensionality of the problem and the location of the global optimum in the solution space. In this paper, different boundary conditions are categorized into two groups, namely, restricted and unrestricted, according to whether the errant particles are relocated inside the allowable solution space or not. Moreover, efforts are made to explore different hybrid unrestricted boundary conditions by introducing the favorable characteristics of the reflecting and damping boundary conditions into the existing invisible boundary condition. The performances of the boundary conditions are tested based on both mathematical benchmark functions and a real-world electromagnetic problem: the optimization of a 2-D 16-element array antenna. Simulation results are examined from both the effectiveness and efficiency of the algorithm. Comparisons show that the unrestricted boundary conditions are more efficient when the global optimum is inside the boundary of the solution space, and the damping boundary condition is more robust and consistent when the global optimum is close to the boundary
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
ISSN:	0018-926X 1558-2221
DOI:	10.1109/TAP.2007.891562