T-colorings of graphs: recent results and open problems
Discrete Mathematics - Special issue: advances in graph labelling
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
On the use of some known methods for T-colorings of graphs
Annals of Operations Research - Special issue on Tabu search
Lower bounding techniques for frequency assignment
Discrete Mathematics
Approximation algorithms for channel assignment with constraints
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Coloration Neighbourhood Search With Forward Checking
Annals of Mathematics and Artificial Intelligence
Tabu Search for Frequency Assignment in Mobile Radio Networks
Journal of Heuristics
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Approximation Algorithms for Channel Assignment in Cellular Radio Networks
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Using finite experiments to study asymptotic performance
Experimental algorithmics
The complexity of the T-coloring problem for graphs with small degree
Discrete Applied Mathematics
A polynomial algorithm for finding T-span of generalized cacti
Discrete Applied Mathematics
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Lower Bounds from Tile Covers for the Channel Assignment Problem
SIAM Journal on Discrete Mathematics
Heuristic methods for graph coloring problems
Proceedings of the 2005 ACM symposium on Applied computing
Design and Analysis of Experiments
Design and Analysis of Experiments
Journal of Artificial Intelligence Research
Colour reassignment in tabu search for the graph set t-colouring problem
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Heuristic manipulation, tabu search and frequency assignment
Computers and Operations Research
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that constraints on the separation of any two numbers assigned to a single vertex or to adjacent vertices are satisfied and some objective function is optimised. Among the objective functions of interest is the minimisation of the difference between the largest and the smallest integers used (the span). In this article, we present an experimental study of local search algorithms for solving general and large size instances of the GSTCP. We compare the performance of previously known as well as new algorithms covering both simple construction heuristics and elaborated stochastic local search algorithms. We investigate systematically different models and search strategies in the algorithms and determine the best choices for different types of instance. The study is an example of design of effective local search for constraint optimisation problems.