A genetic algorithm for solving binary knapsack problems

A genetic algorithm for solving binary knapsack problems

0.00 Avg rating0 Votes
Article ID: iaor2005737
Country: China
Volume: 23
Issue: 3
Start Page Number: 69
End Page Number: 72
Publication Date: Sep 2003
Journal: Journal of Tianjin Normal University
Authors:
Abstract:

A genetic algorithm is a search algorithm based on natural selection and genetic mechanism. The classical genetic algorithm was improved by use of combining singlepoint-crossover with multipoint-crossover and classical algorithm with genetic algorithm. The binary knapsack problem was discussed with genetic algorithm, and a better approximate solution was obtained in experiment.

Reviews

Required fields are marked *. Your email address will not be published.