2007 | OriginalPaper | Buchkapitel
Genetic Particle Swarm Optimization Based on Estimation of Distribution
verfasst von : Jiahai Wang
Erschienen in: Bio-Inspired Computational Intelligence and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.