.png){kind=icon}
返回
A memetic algorithm for the Minimum Sum Coloring Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2013.09.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In particular, the proposed algorithm can improve the best known results for 15 instances. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Sum coloring
Memetic algorithm
Heuristics
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏
Potato Tuberworm Phthorimaea operculella (Zeller) (Lepidoptera: Gelechioidea) Leaf Infestation Affects Performance of Conspecific Larvae on Harvested Tubers by Inducing Chemical Defenses.png)
InsectsOAAI
InsectsIF0
OAAI分享收藏 没有更多内容
没有更多内容