An Adaptive Particle Swarm Optimization Algorithm for Unconstrained Optimization. (9th September 2020)

• Record Type: Journal Article
• Authors: Qian, Feng; Mahmoudi, Mohammad Reza; Parvïn, Hamïd; Pho, Kim-Hung; Tuan, Bui Anh
• Other Names: Aguilar-Ibanez Carlos Academic Editor.
• Is Part Of: Complexity. Volume 2020(2020)
• Publication Date: 2020-09-09
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2020/2010545
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Conventional optimization methods are not efficient enough to solve many of the naturally complicated optimization problems. Thus, inspired by nature, metaheuristic algorithms can be utilized as a new kind of problem solvers in solution to these types of optimization problems. In this paper, an optimization algorithm is proposed which is capable of finding the expected quality of different locations and also tuning its exploration-exploitation dilemma to the location of an individual. A novel particle swarm optimization algorithm is presented which implements the conditioning learning behavior so that the particles are led to perform a natural conditioning behavior on an unconditioned motive. In the problem space, particles are classified into several categories so that if a particle lies within a low diversity category, it would have a tendency to move towards its best personal experience. But, if the particle's category is with high diversity, it would have the tendency to move towards the global optimum of that category. The idea of the birds' sensitivity to its flying space is also utilized to increase the particles' speed in undesired spaces in order to leave those spaces as soon as possible. However, in desirable spaces, the particles' velocity is reduced to provide a situation in which the particles have more time to explore their environment. In the proposed algorithm, the birds' instinctive behavior is implemented to construct an initial population randomly or chaotically. Experiments provided to compare the proposed algorithm with the state-of-the-art methods show that our optimization algorithm is one of the most efficient and appropriate ones to solve the static optimization problems.