A novel particle swarm optimization algorithm with Levy flight

dc.contributor.authorHakli, Huseyin
dc.contributor.authorUguz, Harun
dc.date.accessioned2020-03-26T18:49:14Z
dc.date.available2020-03-26T18:49:14Z
dc.date.issued2014
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractParticle swarm optimization (PSO) is one of the well-known population-based techniques used in global optimization and many engineering problems. Despite its simplicity and efficiency, the PSO has problems as being trapped in local minima due to premature convergence and weakness of global search capability. To overcome these disadvantages, the PSO is combined with Levy flight in this study. Levy flight is a random walk determining step size using Levy distribution. Being used Levy flight, a more efficient search takes place in the search space thanks to the long jumps to be made by the particles. In the proposed method, a limit value is defined for each particle, and if the particles could not improve self-solutions at the end of current iteration, this limit is increased. If the limit value determined is exceeded by a particle, the particle is redistributed in the search space with Levy flight method. To get rid of local minima and improve global search capability are ensured via this distribution in the basic PSO. The performance and accuracy of the proposed method called as Levy flight particle swarm optimization (LFPSO) are examined on well-known unimodal and multimodal benchmark functions. Experimental results show that the LFPSO is clearly seen to be more successful than one of the state-of-the-art PSO (SPSO) and the other PSO variants in terms of solution quality and robustness. The results are also statistically compared, and a significant difference is observed between the SPSO and the LFPSO methods. Furthermore, the results of proposed method are also compared with the results of well-known and recent population-based optimization methods. (C) 2014 Elsevier B.V. All rights reserved.en_US
dc.description.sponsorshipScientific Research Project of Selcuk UniversitySelcuk Universityen_US
dc.description.sponsorshipThe authors thank Omer Kaan Baykan (Ph.D.) and Mustafa Servet Kiran (Ph.D.q) for their suggestions and comments. This study has been supported by Scientific Research Project of Selcuk University.en_US
dc.identifier.doi10.1016/j.asoc.2014.06.034en_US
dc.identifier.endpage345en_US
dc.identifier.issn1568-4946en_US
dc.identifier.issn1872-9681en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage333en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.asoc.2014.06.034
dc.identifier.urihttps://hdl.handle.net/20.500.12395/30560
dc.identifier.volume23en_US
dc.identifier.wosWOS:000341680000029en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartofAPPLIED SOFT COMPUTINGen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectParticle swarm optimizationen_US
dc.subjectLevy flighten_US
dc.subjectLevy distributionen_US
dc.subjectOptimizationen_US
dc.titleA novel particle swarm optimization algorithm with Levy flighten_US
dc.typeArticleen_US

Dosyalar