A class of genetic algorithms for multiple-level warehouse layout problems

A new kind of warehouse layout problem, the multiple-level warehouse layout problem, is investigated. Both horizontal and vertical travel costs need to be considered when making a layout. In the problem, unit travel costs are item-dependent and different items can be mixed in a cell. An IP model is proposed, which is shown to be NP-hard. An effective assignment method is presented and genetic algorithm heuristics are developed. Extensive computational experiments are conducted to verify the effectiveness of the algorithms.