用自适应的多种群蚁群算法求解频率分配问题  

Solving frequency assignment problem using an adaptive multiple-colony ant algorithm

作　　者：章春芳[1] 陈崚[1] 陈娟[1] 

机构地区：[1]扬州大学信息工程学院,江苏扬州225009

出　　处：《计算机应用》2005年第7期1641-1644,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60074013);国家科技攻关计划项目(2003BA614A14);江苏省教育厅自然科学基金项目(02KJB520009)

摘　　要：提出一种自适应的多种群蚁群算法求解移动通信中的频率分配问题。该算法改变了传统蚁群算法只有一个蚂蚁群体的做法,使用多个蚂蚁子群体同时进行优化处理。为每个蚂蚁子群体定义一个收敛系数,根据收敛系数来决定子群体内部的路径选择和信息量更新、子群体间的信息交流策略,同时采用自适应的信息更新策略以取得各蚂蚁子群体中解的多样性和收敛性之间的动态平衡。通过对固定频率分配和最小跨度频率分配问题进行仿真的实验,表明此算法不仅具有较强的全局收敛性,而且有更快的寻优速度。An adaptive multiple colony ant algorithm was presented to solve frenquency assignment problem of mobile communicaiton. Unlike the traditional ant colony algorithm which used only one ant colony, our algorithm used multiple ant colonies. For each ant colony, a coefficient of convergence was defined by which the ants adaptively could choose the path, update their local pheromone and exchange information between colonies. By using the adaptive strategy to update the pheromone, the balance between the diversity and convergence of every ant colony was kept. The simulation results on the fixed frequency assignment problem and minimal span frequency assignment problem show that our algorithm has global convergence and higher speed of optimization.

关 键 词：蚁群算法 多种群 收敛系数 自适应 频率分配 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程] TP393.07[自动化与计算机技术—控制科学与工程]