关键词: 自动化导引车, 货区布局, 遍历, 最短路径, 遗传算法, 优先权, 自动化仓库

Abstract: A block-layout based routing problem of network configurations in an automation warehouse, plant or terminal is considered as an automated local logistics storage system. It aims at finding out the shortest path that traverses all blocks. A mixed-integer linear program is established to formulate the problem under the minimization of the path. Besides, a priority-based genetic algorithm is developed and realized using the tool of Matlab to solve the model. In the end, the genetic operators are analyzed by experimental comparisons and the algorithm is validated by experiments.

Key words: automated guided vehicle, block-layout, traversing, shortest path, genetic algorithm, priority, automated warehouse