基于新颖蚁群算法的加工中心组成问题研究  

A study of the cell formation problems based on a novel ant colony algorithm

作　　者：吕聪颖[1] 

机构地区：[1]南阳理工学院计算机与信息工程学院,河南南阳473000

出　　处：《计算机工程与科学》2015年第9期1712-1717,共6页Computer Engineering & Science

基　　金：国家自然科学基金青年基金资助项目(81101490);国家自然科学基金资助项目(61175023)

摘　　要：针对蚁群算法求解加工中心组成问题易陷入早熟收敛状态的缺点,提出了将听觉信号、记忆矩阵与蚁群算法相融合的一种新颖蚁群算法。在仿真实验中,分别采用蚁群算法、加入听觉信号的蚁群算法、加入记忆矩阵的蚁群算法和新颖蚁群算法对加工中心组成问题进行求解。实验结果表明,新颖蚁群算法能够有效提高蚁群算法的全局寻优能力,收敛速度快,且所求得的组功效优于以上三个策略及以往的混合遗传算法。The ant colony algorithm for solving cell formation problems tends to fall into early mature convergence status. In order to overcome this defect, we propose a mixed algorithm of the ant colony al- gorithm, the auditory signal and the memory matrix. In the simulation experiments, the ant colony al- gorithm, the ant colony algorithm containing auditory signals, the ant colony algorithm containing mem- ory matrixes, and the proposed novel algorithm are adopted respectively to solve cell formation prob- lems. Experimental results show that the proposed algorithm outperforms the other three in terms of en- hancing global optimization capacity and convergence speed of the ant colony algorithm. At the same time, the group efficiency obtained by the proposed algorithm is better than the three aforementioned al- gorithms and the existing hybrid genetic algorithms.

关 键 词：新颖蚁群算法 信息素 听觉信号 记忆矩阵 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]