On the behavior and performance of chaos driven PSO algorithm with inertia weight

Authors:
Michal Pluhacek;Roman Senkerik;Donald Davendra;Zuzana Kominkova Oplatkova;Ivan Zelinka
Affiliations:
Tomas Bata University in Zlin, Faculty of Applied Informatics, Nam T.G. Masaryka 5555, 760 01 Zlin, Czech Republic;Tomas Bata University in Zlin, Faculty of Applied Informatics, Nam T.G. Masaryka 5555, 760 01 Zlin, Czech Republic;VŠB-Technical University of Ostrava, Department of Computer Science, Faculty of Electrical Engineering and Computer Science, 17. listopadu 15, 708 33 Ostrava-Poruba, Czech Republic;Tomas Bata University in Zlin, Faculty of Applied Informatics, Nam T.G. Masaryka 5555, 760 01 Zlin, Czech Republic;VŠB-Technical University of Ostrava, Department of Computer Science, Faculty of Electrical Engineering and Computer Science, 17. listopadu 15, 708 33 Ostrava-Poruba, Czech Republic
Venue:
Computers & Mathematics with Applications
Year:
2013

Citing 7
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Chaos and Time-Series Analysis

Chaos and Time-Series Analysis
Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings (Lecture Notes in Computer Science)

Ant Colony Optimization and Swarm Intelligence: 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings (Lecture Notes in Computer Science)
Particle swarm approaches using Lozi map chaotic sequences to fuzzy modelling of an experimental thermal-vacuum system

Applied Soft Computing
Chaos driven evolutionary algorithms for the task of PID control

Computers & Mathematics with Applications
A novel particle swarm optimization algorithm with adaptive inertia weight

Applied Soft Computing
Chaotic sequences to improve the performance of evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper, the utilization of chaos pseudorandom number generators based on three different chaotic maps to alter the behavior and overall performance of PSO algorithm is proposed. This paper presents results of testing the performance and behavior of the proposed algorithm on typical benchmark functions that represent unimodal and multimodal problems. The promising results are analyzed and discussed.