This chapter introduces some of the theoretical foundations of swarm intelligence. We focus on the design and implementation of the Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) algorithms for various types of function optimization problems, real world applications and data mining. Results are analyzed, discussed and their potentials are illustrated.

With the rapid development of swarm intelligence research field, a large number of algorithms in swarm intelligence are proposed one after another. The strong points and the drawbacks of a specific swarm intelligence algorithm becomes clear to be seen when the number of its application increases. To overcome the handicaps, some hybrid methods are invented. In this review, three hybrid swarm int...

Two important topics in Particle Swarm Optimization (PSO) research filed are trajectory analysis of particles and parameter selection method. Trajectory analysis is important because it can help to determine where the position of each particle is at each evolutionary step, and consequently it can help to clarify the running mechanism of PSO algorithm, so as to explain why and when PSO algorithm...

Title of dissertation: Cooperative Particle Swarm Optimization for Combinatorial Problems Grecia Lapizco-Encinas, Doctor of Philosophy, 2009 Dissertation directed by: Professor James Reggia Professor Carl Kingsford Department of Computer Science A particularly successful line of research for numerical optimization is the wellknown computational paradigm particle swarm optimization (PSO). In the...

Generality is one of the main advantages of heuristic algorithms, as such, multiple parameters are exposed to the user with the objective of allowing them to shape the algorithms to their specific needs. Parameter selection, therefore, becomes an intrinsic problem of every heuristic algorithm. Selecting good parameter values relies not only on knowledge related to the problem at hand, but to th...

Particle swarm optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analyses that concentrate on understanding particle trajectories. This paper overviews current theoretical studies, and extend these studies to applications in mechatronic systems, such as identification, control gains and o...

Our main objective in this article is to achieve minimum side lobe levels for a specific first null beam-width and also a minimum size of the circumference by an optimization-based design method for non-uniform, planar, and circular antenna arrays. Our approach is based on a new variant of Particle swarm Optimization technique. This new technique is a hybrid of Local Neighborhood based PSO with...

Particle swarm optimization algorithm is easy to reach premature convergence in the solution process, and fall into the local optimal solution. Aiming at the problem, this paper proposes a particle swarm optimization algorithm with chaotic mapping (CM-PSO). The algorithms uses chaotic mapping function to optimize the initial state of population, improve the probability of obtain optimal solutio...

Because of computational drawbacks of conventional numerical methods in solving complex optimization problems, researchers may have to rely on meta-heuristic algorithms. Particle swarm optimization (PSO) is one of the most widely used algorithms due to its simplicity of implementation and fast convergence speed. Also, the cuckoo search algorithm is a recently developed meta-heuristic optimizati...

In this paper, a new approach is proposed for the optimum design of single-phase induction motor. By using the classical design equations and the evolutionary algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and Modified Particle Swarm Optimization (MPSO), a Single Phase Induction Motor (SPIM) was designed with the maximum efficiency. The Finite Element Method (FEM)...