An introduction to chromatic sums
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Tabu Search
Scatter Search for Graph Coloring
Selected Papers from the 5th European Conference on Artificial Evolution
On Sum Coloring of Graphs with Parallel Genetic Algorithms
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A Metaheuristic Approach for the Vertex Coloring Problem
INFORMS Journal on Computing
Computers and Operations Research
Neighborhood analysis: a case study on curriculum-based course timetabling
Journal of Heuristics
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
Handbook of Memetic Algorithms
Handbook of Memetic Algorithms
A study of breakout local search for the minimum sum coloring problem
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
| Hi-index | 0.01 |
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.