The class-based storage assignment policy is one of the important policies in the automated storage/retrieval system(AS/RS).In this system,the joint optimization for storage and retrieval request scheduling and the location assignment plays the critical role of enhancing the operational efficiency of AS/RS and improving customer satisfaction,with the consideration of constraints on the classification of torage/retrieval requests.Using real-world multi-aisle AS/RS as the object,a dynamic programming model incorporating an integer linear programming model was established to minimize the weighted sum of request completion time and tardiness time.A matheuristic algorithm based on an assignment problem model and a memetic algorithm was designed to solve the problem.In the matheuristic algorithm,a new type of storage/retrieval request pairing metric based on Hamming distance was introduced according to the rack partition characteristics.The subproblem of storage request sequencing was transformed into an assignment problem,which integrated with the memetic algorithm to optimize the subproblem of retrieval request sequencing,allocation,and location assignment.The computational experiments show that the matheuristic algorithm has good optimization performance and the proposed optimization method of storage request sequencing can effectively reduce the completion time and tardiness time of the request.
关键词
AS/RS/交叉存取/分类存储/出入库任务调度/货位分配/数学规划启发式算法
Key words
AS/RS/dual command/class-based storage/storage and retrieval request scheduling/location assignment/matheuristic algorithm
维普
万方数据