Please use this identifier to cite or link to this item:

Adaptive genetic algorithm and quasi-parallel genetic algorithm: application to knapsack problem

Authors Szeto, KY View this author's profile
Zhang, J.
Issue Date 2006
Source Lecture Notes in Computer Science , v. 3743, 2006, p. 189-196
Summary A new adaptive genetic algorithm using mutation matrix is introduced and implemented in a single computer using the quasi-parallel time sharing algorithm for the solution of the zero/one knapsack problem. The mutation matrix M(t) is constructed using the locus statistics and the fitness distribution in a population A(t) with N rows and L columns, where N is the size of the population and L is the length of the encoded chromosomes. The mutation matrix is parameter free and adaptive as it is time dependent and captures the accumulated information in the past generation. Two strategies of evolution, mutation by row (chromosome), and mutation by column (locus) are discussed. Time sharing experiment on these two strategies is performed on a single computer for solving the knapsack problem. Based on the investment frontier of time allocation, the optimal configuration for solving the knapsack problem is found.
ISSN 0302-9743
Rights The original publication is available at Please use the appropriate URL and/or DOI for the article. The access script to link to it is:
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
SzetoZhangSozopol.pdf 201107 B Adobe PDF