文档介绍：Abstract
With the great development of the economic globalization and the merce, the requirement of logistics system is ing higher. Traditional logistics is faced with the situation of transforming to modern logistics. As a key link in modern logistics system, the operational efficiency of storage and distribution has a great important influence to the cost and petitiveness. In terms of the labor, picking can account for 60% of the total daily work in the warehouse. The cost of picking determines a lot of the total cost of the whole warehouse. So, it es very necessary to research the route optimization problem of the warehouse picking.
In this paper, we try to solve the route optimization problem of the Two-Block warehouse picking under limited vehicle capacity.
The Two-Block warehouse picking routing model under limited vehicle capacity is established with the goal to find the shortest picking path. At the same time, this paper also studies the basic principle, the advantages and disadvantages of Standard ic Algorithm and Greedy Algorithm. Finally, combining with the two algorithms above, this paper proposes a greedy ic algorithm to solve the picking routing problem. With the Two-Block warehouse as object to do simulation verification and analysis. The simulation results show that wonderful results are achieved in different scale of picking point. The proposed algorithm can greatly shorten the path picking vehicle travel distance, improves picking efficiency. The study has important significance for the optimization of warehouse picking routing.
Key Words: Order-picking route optimization; ic Algorithm; Greedy Algorithm; Capacitated loading
II
目录
第 1 章绪论............................................................................................................................ 1
本文的研究背景............................................................................................................... 1
本文的主要研究内容...........................................