Optimization Analysis Of Compact Storage And Retrieval System Picking Path Based On Ant Colony Algorithm

As one of the core operation links of Storage and Retrieval System, picking directlyaffects the response speed and operation cost of the whole Storage and Retrieval System.Along with increasing demand of reducing logistics cost and customer service quality,Storage and Retrieval System is marching toward storage space compact and responsetime reduction. In the circumstances of storage space compact, to further reduce thepicking time cost to improve the overall efficiency of Storage and Retrieval System hasimportant significance. Therefore, this paper selects picking path optimization problem ofcompact Storage and Retrieval System as research object, and carry out research andanalysis.This thesis mainly studies two forms of Compact Storage and Retrieval System:mobile shelf Storage and Retrieval Systems and the hierarchical rotary shelf Storage andRetrieval Systems. First, this paper boils down the picking problems of compact Storageand Retrieval Systems to a kind of TSP problem, and set up two forms of picking problemmodel of compact Storage and Retrieval Systems based on TSP problem basic model.Second, considering the superior of the ant colony algorithm to solve TSP problem, thispaper designs and realizes three kinds of ant colony algorithm (AS, EAS, ASrank), appliesthem to the solves of the picking problems of mobile shelf Storage and Retrieval Systems,improves these three kind of algorithm and applies them to the solves of the picking ofhierarchical rotary shelf Storage and Retrieval Systems, and comprehensively evaluate theadvantage and disadvantage of all kinds of algorithm on solving picking problems. Finally,this article compares the results of ant colony algorithm with greedy algorithm, returnstrategy, S shape strategy and order picking strategy, and concludes the path optimizationstrategy.