Genetic algorithms in lot sizing decisions

Abstract

This paper presents a genetic algorithm approach for the lot sizing problem. The lot sizing problem is defined as obtaining the order quantities for an uncapacitated, no shortages allowed, single-item, and single-level case. Experimentation was conducted to evaluate how different aspects of the genetic algorithm affect the results. In particular it was observed how scaling has the biggest impact.