Research on the Order Picking Optimization Problem of the Automated Warehouse

摘要：

The increased use of automated storage and retrieval systems (AS/RS) is creating the need for computerized control algorithms to support the scheduling and picking decisions. This research addresses an order picking problem in a multi-aisle automated warehouse, in which a stack crane performs storage and retrieval operations, and each item can be found in several storage locations. Our objective is to propose algorithms that minimize the total time traveled by the stack crane to complete the retrieval process of orders. The traveling salesman problem (TSP) can calculate the shortest distance between cities, order picking problem of the automated warehouse and the TSP are similar. In this paper, we use recursive algorithm to solve order picking problem. The experiment proved that the order picking optimization of the stacker systems will be of great significance for the RS to improve its efficiency. Finally, the recursive algorithm has been applied to practice.

关键词： AS/ RS TSP Stack Crane Recursive Algorithm Picking Optimization

作者: Ma Shuhua Hao Yanzhu

作者单位: Northeastern University at Qinhuangdao, China, Qinhuangdao 066004 Northeastern University, Shenyang 110004, China

会议类型: 国际会议

会议名称: 2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)

会议地点: 广西桂林

会议语种:英文

页码: 990-993

在线出版日期: 2009-06-17（万方平台首次上网日期，不代表论文的发表时间）