Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation

Particle Swarm Optimization (PSO) is a stochastic optimization approach that originated from early attempts to simulate the behavior of birds looking for food. Estimation of distributions algorithms (EDAs) are a class of evolutionary algorithms that build and maintain a probabilistic model capturing...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: El-Abd, Mohammed (author)
مؤلفون آخرون: Kamel, Mohamed (author)
منشور في: 2012
الوصول للمادة أونلاين:http://hdl.handle.net/11675/967
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1870679731814268930
author El-Abd, Mohammed
author2 Kamel, Mohamed
author2_role author
author_facet El-Abd, Mohammed
Kamel, Mohamed
author_role author
dc.creator.none.fl_str_mv El-Abd, Mohammed
Kamel, Mohamed
dc.date.none.fl_str_mv 2012
2016-04-07T08:38:47Z
2016-04-07T08:38:47Z
dc.identifier.none.fl_str_mv http://hdl.handle.net/11675/967
dc.relation.none.fl_str_mv IEEE Congress on Evolutionary Computation
dc.title.none.fl_str_mv Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
dc.type.none.fl_str_mv Conference Paper
info:eu-repo/semantics/publishedVersion
description Particle Swarm Optimization (PSO) is a stochastic optimization approach that originated from early attempts to simulate the behavior of birds looking for food. Estimation of distributions algorithms (EDAs) are a class of evolutionary algorithms that build and maintain a probabilistic model capturing the search space characteristics and continuously use this model to generate new individuals. In this work, we propose a new PSO and EDA hybrid algorithm that uses the particles' distribution in the search space in order to adjust the search space bounds, hence, restricting the particles movement as well as their allowable maximum velocity. The algorithms is augmented with a mechanism to overcome premature convergence and escape local minima. The algorithm is compared to the standard PSO algorithm using a suite of well-known benchmark optimization functions. Experimental results show that the proposed algorithm has a promising performance.
id AUKR_30b3b1e8d8e8aca1abbaa2ad4e6fd7ef
network_acronym_str AUKR
network_name_str AU Kuwait Rep
oai_identifier_str oai:dspace.auk.edu.kw:11675/967
publishDate 2012
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary ComputationEl-Abd, MohammedKamel, MohamedParticle Swarm Optimization (PSO) is a stochastic optimization approach that originated from early attempts to simulate the behavior of birds looking for food. Estimation of distributions algorithms (EDAs) are a class of evolutionary algorithms that build and maintain a probabilistic model capturing the search space characteristics and continuously use this model to generate new individuals. In this work, we propose a new PSO and EDA hybrid algorithm that uses the particles' distribution in the search space in order to adjust the search space bounds, hence, restricting the particles movement as well as their allowable maximum velocity. The algorithms is augmented with a mechanism to overcome premature convergence and escape local minima. The algorithm is compared to the standard PSO algorithm using a suite of well-known benchmark optimization functions. Experimental results show that the proposed algorithm has a promising performance.2016-04-07T08:38:47Z2016-04-07T08:38:47Z2012Conference Paperinfo:eu-repo/semantics/publishedVersionhttp://hdl.handle.net/11675/967IEEE Congress on Evolutionary Computationoai:dspace.auk.edu.kw:11675/9672022-01-13T09:21:59Z
spellingShingle Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
El-Abd, Mohammed
status_str publishedVersion
title Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
title_full Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
title_fullStr Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
title_full_unstemmed Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
title_short Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
title_sort Particle Swarm Optimization with Adaptive Bounds. IEEE Congress on Evolutionary Computation
url http://hdl.handle.net/11675/967