This technical report summarizes our results on solving graph coloring problems with Genetic Algorithms (GA). After testing many diierent options we conclude that the best one is a (1+1) order-based GA using an adaptation mechanism that periodically changes the tness function, thus guiding the GA through the search space. Except from the decoder ((tness function) this GA is general, using no do...

We discussed how to use tools from exploratory data analysis of statistics to visualize experimental results. We used the data collected from the Task 1 of the Implementation Contest. In the comparison there were three extra participants (ROS: Random Ordered Sequence greedy coloring, DSATUR, The degree of saturation and RLF, Recursive Large First). RLF and DSATUR clearly outperformed the other ...

In this paper we consider a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW) and show its working on graph coloring problems. SAWing technically belongs to the penalty function based approaches and amounts to modifying the penalty function during the search. We show that it has a twofold ben-eet. First, it proves to be rather insensitive to its technical p...

Vertex Descent is a local search algorithm which forms the basis of a wide spectrum of tabu search, simulated annealing and hybrid evolutionary algorithms for graph colouring. These algorithms are usually treated as experimental and provide strong results on established benchmarks. As a step towards studying these heuristics analytically, an analysis of the behaviour of Vertex Descent is provid...

With distinguished advantages over radio frequency communication, visible light communication (VLC) has been considered as one of the potential and promising wireless technologies. However, densely deployed emitting diode (LED) lamps introduce severe inter channel interference (ICI), which drastically deteriorates VLC network performance. In addition, limited access capabilities heterogeneous L...

An equitable graph coloring is a proper vertex coloring, such that the size of the color classes differ by at most one. We present a flow-based scheme for generating pruning rules for enumerative algorithms such as DSATUR. The scheme models the extendability of a partial (equitable) coloring into an equitable coloring via network flows. Computational experiments show that significant reductions...

We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned sparse derivative matrices. The size of the graph is dependent on the partition and can be varied between the number of columns and the number of nonzero entries. If solved exactly our proposal will yield a significant ...

We give an adaptive depth procedure for coloring a graph that combines elements of tabu search and branch and bound. The resulting tabu branch and bound method can execute searches of varying degrees of exhaustiveness at different stages and in different regions of the search space, ranging from pure heuristic search to pure tree search at the extremes. The goal is generally to find near optima...

We studied the relative performance of genetic algorithms on coloring a dynamic graph for di↵erent graph and algorithm conditions. Graph coloring is a well-studied NP-complete problem with a wide range of applications in scheduling and assignment problems, while dynamic graphs are a natural way to model a diverse range of dynamic systems, from register allocation to mobile ad-hoc networks. Colo...

Motivated by WiFi channel assignment, we propose and explore two vertex-coloring problems for graphs, where the spectrum of colors is endorsed with a matrix of interferences between each pair of colors. The Threshold Spectrum Coloring problem fixes the number of colors available and aims to minimize the interference threshold, i.e., the maximum of the interferences at the vertices. The Chromati...