Solving Stereo Warehouse Storage Location Assignment Problem Based on Genetic Algorithm

Abstract

Class-based stereo warehouse storage policy distributes products among a number of classes and for each class it reserves a region within the storage area. In this paper, a genetic algorithm method of using the intersectant operation of chromosome repair and mutation operation of two-way movement detection is developed to solve an integer programming model for storage assignment. Computational experience on randomly generated data sets and an industrial case shows that improved genetic algorithm gives superior results than the genetic algorithm without improving for storage location assignment with ordering restriction.