A Hybrid Genetic Algorithm for the Multidimensional Knapsack Problem

@inproceedings{Djannaty2008AHG,
  title={A Hybrid Genetic Algorithm for the Multidimensional Knapsack Problem},
  author={F. Djannaty},
  year={2008}
}
During the last two decades solving combinatorial optimization problems, using genetic algorithms (GA), has attracted the attention of many researchers. In this paper a strong initial population is created by Dantzig algorithm for solving single knapsack problems. This algorithm is hybridized with the genetic algorithm. A number of novel penalty functions are designed which drive the population toward feasibility rapidly. The algorithm is then applied to some standard knapsack test problems… CONTINUE READING