集合划分问题的蚁群算法  

An Ant Colony Algorithm for Set Partition Problem

作　　者：高尚[1] 侯志远[1] 

机构地区：[1]江苏科技大学电子信息学院

出　　处：《航空计算技术》2006年第2期126-128,共3页Aeronautical Computing Technique

摘　　要：集合划分问题是一个典型的NP完全问题,建立了集合划分问题的优化数学模型,采用蚁群算法解决了此问题。对蚁群算法参数的合理选取进行了实验分析,给出了算法参数选取的基本原则。与贪心法作了比较,结果表明该方法比较有效。The set partition problem is a typical NP - Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem. Experimental analyses are carried out on the reasonable selection on the parameters of ant colony algorithm through an example, and basic principles for the parameter selection are provided. Compared with greedy methods, its effectiveness is illustrated through result.

关 键 词：集合划分问题 蚁群算法 贪心法 模拟退火算法 

分 类 号：O22[理学—运筹学与控制论]