期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Applying the Method for Solving Traveling Salesman Problem Based on Backtracking Algorithm to Order Picking 被引量:1
1
作者 Jie Zhu Ying Huang Lijuan Xu 《Open Journal of Optimization》 2016年第2期84-89,共6页
In the distribution center, the way of order picking personnel to pick goods has two kinds: single picking and batch picking. Based on the way of the single picking and assumed warehouse model, in order to reduce the ... In the distribution center, the way of order picking personnel to pick goods has two kinds: single picking and batch picking. Based on the way of the single picking and assumed warehouse model, in order to reduce the walking path of order picking, the order picking problem is transformed into the traveling salesman problem in this paper. Based on backtracking algorithm, the order picking path gets optimized. Finally verifing the optimization method under the environment of VC++6.0, order picking path in the warehouse model get optimized, and compared with the traditional order picking walking paths. The results show that in small and medium-sized warehouse, the optimization method proposed in this paper can reduce order picking walking path and improve the work efficiency as well as reduce the time cost. 展开更多
关键词 single Picking Path Optimization Traveling Salesman Problem Backtracking Algorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部