2005•Unpublished venueRequires access
Mixing use methods of the genetic algorithm to solve 0-1's knapsack problem
Dong Qing-tan
Open publisher page 0 citations
Abstract
The genetic algorithm is based on the search algorithm of natural selection and genetic mechanism. This paper attempted to discussi the way in solving famous 0-1's knapsack problem, and improved the classics genetic algorithms by mixing use methods of singlepoint-crossover and multipoint-crossover as well as combining tradition algorithms with genetic algorithm in order to gain the better approximate solution about the problem.