Genetic Algorithms for Integer Programming
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.
KeywordsGenetic Algorithm Integer Programming Reference Solution Knapsack Problem Decode Algorithm
Unable to display preview. Download preview PDF.