Graph Coloring Problem using Parallel Learner Genetic Algorithm

Task Graph Scheduling is one of the Np-Complete problems. One application of this problem is map coloring.In this paper a new hybrid method proposed for graph coloring problem. The Proposed algorithm uses genetic and learning automata simultaneously and it runs on multi computers. So with parallel execution of instruction the optimal answer is obtained in less time. The more effectiveness of the proposed algorithm compared with the other proposed methods

کلیدواژه ها:

Graph coloring ، Genetic Algorithm ، Learning Automata ، Parallel Processing