Based on Genetic Algorithm Research of Stocker Picking Shortest Path
2012 ◽
Vol 155-156
◽
pp. 186-190
Keyword(s):
This paper analyzes characteristics of automated warehouse stocker picking operating process. Path optimization problem is considered as traveling salesman problem. The coordinates of picking points by calculating determine a stocker running route. The mathematical model of a path distance is built. And using the improved genetic algorithm solves the above problem. Finally, M-file program of stocker running path optimization is written and run in MATLAB. The simulation results that, in solving stocker path optimization problem, it can search for a shortest path by genetic algorithm. Thereby enhance the efficiency of automated warehouse system, increase greater benefits of the enterprise.
2014 ◽
Vol 926-930
◽
pp. 3637-3640
2015 ◽
Vol 2015
◽
pp. 1-6
◽
2014 ◽
Vol 536-537
◽
pp. 845-848
Keyword(s):
2019 ◽
Vol 2019
◽
pp. 1-11
◽
2014 ◽
Vol 4
(4)
◽
pp. 47-53
◽
2009 ◽
pp. 1549-1560
◽