An Adaptive Location-Aware Swarm Intelligence Optimization Algorithm

Abstract

Optimization is an important and decisive task in science. Many optimization problems in science are naturally too complicated and difficult to be modeled and solved by the conventional optimization methods such as mathematical programming problem solvers. Meta-heuristic algorithms that are inspired by nature have started a new era in computing theory to solve the optimization problems. The paper seeks to find an optimization algorithm that learns the expected quality of different places gradually and adapts its exploration-exploitation dilemma to the location of an individual. Using birds’ classical conditioning learning behavior, in this paper, a new particle swarm optimization algorithm has been introduced where particles can learn to perform a natural conditioning behavior towards an unconditioned stimulus. Particles are divided into multiple categories in the problem space and if any of them finds the diversity of its category to be low, it will try to go towards its best personal experience. But if the diversity among the particles of its category is high, it will try to be inclined to the global optimum of its category. We have also used the idea of birds’ sensitivity to the space in which they fly and we have tried to move the particles more quickly in improper spaces so that they would depart these spaces as fast as possible. On the contrary, we reduced the particles’ speed in valuable spaces in order to let them explore those places more. In the initial population, the algorithm has used the instinctive behavior of birds to provide a population based on the particles’ merits. The proposed method has been implemented in MATLAB and the results have been divided into several subpopulations or parts. The proposed method has been compared to the state-of-the-art methods. It has been shown that the proposed method is a consistent algorithm for solving the static optimization problems.