{"title":"图着色问题的蚁群算法","authors":"Ehsan Salari, K. Eshghi","doi":"10.1109/CIMA.2005.1662331","DOIUrl":null,"url":null,"abstract":"Ant colony optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to max-min ant system structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem","PeriodicalId":306045,"journal":{"name":"2005 ICSC Congress on Computational Intelligence Methods and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"73","resultStr":"{\"title\":\"An ACO algorithm for graph coloring problem\",\"authors\":\"Ehsan Salari, K. Eshghi\",\"doi\":\"10.1109/CIMA.2005.1662331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ant colony optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to max-min ant system structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem\",\"PeriodicalId\":306045,\"journal\":{\"name\":\"2005 ICSC Congress on Computational Intelligence Methods and Applications\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"73\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 ICSC Congress on Computational Intelligence Methods and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIMA.2005.1662331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 ICSC Congress on Computational Intelligence Methods and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIMA.2005.1662331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ant colony optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to max-min ant system structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms of the graph coloring problem
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
