| 旋转货架拣选作业优化的交叉蚁群算法求解 |
| |
| 引用本文： | 田炳丽,刘常波,解贵新. 旋转货架拣选作业优化的交叉蚁群算法求解[J]. 现代电子技术, 2008, 31(12): 161-164 |
| |
| 作者姓名： | 田炳丽 刘常波 解贵新 |
| |
| 作者单位： | 1. 青岛海军潜艇学院作战指挥系,山东,青岛266071
2. 海军潜艇学院,山东,青岛266071 |
| |
| 摘 要： | 单伺服机分层水平旋转货架存取路径优化问题是一个特殊的TSP问题,为NP完全难题。使用蚁群算法来求解该问题,搜索时间长、收敛速度慢、易陷于局部最优解。为此,根据遗传算法中的交叉操作对该算法进行了改进,构造交叉蚁群算法,并进行计算机仿真,结果表明该算法能较快地找到最优解。
|
| 关 键 词： | 交叉蚁群算法 蚁群算法 遗传算法 分层水平旋转货架 拣选路径优化 |
| 文章编号： | 1004-373(2008)12-161-04 |
| 修稿时间： | 2007-11-29 |
Crossover Self - adaptive Ant Colony Algorithm Solving the Order - picking Optimization of a Multi- carousel Single Server |
| |
| TIAN Bingli,LIU Changbo,XIE Guixin. Crossover Self - adaptive Ant Colony Algorithm Solving the Order - picking Optimization of a Multi- carousel Single Server[J]. Modern Electronic Technique, 2008, 31(12): 161-164 |
| |
| Authors: | TIAN Bingli LIU Changbo XIE Guixin |
| |
| Abstract: | The order-picking optimization for a multi-carousel single server system is a special TSP problem,which is a NP complete problem.The ant system algorithm is applied to resolve this problem in this paper.But,the algorithm has several shortages including long searching time,slow convergence rate and limiting to local optimal solution easily.So,on the bases of the operation of the crossover of the genetic alogorithm,a crossover ant colony algorithm is constructed.Simulation examples show that the optimal result can be obtained quickly using this method. |
| |
| Keywords: | crossover ant colony algorithm ant colony algorithm genetic algorithm multi carousel single server order-picking optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
