和着色问题的最大-最小蚂蚁系统

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI:10.1109/CCCA.2011.6031417

Douiri Sidi Mohamed, S. Elbernoussi

{"title":"和着色问题的最大-最小蚂蚁系统","authors":"Douiri Sidi Mohamed, S. Elbernoussi","doi":"10.1109/CCCA.2011.6031417","DOIUrl":null,"url":null,"abstract":"The sum coloring problem (MSCP) is an NP-hard problem derived from the graphs coloring (GCP). The problem (MSCP) consists in minimizing the sum of colors in a graph. Our resolution approach is based on an hybridization of Max-Min Ant System (MMAS) an extension of Ant System and a local heuristic based on an improvement of the maximal independent set algorithm given by F. Glover[4].","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Max-Min Ant System for the sum coloring problem\",\"authors\":\"Douiri Sidi Mohamed, S. Elbernoussi\",\"doi\":\"10.1109/CCCA.2011.6031417\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The sum coloring problem (MSCP) is an NP-hard problem derived from the graphs coloring (GCP). The problem (MSCP) consists in minimizing the sum of colors in a graph. Our resolution approach is based on an hybridization of Max-Min Ant System (MMAS) an extension of Ant System and a local heuristic based on an improvement of the maximal independent set algorithm given by F. Glover[4].\",\"PeriodicalId\":259067,\"journal\":{\"name\":\"2011 International Conference on Communications, Computing and Control Applications (CCCA)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Communications, Computing and Control Applications (CCCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCCA.2011.6031417\",\"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 International Conference on Communications, Computing and Control Applications (CCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCA.2011.6031417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

和着色问题(MSCP)是由图着色问题(GCP)衍生而来的np困难问题。问题(MSCP)包括最小化图中颜色的总和。我们的解决方法是基于最大-最小蚂蚁系统(MMAS)的一种扩展和基于F. Glover[4]给出的极大独立集算法改进的局部启发式算法的杂交。

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

查看原文本刊更多论文

Max-Min Ant System for the sum coloring problem

The sum coloring problem (MSCP) is an NP-hard problem derived from the graphs coloring (GCP). The problem (MSCP) consists in minimizing the sum of colors in a graph. Our resolution approach is based on an hybridization of Max-Min Ant System (MMAS) an extension of Ant System and a local heuristic based on an improvement of the maximal independent set algorithm given by F. Glover[4].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 International Conference on Communications, Computing and Control Applications (CCCA)

自引率

0.00%

发文量