Author/Authors :
Jamalzehi، Elham نويسنده Department of Computer Engineering, Khouzestan Science and Research Branch, Islamic Azad University, Ahvaz, Iran , , Abdeyazdan، Marjan نويسنده Department of Computer Science, College of Electricity and Computer, Mahshahr Branch, Islamic Azad University, Mahshahr, Iran , , Abbsi Dezfuli، Mashalah نويسنده Department of Computer Engineering, Khouzestan Science and Research Branch, Islamic Azad University, Ahvaz, Iran ,
Abstract :
A new and popular technique for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this article we propose a discrete hybrid evolutionary algorithm of the traditional genetic algorithm followed by the new Imperialist Competitive Algorithm (Social Based Algorithm) to solve the graph-coloring problem. A good selection for graph coloring is a function of vertices of graph into a set of colors such that both neighbor vertices of the graph have different colors. Using the Social Based Algorithm makes a new technique with a high accuracy in both exploration and exploitation in the search space for coloring the graph. The algorithm is tested toward different standard benchmark tests while limiting the number of usable colors to the known chromatic numbers. Results prove the superiority of the proposed method in comparison with other algorithms and even in terms of the minimum number of colors required for graph coloring problems.
