Abstract
This chapter is the integer version of Chapter 3, and genetic algorithms with double strings (GADS) for 0–1 programming problems are extended to deal with integer 0–1 programming problems. New decoding algorithms for double strings using reference solutions with the reference solution updating procedure are proposed especially so that individuals are decoded to the corresponding feasible solution for integer programming problems. 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
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sakawa, M. (2002). Genetic Algorithms for Integer Programming. In: Genetic Algorithms and Fuzzy Multiobjective Optimization. Operations Research/Computer Science Interfaces Series, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1519-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1519-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5594-6
Online ISBN: 978-1-4615-1519-7
eBook Packages: Springer Book Archive