Applying genetic algorithms to dynamic lot sizing with batch ordering

In this paper, genetic algorithms are applied to the deterministic time-varying lot sizing problem with batch ordering and backorders. Batch ordering requires orders that are integer multiples of a fixed quantity that is larger than one. The developed genetic algorithm (GA) utilizes a new ‘012’ coding scheme that is designed specifically for the batch ordering policy. The performance of the developed GA is compared to that of a modified Silver–Meal (MSM) heuristic based on the frequency of obtaining the optimum solution and the average percentage deviation from the optimum solution. In addition, the effect of five factors on the performance of the GA and the MSM is investigated in a fractional factorial experiment. Results indicate that the GA outperforms the MSM in both responses, with a more robust performance. Significant factors and interactions are identified and the best conditions for applying each approach are pointed out.