计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (15): 64-66.DOI: 10.3778/j.issn.1002-8331.2009.15.019

• 研究、探讨 • 上一篇    下一篇

蚁群算法在冗余系统可靠性最优分配上的应用

程世娟1,2,卢 伟3,何 平2   

  1. 1.西南交通大学 应用力学与工程系,成都 610031
    2.西南交通大学 应用数学系,成都 610031
    3.西华大学 数学与计算机学院,成都 610039
  • 收稿日期:2008-06-24 修回日期:2008-09-16 出版日期:2009-05-21 发布日期:2009-05-21
  • 通讯作者: 程世娟

Ant colony optimization on reliability optimization of redundancy allocation problem

CHENG Shi-juan1,2,LU Wei3,HE Ping2   

  1. 1.Department of Applied Mechanics and Engineering,Southwest Jiaotong University,Chengdu 610031,China
    2.Department of Applied Mathematics,Southwest Jiaotong University,Chengdu 610031,China
    3.College of Computer and Mathematics,Xihua University,Chengdu 610039,China
  • Received:2008-06-24 Revised:2008-09-16 Online:2009-05-21 Published:2009-05-21
  • Contact: CHENG Shi-juan

摘要: 针对各种进化算法所存在的早熟收敛,易陷人局部极值点的缺点,采用两种不同的状态转移规则和与系统属性紧密相关的信息素更新规则,用蚁群算法解决元件可选择不同类型的最优冗余分配问题,实例仿真结果表明蚁群算法可以在相对短的时间内较快的找到问题的最优解。

关键词: 蚁群算法, 冗余系统分配问题, 状态转移规则, 信息素更新规则

Abstract: Many heuristic algorithms had some flaws such as early convergence and easily falling in local peak.A ant colony optimization with identical state transition rules and pheromone updating rule is used to solve this problem.The experiment data showed that the ant colony optimization is an effective way to solve the redundancy allocation problem,which found the optimal solution in a relative short time.

Key words: ant colony optimization, Redundancy Allocation Problem(RAP), state transition rule, pheromone update rule