Mapping, order-independent genes and the knapsack problem

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.<
>