A set-oriented genetic algorithm and the knapsack problem

Genetic algorithms (GAs) have been used to solve NP-complete problems, such as the knapsack problem, effectively. One difficulty in applying GAs to the knapsack problem is that the bit-string representation of the canonical GA chromosome does not provide a direct mapping of the problem on to the GA chromosome. In this paper, a new chromosome representation of the GA is proposed, called the "set-oriented GA". A chromosome in the set-oriented GA is a set, while in the canonical GA it is a bit-string. Crossover and mutation operators are described using the combinations of set operations, such as union, intersection and complement. A performance comparison of the canonical GA and the set-oriented GA on the knapsack problem is presented. The set-oriented GA turns out to be not only effective in representing the problem but also efficient in finding the solution.

[1]  Robert Hinterding,et al.  A genetic algorithm for stock cutting: an exploration of mapping schemes1 , 1993 .

[2]  G. Raidl,et al.  An improved genetic algorithm for the multiconstrained 0-1 knapsack problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[3]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[4]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[5]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[6]  Robert Hinterding,et al.  Mapping, order-independent genes and the knapsack problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  L. Darrell Whitley,et al.  A note on the performance of genetic algorithms on zero-one knapsack problems , 1994, SAC '94.

[10]  R. Spillman.  Solving large knapsack problems with a genetic algorithm , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[11]  Charles C. Palmer,et al.  Representing trees in genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[12]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[13]  Thomas Bäck,et al.  The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[14]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[15]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..