Solving Graph Coloring and Graph Set Coloring Problems by Using Multi-Objective Genetic Algorithms and Stochastic Local Algorithms

Funded Research Project (TÜBİTAK, No: 110E187)
Year: 2011-2013 Project Team: Emin Erkan Korkmaz (ekorkmaz [at] cse.yeditepe.edu.tr), Çağrı Yeşil, Uğur Bayındır.  

The aim of the project is to solve Graph Coloring and Graph Set Coloring Problems which are NP-hard problems. Stochastic local search algorithms like Simulated Annealing, Tabu mechanism, Backtracking mechanism and hill climbers are integrated in different ways to solve the problems. On the other hand, a multi-objective genetic approach is also utilized for the problems. The performance of the hybrid-local search framework will be compared with the multi-objective approach on these two problems throughout the project.

Permanent link to this article: http://cse.yeditepe.edu.tr/en/research/projects/funded-research-projects/solving-graph-coloring-and-graph-set-coloring-problems-by-using-multi-objective-genetic-algorithms-and-stochastic-local-algorithms/