C. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva
{"title":"提高着色剂蚁群算法的性能","authors":"C. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva","doi":"10.1109/SCCC.2011.33","DOIUrl":null,"url":null,"abstract":"This paper presents the Color Ant-RT algorithm version 3, an algorithm for graph coloring problems which is based on the Ant Colony Optimization metaheuristic and uses Tabu Search as local search. The experiments demonstrated that ColorAnt3-RT is a promising option in finding good approximations to the best known results for geometric random, geometric standard and le450 graphs of DIMACS benchmark in an acceptable runtime, also, it is good in minimizing the amount of conflicts, the main problem of graph coloring with a fixed number of colors.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Toward Better Performance of ColorAnt ACO Algorithm\",\"authors\":\"C. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva\",\"doi\":\"10.1109/SCCC.2011.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the Color Ant-RT algorithm version 3, an algorithm for graph coloring problems which is based on the Ant Colony Optimization metaheuristic and uses Tabu Search as local search. The experiments demonstrated that ColorAnt3-RT is a promising option in finding good approximations to the best known results for geometric random, geometric standard and le450 graphs of DIMACS benchmark in an acceptable runtime, also, it is good in minimizing the amount of conflicts, the main problem of graph coloring with a fixed number of colors.\",\"PeriodicalId\":173639,\"journal\":{\"name\":\"2011 30th International Conference of the Chilean Computer Science Society\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 30th International Conference of the Chilean Computer Science Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2011.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 30th International Conference of the Chilean Computer Science Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2011.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Toward Better Performance of ColorAnt ACO Algorithm
This paper presents the Color Ant-RT algorithm version 3, an algorithm for graph coloring problems which is based on the Ant Colony Optimization metaheuristic and uses Tabu Search as local search. The experiments demonstrated that ColorAnt3-RT is a promising option in finding good approximations to the best known results for geometric random, geometric standard and le450 graphs of DIMACS benchmark in an acceptable runtime, also, it is good in minimizing the amount of conflicts, the main problem of graph coloring with a fixed number of colors.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
