An improved genetic algorithm and its application to knapsack problem

An improved genetic algorithm and its application to knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor20071464
Country: China
Volume: 27
Issue: 4
Start Page Number: 718
End Page Number: 719
Publication Date: Apr 2005
Journal: Chinese Journal of Systems Engineering and Electronics
Authors: , ,
Keywords: heuristics: genetic algorithms
Abstract:

An improved genetic algorithm is introduced and its procedure is provided in detail. The algorithm provides the chromosome with more information and ensures convergence by using binary chromosomes and expressing alleles with the probability of the gene in different states. The chromosome is evolved through rotation. Global search capability and convergence speed are improved. The effectiveness of the improved approach is demonstrated based on its application to knapsack problem.

Reviews

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