Estimation of Distribution Algorithms for Knapsack Problem

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.

[1]  I. V. Ramakrishnan,et al.  Parallel Approximate Algorithms for the 0-1 Knapsack Problem , 1986, ICPP.

[2]  Adam Smith,et al.  Algorithm Design and Analysis , 2008 .

[3]  Jixiang Cheng,et al.  Radar Emitter Signal Analysis with Estimation of Distribution Algorithms , 2013, J. Networks.

[4]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[5]  Zhang Xin-rong.  Optimization Algorithm for Multiple-choice Knapsack Problem Based on Ant Colony System , 2003 .

[6]  Larry Rudolph,et al.  Parallel approximation schemes for Subset Sum and Knapsack problems , 2004, Acta Informatica.

[7]  Yong-Chang Jiao,et al.  MOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems , 2013, J. Comput..

[8]  Wang Long-de.  ANT OPTIMIZATION ALGORITHM FOR KNAPSACK PROBLEM , 2001 .

[9]  Andrew Chi-Chih Yao,et al.  On the parallel computation for the knapsack problem , 1981, STOC '81.

[10]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[11]  Richard J. Lipton,et al.  Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming , 1986, ICPP.

[12]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[13]  Ma Liang.  Genetic annealing evolutionary algorithm applied to the knapsack problem , 2004 .

[14]  M. Pelikán,et al.  A Survey of Estimation of Distribution Algorithms , 2011 .

[15]  Hitoshi Iba,et al.  Linear and Combinatorial Optimizations by Estimation of Distribution Algorithms , 2002 .

[16]  Haina Rong,et al.  A Novel Estimation of Distribution Algorithm with Multiple Probability Models , 2012 .

[17]  Shu-De Zhou,et al.  A Survey on Estimation of Distribution Algorithms , 2007 .

[18]  Min Zhang,et al.  Solution to the 0-1 Knapsack Problem based on DNA Encoding and Computing Method , 2013, J. Comput..

[19]  Guolin Yu.  Multi-objective estimation of Estimation of Distribution Algorithm based on the Simulated binary Crossover , 2012 .

[20]  Benjamin W. Wah,et al.  Systolic processing for dynamic programming problems , 1988, ICPP.

[21]  Rui Zhang.  A Rule-Based Estimation of Distribution Algorithm for Solving Job Shop , 2011 .