Genetic Algorithms with Decomposition Procedures

  • Masatoshi Sakawa
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 48)


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.


Genetic Algorithm Knapsack Problem Decode Algorithm Decomposition Procedure Roulette Wheel Selection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Physica-Verlag Heidelberg 2000

Authors and Affiliations

  • Masatoshi Sakawa
    • 1
  1. 1.Department of Industrial and Systems EngineeringFaculty of Engineering Hiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations