基于混合蚁群算法的WTA问题求解  

A Commingled Ant Colony Optimization Algorithm for Solving WTA Problem

作　　者：范洁[1] 刘玉树[1] 龚元明[1] 陈云飞[1] 

机构地区：[1]北京理工大学计算机科学与工程系,北京100081

出　　处：《计算机工程与应用》2005年第10期59-61,共3页Computer Engineering and Applications

基　　金：部委"十五"预研项目

摘　　要：武器-目标分配问题(Weapon-TargetAssignmentProblem)是一种典型的NP问题。该文提出了一种基于遗传算法和蚁群算法的混合算法(GAACO)以解决武器-目标分配问题。首先,使用遗传算法对火力分配问题形成初始解;然后,将遗传算法的结果传递给改进的蚁群算法,对问题求精确解。实验结果表明该算法求精度优于遗传算法,时间性能优于传统蚁群算法。W eapon-Target Assignm ent problem (W TA )is NP hard.A com m ingled ant colony optim ization algorithm (GAA - CO )is proposed which com bines the genetic algorithm and the ant colony optim ization to solve the W TA problem .First- ly,Get a original result of the W TA Problem by using genetic Algorithm ;Secondly,Transfer the result of genetic algo- rithm to the im proved ant colony optim ization and get a accurate result of the W TA problem .Experim ents dem onstrate that the GA ACO algorithm can get m ore accurate result than GA and use less tim e than the traditional ACO algorithm .

关 键 词：WTA问题 蚁群算法 遗传算法 

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