图着色问题的离散花授粉算法

2015 IEEE 2nd International Conference on Cybernetics (CYBCONF) Pub Date : 2015-06-24 DOI:10.1109/CYBConf.2015.7175923

Meriem Bensouyad, Djamel-Eddine Saïdouni

{"title":"图着色问题的离散花授粉算法","authors":"Meriem Bensouyad, Djamel-Eddine Saïdouni","doi":"10.1109/CYBConf.2015.7175923","DOIUrl":null,"url":null,"abstract":"Flower pollination algorithm is a recent nature inspired algorithm for continuous optimization; this algorithm is inspired by the pollination process of flowers. In this paper, we introduce a discrete version of the algorithm to deal with the graph coloring problem. The performance of the algorithm is evaluated on benchmark instances set and the computational results show promising results where it achieves the exact solution in almost cases.","PeriodicalId":177233,"journal":{"name":"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"A discrete flower pollination algorithm for graph coloring problem\",\"authors\":\"Meriem Bensouyad, Djamel-Eddine Saïdouni\",\"doi\":\"10.1109/CYBConf.2015.7175923\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Flower pollination algorithm is a recent nature inspired algorithm for continuous optimization; this algorithm is inspired by the pollination process of flowers. In this paper, we introduce a discrete version of the algorithm to deal with the graph coloring problem. The performance of the algorithm is evaluated on benchmark instances set and the computational results show promising results where it achieves the exact solution in almost cases.\",\"PeriodicalId\":177233,\"journal\":{\"name\":\"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBConf.2015.7175923\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBConf.2015.7175923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

传粉算法是一种受自然启发的连续优化算法;该算法的灵感来自于花的授粉过程。在本文中，我们引入了该算法的一个离散版本来处理图着色问题。在基准实例集上对算法的性能进行了评估，计算结果表明，该算法在大多数情况下都能得到精确的解。

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

查看原文本刊更多论文

A discrete flower pollination algorithm for graph coloring problem

Flower pollination algorithm is a recent nature inspired algorithm for continuous optimization; this algorithm is inspired by the pollination process of flowers. In this paper, we introduce a discrete version of the algorithm to deal with the graph coloring problem. The performance of the algorithm is evaluated on benchmark instances set and the computational results show promising results where it achieves the exact solution in almost cases.

求助全文

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

来源期刊

2015 IEEE 2nd International Conference on Cybernetics (CYBCONF)

自引率

0.00%

发文量