求解最大独立集问题的蚁群优化启发式算法

Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003 Pub Date : 2003-09-27 DOI:10.1109/ICCIMA.2003.1238126

Youmei Li, Z. Xul

{"title":"求解最大独立集问题的蚁群优化启发式算法","authors":"Youmei Li, Z. Xul","doi":"10.1109/ICCIMA.2003.1238126","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"An ant colony optimization heuristic for solving maximum independent set problems\",\"authors\":\"Youmei Li, Z. Xul\",\"doi\":\"10.1109/ICCIMA.2003.1238126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":385362,\"journal\":{\"name\":\"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIMA.2003.1238126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.2003.1238126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 44

摘要

本文将蚁群优化启发式算法推广到求解最大独立集问题。MIS问题与旅行推销员问题(TSP)等问题有很大的不同，在这些问题的解中不存在“路径或顺序”的概念。基于这一特点，本文对蚁群优化启发式算法进行了如下改进:(1)采用了一种新的启发式信息计算方法;(ii)信息素更新规则增强;(三)设计了补解构建流程。仿真结果表明，提出的蚁群优化启发式算法对管理信息系统问题是有效的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An ant colony optimization heuristic for solving maximum independent set problems

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 Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003

自引率

0.00%

发文量