Position-Guided Tabu Search Algorithm for the Graph Coloring Problem

Despite these solutions are effective in producing a proper coloring, generally minimizing the number of colors, they produce highly skewed color classes, undesirable for

A bad edge is defined as an edge connecting two vertices that have the same color. The number of bad edges is the fitness score for any chromosome. As

Because this problem is an NP- hard problem there is not a known deterministic efficient (polinomial) method. Non- deterministic methods are in general more efficient but an

Thus, most maximum clique algorithms typically operate on the comple- ment graph ¯ G to search for the maximum independent sets in terms of run- time efficiency [13, 25, 33]. The

By combining reinforcement learning techniques with a solution improve- ment procedure, our proposed RLS approach is composed of four keys com- ponents: a descent-based local

(Note that in Part II two amino acids have been chosen as the ones recognized by some proteases and in Part III two real proteases have been chosen first and then the recognized

(2014) introduced an Iterated Local Search (ILS) (Lourenço et al., 2003) metaheuristic for the CC problem, which outperformed, in processing time, the GRASP metaheuristic

The next step of the tabu search is to find the best assignment of the trucks to the docks while minimizing the number of used wagons and the distance travelled