# Estimation of Distribution Algorithms for Knapsack Problem

- Authors
- Publisher
- ACADEMY PUBLISHER
- Publication Date
- Source
- Legacy
- Keywords
- Disciplines

## Abstract

Estimation of distribution algorithms ( EDAs ) is a new kind of evolution algorithm. In EDAs , through the statistics of the information of selected individuals in current group, the probability of the individual distribution in next generation is given and the next generation of group is formed by random sampling. A wide range of mathematical model of the knapsack problem are proposed. In this paper, the EDAs is applied to solve the knapsack problem. The influence of several strategies, such as numbers of population and better population selection proportions are analyzed. Simulation results show that the EDAs is reliable and effective for solving the knapsack problem. The Maltab code is given also. It can easily be modified for any combinatorial problem for which we have no good specialized algorithm.

## There are no comments yet on this publication. Be the first to share your thoughts.