Path Planning of AS/RS Based on Cost Matrix and Improved Greedy Algorithm

Abstract

Logistics plays an important role in the field of global economy, and the storage and retrieval of tasks in a warehouse which has symmetry is the most important part of logistics. Generally, the shelves of a warehouse have a certain degree of symmetry and similarity in their structure. The storage and retrieval efficiency directly affects the efficiency of logistics. The efficiency of the traditional storage and retrieval mode has become increasingly inconsistent with the needs of the industry. In order to solve this problem, this paper proposes a greedy algorithm based on cost matrix to solve the path planning problem of the automatic storage and retrieval system (AS/RS). Firstly, aiming at the path planning mathematical model of AS/RS, this paper proposes the concept of cost matrix, which transforms the traditional storage and retrieval problem into the element combination problem of cost matrix. Then, a more efficient backtracking algorithm is proposed based on the exhaustive method. After analyzing the performance of the backtracking algorithm, combined with some rules, a greedy algorithm which can further improve efficiency is proposed; the convergence of the improved greedy algorithm is also proven. Finally, through simulation, the time consumption of the greedy algorithm is only 0.59% of the exhaustive method, and compared with the traditional genetic algorithm, the time consumption of the greedy algorithm is about 50% of the genetic algorithm, and it can still maintain its advantage in time consumption, which proves that the greedy algorithm based on cost matrix has a certain feasibility and practicability in solving the path planning of the automatic storage and retrieval system.

Benefits and Challenges of Implementing Autonomous Technology for Sustainable Material Handling in Industrial Processes

“…The complete autonomy of material handling and transportation, which enables them to operate around the clock without the need for employees' involvement, constitutes one of the main advantages of using AMRs. Reduced employee engagement results in economic benefits (i.e., salaries are eliminated) and environmental benefits (i.e., hydrogen and other renewable energy resources can be used) [19,21]. In this way, including staff members in enjoyable tasks, giving those opportunities for advancement and education, and teaching them ways to use materials as sustainably as possible significantly contribute to social sustainability.…”

“…In this way, including staff members in enjoyable tasks, giving those opportunities for advancement and education, and teaching them ways to use materials as sustainably as possible significantly contribute to social sustainability. Due to these and other advantages, two of the biggest customer services companies in the world, Alibaba and Amazon, have engaged a significant number of AMRs to increase the effectiveness of material handling operations in response to rising urbanization and e-commerce needs, of which Amazon has more than 200,000 units [11,21].…”

“…This process becomes more challenging since autonomous material handling is favored. Nonetheless, in the selection of sustainable material handling solutions, engineers frequently employ the sources, components, and practical guidelines listed below in professional circumstances [21,26]:…”

An Efficient Approach to Investigate the Tradeoff between Double Handling and Needed Capacity in Automated Distribution Centers

“…They presented a method for calculating energy consumption and predicting storage space for each configuration. The costs were also reduced by investigating the path planning problem of AS/RS [22]. Zaerpour et al [23] proposed a decision tool for selecting the appropriate type of storage system that minimizes investment and operational costs while meeting warehouse design requirements, specifically storage capacity and throughput.…”

Integrated Optimization of Input/Output Point Assignment and Twin Stackers Scheduling in Multi-Input/Output Points Automated Storage and Retrieval System by Ant Colony Algorithm

“…If both are present, the makespan can be reduced by alternating storage request and retrieval request [14]. Based on the feature that the S/R requests appear in pairs, the bipartite graph of S/R request node [16] and cost matrix are constructed [17]. e Hungarian algorithm and the greedy algorithm are used, respectively, to pair the S/R requests in the same command cycle to minimize the makespan.…”