Article ID: | iaor20031290 |
Country: | Netherlands |
Volume: | 42 |
Issue: | 2/4 |
Start Page Number: | 189 |
End Page Number: | 198 |
Publication Date: | Mar 2002 |
Journal: | Computers & Industrial Engineering |
Authors: | Sarker Ruhul A., Newton Charles |
Keywords: | genetic algorithms, lot sizing, batch size |
The purpose of this research is to determine an optimal batch size for a product and purchasing policy of associated raw materials. Like most other practical situations, this manufacturing firm has a limited storage space and transportation fleet of known capacity. The mathematical formulation of the problem indicates that the model is a constrained nonlinear integer program. Considering the complexity of solving such model, we investigate the use of genetic algorithms (GAs) for solving this model. We develop GA code with three different penalty functions usually used for constraint optimizations. The model is also solved using an existing commercial optimization package to compare the solution. The detailed computational results are presented.