Integrating storage, transport, dispensing, management, automated storage and retrieval system has manage benefit, such as great capability, small acreage, simple operation, embedding with ERP system. Based on one warehouse, we develop the crane control system and carousel control system and present loop-like route, floor-order insert algorithm, improved genetic algorithm using in optimization problem with capability limitation, S-OPA allocation, and dynamic optimal algorithm of work routeIt is a system engineering to design and optimize the control system of automated storage and retrieval system, integrating logistic technology, automation technology, computer technology, communication technology, intelligence optimization and so on. An excellent algorithm can advance the efficiency with no increasing hardware cost, but the algorithm can not be suitable for some special system..For the whole warehouse and control system, we build the local control layer, stakeout control layer, data management layer and enterprise operation layer is based on modern logistic thinking. Then, we analyze the flow of automated storage, automated retrieval, and checkage.For the crane, we do some research as follow: (1) We present the mathematic of the order-picking route optimization is the Euclidean traveling salesman problem. The loop-like route and floor-order insert algorithm are present. They can advance the efficiency of the warehouse system by simulation. The floor-order insert algorithm has better results than the algorithm introduced by paper [23] and [24], and it is much simple. (2) To resolve the pick-order route problem with box capability limitation, a new mathematical model is present, and then an improved algorithm based on genetic algorithm was present to solve the problem. (3) A new model is build to search the optimal route for unit stoker. The result shows that this problem is a multiple traveling salesman problem, but the difference number between every time to travel is less than or equal to one. This problem can be easily solved by genetic algorithm. |