跳到主要导航 跳到搜索 跳到主要内容

An ant colony optimization heuristic for solving maximum independent set problems

  • Xi'an Jiaotong University
  • Shanxi University

科研成果: 书/报告/会议事项章节会议稿件同行评审

41 引用 (Scopus)

摘要

In this paper, ant colony optimization heuristic is extended for solving maximum independent set (MIS) problems. MIS problems are quite different from the travelling salesman problems (TSP) etc., in which no concept of "path or order" exists in its solutions. Based on such characteristics, the ant colony optimization heuristic is modified in this paper in the following ways: (i) a new computation method for heuristic information is adapted; (ii) the pheromone update rule is augmented; (iii) a complement solution construction process is designed. The simulation shows that the proposed ant colony optimization heuristic is effective and efficient for MIS problems.

源语言英语
主期刊名Proceedings - 5th International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2003
编辑Licheng Jiao, Xin Yao, Brijesh Verma, Henry Selvaraj
出版商Institute of Electrical and Electronics Engineers Inc.
206-211
页数6
ISBN(电子版)0769519571, 9780769519579
DOI
出版状态已出版 - 2003
活动5th International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2003 - Xian, 中国
期限: 27 9月 200330 9月 2003

丛书

姓名Proceedings - 5th International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2003

会议

会议5th International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2003
国家/地区中国
Xian
时期27/09/0330/09/03

学术指纹

探究 'An ant colony optimization heuristic for solving maximum independent set problems' 的科研主题。它们共同构成独一无二的学术指纹。

引用此