Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space

Simple item page
dc.creatorZhang, Wen-Jun
dc.creatorXie, Xiao-Feng
dc.creatorBi, De-Chun
dc.date2005-05-25
dc.date.accessioned2026-07-07T03:23:02Z
dc.date.available2026-07-07T03:23:02Z
dc.descriptionThe periodic mode is analyzed together with two conventional boundary handling modes for particle swarm. By providing an infinite space that comprises periodic copies of original search space, it avoids possible disorganizing of particle swarm that is induced by the undesired mutations at the boundary. The results on benchmark functions show that particle swarm with periodic mode is capable of improving the search performance significantly, by compared with that of conventional modes and other algorithms.
dc.descriptionCongress on Evolutionary Computation, 2004. CEC2004. Volume: 2, On page(s): 2307- 2311 Vol.2
dc.identifierhttps://arxiv.org/abs/cs/0505069
dc.identifierhttp://arxiv.org/abs/cs/0505069
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32789
dc.subjectNeural and Evolutionary Computing
dc.titleHandling boundary constraints for numerical optimization by particle swarm flying in periodic search space
dc.typetext

Files

Collections

arXiv