求解多目标优化问题的改进蚁群算法  

Improved ant colony algorithm for multi-objective optimization

作　　者：孟岩[1] 刘希玉[1] 刘艳丽[1] 李镇 

机构地区：[1]山东师范大学管理与经济学院,山东济南250014 [2]山东省高速公路泰安管理处,山东泰安271000

出　　处：《计算机工程与设计》2008年第24期6327-6329,6333,共4页Computer Engineering and Design

基　　金：山东省自然科学基金重大项目(Z2004G02);山东省教育厅计划基金项目(J05G01);山东省中青年科学家奖励基金项目(031BS003)

摘　　要：蚁群算法是一种模拟蚂蚁行为进行优化的启发式优化算法,该算法在许多领域已经得到应用。针对多目标优化问题优化与求解较困难的问题,提出一种嵌入变尺度算法的改进蚁群算法用于求解,为蚁群算法在连续空间中的应用提供了一个可行的方案。给出了该算法的详细定义及实现步骤,实例仿真表明,该算法能加快收敛速率,对连续空间的蚁群算法研究具有重要的意义。Ant colony algorithm is a heuristic optimization algorithm, which simulates the behavior of ants to optimize problems. This algorithm is applied in many areas. With the problems of multi-objective optimization problems to be difficult to solve and optimize, an improved algorithm for solving them is put forward, which can provide a viable option for ant colony algorithm in the application of continuous space. The algorithm has given a detailed definition and implementation steps, and the simulation shows its effectiveness, and that it can accelerate the convergence rate. This algorithm has an important significance for ant colony algorithm research in continuous space.

关 键 词：蚁群算法 多目标优化 连续空间优化 进化计算法 变尺度法 

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