Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Sakawa, M. (2000). Genetic Algorithms with Decomposition Procedures. In: Large Scale Interactive Fuzzy Multiobjective Programming. Studies in Fuzziness and Soft Computing, vol 48. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1851-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1851-2_7
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-662-00386-2
Online ISBN: 978-3-7908-1851-2
eBook Packages: Springer Book Archive