蚁群优化算法在求解随机组合优化问题中的应用综述  

Survey on ant colony optimization algorithms for stochastic combinatorial optimization

作　　者：李凯齐[1,2] 刁兴春[2] 曹建军[2] 

机构地区：[1]解放军理工大学指挥自动化学院,南京210007 [2]总参第六十三研究所,南京210007

出　　处：《计算机应用研究》2010年第12期4406-4409,共4页Application Research of Computers

基　　金：中国博士后科学基金资助项目(20090461425);江苏省博士后科研计划资助项目(0901014B)

摘　　要：不确定条件下的优化问题更贴近真实世界环境,因而日益受到广泛关注。综述了蚁群优化在求解一组不确定条件下的组合优化问题,即随机组合优化问题方面的应用。首先介绍了不确定条件下组合优化问题的概念分类模型,给出了随机组合优化问题的一般定义;然后指出了其与求解传统确定性组合优化问题的不同之处,即目标函数的计算存在不确定性,并详细论述了目前解决方法的进展;最后分析了该领域值得重点关注的几个研究方向,并对其未来发展进行了展望。The optimization problem under uncertainty because of its closer to the real world environment,thus have become a growing reasearch area recently. This paper thoroughly reviewed ant colony optimization algorithms,and their applications to the class of stochastic combinatorial optimization problems under uncertainty conditions. Firstly,introduced the conceptual classification model for combinatorial problems under uncertainty conditions and a general definition for the stochastic combina-torial optimization problem. Then,pointed out the main difference between stochastic combinatorial optimization problem and deterministic combinatorial optimization problem,that was the computation of the objective function under uncertainty,and then summarized the current solutions for solvins this problem. Finally,proposed several possible research directions and the expectations of the development in this area.

关 键 词：蚁群优化 随机 不确定性 组合优化 特定近似 采样近似 

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