A Realization of Optimal Order-Picking for Irregular Multi-Layered Warehouse

This paper proposed a method to realize irregular stereoscopic warehouse layout diagram and presented an algorithm to calculate the minimum distance between every two storage points. In this method, the components of the warehouse were defined as passage, shelf, storage point and node. Passage is a roadway by which the operator can access goods stored on shelf. Node is the intersection of a vertical passage and a horizontal passage. To retrieve the goods stored at storage point, the operator must pass by passage and node. As we know, the number of nodes is much smaller than the number of storage points, so, we can simplify the computing of the shortest route between every two goods items in an order by computing and storing the shortest route between every two nodes. Based on this idea, this paper presented an algorithm to initialize the warehouse layout diagram and to find the adjacency relationship between the elements and to compute the shortest route between every two storage points. On this foundation, a hybrid genetic algorithm was given to solve the optimizing order-picking problem of irregular multi-layered warehouse. After then, an order-picking system based on C/S structure was given to guide the operator´s work.