.png){kind=icon}
返回
A memetic algorithm for graph coloring
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2009.07.016.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given an undirected graph G = (V: E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and the number of used colors k is minimized. This paper presents a memetic algorithm (denoted by MACOL) for solving the problem of graph coloring. The proposed MACOL algorithm integrates several distinguished features such as an adaptive multi-parent crossover (AMPaX) operator and a distance-and-quality based replacement criterion for pool updating. The proposed algorithm is evaluated on the DIMACS challenge benchmarks and computational results show that the proposed MACOL algorithm achieves highly competitive results, compared with 11 state-of-the-art algorithms. The influence of some ingredients of MACOL on its performance is also analyzed. (C) 2009 Elsevier B.V. All rights reserved
Keyword:
Graph coloring
Memetic algorithm
Crossover operator
Pool updating
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Quenching activities of common hydrophilic and lipophilic antioxidants against singlet oxygen using chemiluminescence detection system利用化学发光检测系统测定常见亲水性和亲脂性抗氧化剂对单线态氧的淬灭活性.png)
IF0
PREAI
分享收藏
查看更多内容