Genetic particle swarm optimization based on estimation of distribution

Authors:
Jiahai Wang
Affiliations:
Department of Computer Science, Sun Yat-sen University, Guangzhou, P.R.China
Venue:
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Year:
2007

Citing 8
Cited 5

A Survey of Optimization by Building and Using Probabilistic Models

Computational Optimization and Applications
Recent approaches to global optimization problems through Particle Swarm Optimization

Natural Computing: an international journal
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Learning probability distributions in continuous evolutionary algorithms– a comparative review

Natural Computing: an international journal
Where are the hard knapsack problems?

Computers and Operations Research
The equation for response to selection and its use for prediction

Evolutionary Computation
The compact genetic algorithm

IEEE Transactions on Evolutionary Computation

Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems

Expert Systems with Applications: An International Journal
A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem

Expert Systems with Applications: An International Journal
Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems

Computers and Industrial Engineering
A high throughput system for intelligent watermarking of bi-tonal images

Applied Soft Computing
Estimation of particle swarm distribution algorithms: Combining the benefits of PSO and EDAs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Estimation of distribution algorithms sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. In this paper, a modified genetic particle swarm optimization algorithm based on estimation of distribution is proposed for combinatorial optimization problems. The proposed algorithm incorporates the global statistical information collected from local best solution of all particles into the genetic particle swarm optimization. To demonstrate its performance, experiments are carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that the proposed algorithm has superior performance to other discrete particle swarm algorithms.