An Improved Method for Solving SPP Based On ACO Algorithm

摘要：

An improved ant colony optimization algorithm is presented, which aims at the drawback of ant colony optimization algorithm in solving Set Partition Problem of discrete elements. In each iteration of the algorithm, the influence of larger element to set partition was eliminated by pre-processing firstly, and then subsets of the set are constructed reasonably according to the dynamic capacity of monitoring standards and the process of postprocessing algorithm. The result of experiment indicate that this algorithm has better efficiency and lower time and space complexity than particle swarm optimization algorithm and genetic algorithm.

关键词： Ant colony optimization algorithm Combinatorial optimization Set partitioning problem Dynamic capacity control standards Discrete elements

作者: Zhou Hong-yu Hong Mei

作者单位: Computer Science and Technology School of Computer (software), Sichuan University Chengdu, China

会议类型: 国际会议

会议名称: 2011 International Conference on Information and Industrial Electronics(2011年信息与工业电子国际会议 ICIIE 2011)

会议地点: 成都

会议语种:英文

页码: 295-299

在线出版日期: 2011-01-14（万方平台首次上网日期，不代表论文的发表时间）