DocumentCode
2326335
Title
Mapping, order-independent genes and the knapsack problem
Author
Hinterding, Robert
Author_Institution
Victoria Univ. of Technol., Melbourne, Vic., Australia
fYear
1994
fDate
27-29 Jun 1994
Firstpage
13
Abstract
This paper uses the simple structure of the knapsack problem to study the issues of mapping and representation for genetic algorithms. Two genetic algorithms using different mappings were implemented to solve the problem. In one of these, neither the order nor the position of the genes is significant. Both of the genetic algorithms perform well on the problem, and we attribute the divergent parameter settings to the different mappings
Keywords
genetic algorithms; operations research; optimisation; algorithm mapping; algorithm representation; divergent parameter settings; gene order; gene position; genetic algorithms; knapsack problem; order-independent genes; Biological cells; Decoding; Genetic algorithms; Genetic mutations; Law; Legal factors; Polynomials; Search methods; Stochastic processes; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-1899-4
Type
conf
DOI
10.1109/ICEC.1994.350050
Filename
350050
Link To Document