##
**Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization.**
*(English)*
Zbl 1114.90159

Summary: The particle swarm optimization (PSO) is a relatively new generation of combinatorial metaheuristic algorithms which is based on a metaphor of social interaction, namely bird flocking or fish schooling. Although the algorithm has shown some important advances by providing high speed of convergence in specific problems it has also been reported that the algorithm has a tendency to get stuck in a near optimal solution and may find it difficult to improve solution accuracy by fine tuning. The present paper proposes a new variation of PSO model where we propose a new method of introducing nonlinear variation of inertia weight along with a particle’s old velocity to improve the speed of convergence as well as fine tune the search in the multidimensional space. The paper also presents a new method of determining and setting a complete set of free parameters for any given problem, saving the user from a tedious trial and error based approach to determine them for each specific problem. The performance of the proposed PSO model, along with the fixed set of free parameters, is amply demonstrated by applying it for several benchmark problems and comparing it with several competing popular PSO and non-PSO combinatorial metaheuristic algorithms.

### MSC:

90C59 | Approximation methods and heuristics in mathematical programming |

90C27 | Combinatorial optimization |

### Keywords:

combinatorial metaheuristics; particle swarm; nonlinear inertia weight; fixed parameter set
PDF
BibTeX
XML
Cite

\textit{A. Chatterjee} and \textit{P. Siarry}, Comput. Oper. Res. 33, No. 3, 859--871 (2006; Zbl 1114.90159)

Full Text:
DOI

### References:

[1] | Colorni, A.; Dorigo, M.; Maniezzo, V., Distributed optimization by ant colonies, (Proceedings of ECAL’91—European Conference on Artificial Life. Proceedings of ECAL’91—European Conference on Artificial Life, Paris, France: Elsevier Publishing (1998)), 134-142 |

[5] | Shi, Y.; Eberhart, R. C., A modified particle swarm optimiser, (Proceedings of the IEEE International Conference on Evolutionary Computation. Proceedings of the IEEE International Conference on Evolutionary Computation, Piscataway NJ: IEEE Press (1998)), 69-73 |

[7] | Clerc, M.; Kennedy, J., The particle Swarm—explosion, stability and convergence in a multidimensional complex space, IEEE Trans Evol Comput, 6, 1, 58-73 (2002) |

[8] | Eberhart, R. C.; Shi, Y., Comparing inertia weights and constriction factors in particle swarm optimization, (Proceedings of the 2000 Congress on Evolutionary Computation. Proceedings of the 2000 Congress on Evolutionary Computation, Washington, DC (2000)), 84-88 |

[10] | Coelho, J. P.; Oliviera, P. B.; de M. Cunha, Greenhouse air temperature control using the particle swarm optimization algorithm, (15th Triennial World Congress. 15th Triennial World Congress, IFAC. Barcelona, Spain (2002)) |

[12] | Bessaou, M.; Siarry, P., A genetic algorithm with real-value coding to optimize multimodal continuous functions, Struct Multidisc Optim, 23, 63-74 (2001) |

[13] | Chelouah, R.; Siarry, P., A continuous genetic algorithm designed for the global optimization, J Heuristics, 6, 191-213 (2000) · Zbl 0969.68641 |

[15] | Chelouah, R.; Siarry, P., Tabu search applied to global optimization, Euro J Oper Res, 123, 256-270 (2000) · Zbl 0961.90037 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.