Author(s)

Jie Zhu, Ying Huang^*, Lijuan Xu

School of Information, Beijing Wuzi University, Beijing, China.

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

Zhu, J. , Huang, Y. and Xu, L. (2016) Applying the Method for Solving Traveling Salesman Problem Based on Backtracking Algorithm to Order Picking. Open Journal of Optimization, 5, 84-89. doi: 10.4236/ojop.2016.52010.