Author/Authors
babayiğit, bilal erciyes üniversitesi - mühendislik fakültesi - bilgisayar mühendisliği bölümü, Kayseri, Türkiye , haspaylan, sema erciyes üniversitesi - fen bilimleri enstitüsü, Kayseri, Türkiye
Title Of Article
A fireworks algorithm using tournament selection operator
شماره ركورد
40945
Abstract
In recent decade, several nature-inspired swarm intelligence-based optimization techniques have been improved. These techniques, which give solutions close to optimum in an acceptable time, have been applied successfully to solve the problems in science and social sciences. Fireworks Algorithm (FA), inspired by observing fireworks explosion, is a new swarm intelligence algorithm. This relatively new technique has been utilized to tackle diverse problems and obtained better performance than other popular techniques such as particle swarm optimization, ant colony, and genetic algorithm. Despite the good results obtained, FA requires long computation time to achieve the optimum solution. To eliminate long computation time drawback of FA, in this study, a FA using tournament selection is proposed. The performance of the proposed FA, which involves tournament selection operator, is tested on well-known 15 numerical optimization problems. Experimental results reveal that proposed FA has a significant performance improvement in term of computation time and solution quality in comparison with original FA.
From Page
628
NaturalLanguageKeyword
Swarm intelligence , Optimization techniques , Numerical optimization
JournalTitle
Pamukkale University Journal Of Engineering Sciences
To Page
636
JournalTitle
Pamukkale University Journal Of Engineering Sciences
Link To Document