Repeating Successful Movement Strategy for ABC Algorithm
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
UNIV SUCEAVA, FAC ELECTRICAL ENG
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
ABC is a well-known nature inspired algorithm. In short ABC algorithm mimics the foraging behavior of the bee colonies. ABC is very intensively worked algorithm. It has many variants. The base algorithm and most of the variants uses an update equation to improve the solutions. The update equation finds a feasible movement based on neighbor solutions and adds that movement to current to create a mutant solution. If the mutant solution is better than the original one then original solution is updated. None of the ABC variant use a successful movement again. In this work when a successful move found then it is used again. Proposed approach is applied to ABCVSS algorithm which is a recently proposed ABC variant and that modified ABCVSS algorithm (ABCVSSRSM) is tested on numerical benchmark functions and results compared the well-known ABC variants. Results show that proposed method is superior under multiple criteria.
Açıklama
Anahtar Kelimeler
artificial intelligence, machine learning, evolutionary computation, particle swarm optimization, machine intelligence
Kaynak
ADVANCES IN ELECTRICAL AND COMPUTER ENGINEERING
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
17
Sayı
3
