Research On Optimization Method Of Picking Routing In The Warehouse Based On Ant Colony Algorithm

More and more companies build warehouse and distribution system .They want to reduce logistics cost and maintain own competitiveness.As"third profit source", logistics get a lot of attention. Modern warehouse is logistics indispensable part.Picking is core operating in the warehouse. Picking cost accountes entire warehouse logistics cost 40%.Its efficiency direct influence entire warehouse efficiency. In order to improving picking efficiency, short picking path length is crucial.Firstly, the article analyzes warehouse picking path, research status and problems.Picking path related problems include picking workflow, typical dual district type warehouse and the factors which influenced picking efficiency. Secondly according double district type warehouse picking path problem characteristics, the problem depart to two situations,not consider picking-car's volume and consider picking-car's volume. Not consider volume situation, the article adopt Ant Colony Algorithm to solve this problem, and verify the results with S shaped heuristic algorithm's results. Finally for considering picking-car's volume situation, the artile apply Ant Colony Algorithm to solve picking routing problem modeling and realize the algorithm in Vsiua1C++6.0 platform, compare the results with Genetic Algorithm optimization results. We found in the table, when we pick more goods, the ACA have obvious advantage.