Genetic Algorithms for Solving a Class of Constrained Nonlinear Integer Programs (original) (raw)

We consider a class of constrained nonlinear integer programs, which arise in manufacturing batch-sizing problems with multiple raw materials. In this paper, we investigate the use of genetic algorithms (GAs) for solving these models. Both binary and real coded genetic algorithms with six different penalty functions are developed. The real coded genetic algorithm works well for all six penalty functions compared to binary coding. A new method to calculate the penalty coef®cient is also discussed. Numerical examples are provided and computational experiences are discussed.