Modelling of interaction in swarm intelligence focused on particle swarm optimization and social networks optimization

Author(s):  
A. Niccolai ◽  
F. Grimaccia ◽  
M. Mussetta ◽  
R. E. Zich
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.


2016 ◽  
pp. 1519-1544 ◽  
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.


Author(s):  
I. I. Aina ◽  
C. N. Ejieji

In this paper, a new metaheuristic algorithm named refined heuristic intelligence swarm (RHIS) algorithm is developed from an existing particle swarm optimization (PSO) algorithm by introducing a disturbing term to the velocity of PSO and modifying the inertia weight, in which the comparison between the two algorithms is also addressed.


2019 ◽  
Vol 8 (3) ◽  
pp. 8259-8265

Particle swarm optimization (PSO) is one of the most capable algorithms that reside to the swarm intelligence (SI) systems. Recently, it becomes very popular and renowned because of the easy implementation in complex/real life optimization problems. However, PSO has some observable drawbacks such as diversity maintenance, pre convergence and/or slow convergence speed. The ultimate success of PSO depends on the velocity update of the particles. Velocity has a significant dependence on its multiplied coefficient like inertia weight and acceleration factors. To increase the ability of PSO, this paper introduced an enriched PSO (namely ePSO), to solve hard optimization problems more precisely, efficiently and reliably. In ePSO novel gradually decreased inertia weight (as an alternative of a fixed constant value) and new gradually decreased and/or increased acceleration factors (meant for cognitive and social modules) is introduced. Proposed ePSO is used to solve four well known typical unconstrained benchmark functions and four complex unconstrained real life problems. The overall observation shows that proposed new algorithm ePSO is fitter than the compared algorithms significantly and statistically. Moreover, the convergence accuracy and speed of ePSO are also improved effectively


Sign in / Sign up

Export Citation Format

Share Document