Genetic Algorithms with Decomposition Procedures
This chapter presents a detailed treatment of genetic algorithms with decomposition procedures as developed for large scale 0–1 knapsack problems with block angular structures. Through the introduction of a triple string representation and the corresponding decoding algorithm, it is shown that a potential solution satisfying not only block constraints but also coupling constraints can be obtained for each individual. The chapter also includes several numerical experiments.
KeywordsGenetic Algorithm Knapsack Problem Decode Algorithm Decomposition Procedure Roulette Wheel Selection
Unable to display preview. Download preview PDF.