计算机工程与应用2016，Vol.52Issue(12)：31-36,6.DOI:10.3778/j.issn.1002-8331.1512-0057
自动化仓库巷道网络AGV货区遍历优化--设计基于优先权遗传算法实现
Priority-based genetic algorithm for routing automated guided vehicles for traversing blocks in warehouse aisles
摘要
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分类
管理科学引用本文复制引用
侯晓琴,胡志华,高超峰,罗勋杰..自动化仓库巷道网络AGV货区遍历优化--设计基于优先权遗传算法实现[J].计算机工程与应用,2016,52(12):31-36,6.基金项目
国家自然科学基金青年项目（No.71101088）；国家自然科学基金面上项目（No.71471109）；上海市曙光计划项目（No.13SG48）；上海市教委科研创新项目（No.14YZ100）；交通部应用基础研究项目（No.2015329810260）。 （）
