A study of diversification strategies for the quadratic assignment problem
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
Tabu Search
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
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
Breakout Local Search for maximum clique problems
Computers and Operations Research
Breakout Local Search for the Max-Cutproblem
Engineering Applications of Artificial Intelligence
A study of adaptive perturbation strategy for iterated local search
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Breakout local search for the vertex separator problem
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A memetic algorithm for the Minimum Sum Coloring Problem
Computers and Operations Research
| Hi-index | 0.00 |
Given an undirected graph G=(V,E), 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. In this paper, we present Breakout Local Search (BLS) for MSCP which combines some essential features of several well-established metaheuristics. BLS explores the search space by a joint use of local search and adaptive perturbation strategies. Tested on 27 commonly used benchmark instances, our algorithm shows competitive performance with respect to recently proposed heuristics and is able to find new record-breaking results for 4 instances.