Adaptive genetic algorithm for lot-sizing problem with self-adjustment operation rate

This paper presents a new adaptive genetic algorithm (GA) to escape local optimum solutions of the traditional lot-sizing rules. In this GA, the timing of replenishment is encoded as a string of binary digits (a chromosome). Each gene in that chromosome stands for a period. Standard GA operators are used to generate new populations. These populations are evaluated by a fitness function using the replenishment scheme of solution based on the total cost. Through this evaluation, the rates of GA operators for the next generation are automatically adjusted based on the rate of survivor offsprings, which are generated by corresponding operators. The oriented search procedure using these self-adjustment rates of operator schemes can give faster and better solutions. Some experimental results confirm the theoretical judgment.