文章基本信息

标题：A Novel Presentation of Graph Coloring Problems Based on Parallel Genetic Algorithm
本地全文：下载
作者：Saideh Naderi ; Masoud Jabbarian ; Vahid Sattari Naeini 等
期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2013
卷号：3
期号：3
页码：65-70
出版社：International Journal of Soft Computing & Engineering
摘要：In coloring graph idealization the minimum number of required colors for graphic coloring is determined in a way that no contiguous summit have the same color this number is called chromatic graph number. We should decide if then, a color for a given integral number M , so we use that number with no contiguous summits of the same color there have been presented several algorithms for decision and idealization manners so for such as: reverse counting method ,space mood counting method and etc…that don’t follow multi statement time. Here by in this paper we present suitable solutions for this problem by genetic algorithm. In order to evaluate the performance of our new approach, we have conducted several experiments on GCP instances taken from the well known DIMACS Website. The results show that the proposed approach has a high performance in time and quality of the solution returned in solving graph coloring instances taken from DIMACS website. The quality of the solution is measured here by comparing the returned solution with the optimal one.
关键词：Graph Coloring Problems (GCPs); Parallel;Genetic Algorithms (PGAS); NP-hard; chromosome.