Fusing Multiple Strategies in Population-Based Optimization Algorithm

2015 ◽  
Vol 764-765 ◽  
pp. 1407-1411
Author(s):  
Chang Huang Chen

A multi-strategy based population optimization, referred to MSPO, is proposed in this paper. The algorithm is developed by hybridizing four different population-based algorithms, bare bone particle swarm optimization, quantum-behaved particle swarm optimization, differential evolution and opposition-based learning. It aims at enhancing the exploration and exploitation capability of population based algorithm for general optimization problem. These four options are randomly selected with equal probability during the search process. The proposed algorithm is validated against test functions and then compares its performance with those of particle swarm optimization and bare bone particle swarm optimization. Numerical results show that the performance is increased greatly both in solution quality and convergent speed.

Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang ◽  
Junhui Yang

Particle swarm optimization (PSO) algorithm is a stochastic and population-based optimization algorithm. Its traditional learning strategy is implemented by updating the best position using the particle’s own historical best experience and its neighborhood’s best experience to find the optimal solution of the problem. However, the learning strategy is ineffective when dealing with highly complex problems. In this paper, a particle swarm optimization algorithm based on a multidimensional mean learning strategy is proposed. In this algorithm, an opposition-based learning strategy is utilized to initialize the population to enhance the exploitation capability. Furthermore, the historical best positions of all the particles are reconstructed in a vertical crossover manner that is based on the mean information of multiple optimal dimensions to generate the guiding particles. Additionally, an improved inertia weight is used to further guide all the particle movements to balance the capability of the proposed algorithm for global exploration and local exploitation. The proposed algorithm is tested on 12 benchmark functions and is compared with some well-known PSO algorithms. The experimental results show that the proposed algorithm obtains more competitive optimal solution compared with other PSO algorithms when solving high-dimensional complex problems.


Author(s):  
Ravichander Janapati ◽  
Ch. Balaswamy ◽  
K. Soundararajan

Localization is the key research area in wireless sensor networks. Finding the exact position of the node is known as localization. Different algorithms have been proposed. Here we consider a cooperative localization algorithm with censoring schemes using Crammer Rao bound (CRB). This censoring scheme  can improve the positioning accuracy and reduces computation complexity, traffic and latency. Particle swarm optimization (PSO) is a population based search algorithm based on the swarm intelligence like social behavior of birds, bees or a school of fishes. To improve the algorithm efficiency and localization precision, this paper presents an objective function based on the normal distribution of ranging error and a method of obtaining the search space of particles. In this paper  Distributed localization of wireless sensor networksis proposed using PSO with best censoring technique using CRB. Proposed method shows better results in terms of position accuracy, latency and complexity.  


Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang ◽  
Soroosh Mahmoodi

AbstractMultiobjective particle swarm optimization (MOPSO) algorithm faces the difficulty of prematurity and insufficient diversity due to the selection of inappropriate leaders and inefficient evolution strategies. Therefore, to circumvent the rapid loss of population diversity and premature convergence in MOPSO, this paper proposes a knowledge-guided multiobjective particle swarm optimization using fusion learning strategies (KGMOPSO), in which an improved leadership selection strategy based on knowledge utilization is presented to select the appropriate global leader for improving the convergence ability of the algorithm. Furthermore, the similarity between different individuals is dynamically measured to detect the diversity of the current population, and a diversity-enhanced learning strategy is proposed to prevent the rapid loss of population diversity. Additionally, a maximum and minimum crowding distance strategy is employed to obtain excellent nondominated solutions. The proposed KGMOPSO algorithm is evaluated by comparisons with the existing state-of-the-art multiobjective optimization algorithms on the ZDT and DTLZ test instances. Experimental results illustrate that KGMOPSO is superior to other multiobjective algorithms with regard to solution quality and diversity maintenance.


Sign in / Sign up

Export Citation Format

Share Document