Learn More
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(More)
  • 1