Efficiency analysis of swarm intelligence and randomization techniques

Yang, Xin-She (2012) Efficiency analysis of swarm intelligence and randomization techniques. Journal of Computational and Theoretical Nanoscience, 9 (2). pp. 189-198. ISSN 1546-1955

Full text is not in this repository.

Official URL: http://www.ingentaconnect.com/content/asp/jctn/201...

Abstract

Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark. The outstanding performance and efficiency of swarm-based algorithms inspired many new developments, though mathematical understanding of metaheuristics remains partly a mystery. In contrast to the classic deterministic algorithms, metaheuristics such as PSO always use some form of randomness, and such randomization now employs various techniques. This paper intends to review and analyze some of the convergence and efficiency associated with metaheuristics such as firefly algorithm, random walks, and Lévy flights. We will discuss how these techniques are used and their implications for further research. (from website)

Item Type:Article
Research Areas:Science & Technology > Algorithms, Architecture & Networks
ID Code:9555
Useful Links:
Deposited On:19 Nov 2012 09:50
Last Modified:06 Feb 2013 11:27

Repository Staff Only: item control page

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year