
graph coloring problems (gcps) are constraint optimization problems with various applications including scheduling...that adjacent vertices have distinct colors. we propose a parallel approach based on hierarchical parallel genetic algorithms (hpgas) to solve the gcp...
Published in 2011.

...some genetic algorithms are considered for the graph coloring problem. as is the case for other combinatorial optimization problems, pure genetic algorithms are outperformed by neighborhood search...obtain solutions of excellent quality. for some graphs, we illustrate that genetic operators can fulfill longterm strategic functions for a tabu search implementation that...

...the paper proves that a parallel metaheuristic like the parallel genetic algorithm (pga) can be efficiently used for computing approximate sum colorings and finding upper bounds for chromatic sums and chromatic sum numbers for hard tocolor graphs. suboptimal sum coloring with pga gives usually much...

...huge color class redundancy makes the graph coloring problem (gcp) very challenging for genetic algorithms (gas), and designing
effective crossover...been achieved with direct approaches,
algorithms using an order based representation have one...

...novel evolutionary formulations of the problem of coloring the nodes of a graph. the first formulation is based on the relationship that exists between a graph's chromatic number and its...one, does not tackle one graph at a time, but rather aims at evolving a "pro gram" to color all graphs belonging to a class whose...

...novel evolutionary formulations of the problem of coloring
the nodes of a graph. the first formulation is based on the relationship that
exists between a graph's chromatic number and its...one, does not tackle one graph at a time, but rather aims at evolving a
`program' to color all graphs belonging to a class whose...

...restricting probabilistic models in the hierarchical bayesian optimization algorithm (hboa) by defining a distance...building in hboa. three test problems are considered: 3d ising spin glasses, random additively decomposable problems, and the minimum vertex cover...

...this paper, a knowledge based genetic algorithm (ga) for path planning of a mobile robot is proposed, which uses problemspecific genetic algorithms for robot path planning instead of...evaluation method. the knowledge based genetic algorithm is capable of finding an optimal or nearoptimal robot...

...generic tabu search is presented for three coloring problems: graph coloring, tcolorings and set tcolorings. this algorithm inte grates important features such...empirical comparisons show that this algorithm approaches the best coloring algorithms and outperforms some hybrid algorithms on a wide range of...
Published in 1998.

...a conflictfree storage scheme for a set of data patterns is npcomplete. this problem is reduceable to weighted graph coloring. optimizing the storage scheme is...be only slightly dependent on problem size. genetic algorithms are recommended for advanced compiler optimization especially for large problem sizes; and applications which are...