CÁC BÀI BÁO KHOA HỌC 07:12:24 Ngày 23/10/2014 GMT+7
A novel particle swarm optimization - Based algorithm for the graph coloring problem

In this paper, we study the problem of graph coloring and propose a novel particle swarm optimization (PSO) algorithm for it. We use the PSO evolutionary progress to improve a simple deterministic greedy algorithm. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by an extensive simulation study. ©2009 IEEE.

 Anh T.H., Giang T.T.T., Vinh T.L.
   255.pdf    Gửi cho bạn bè
  Từ khóa : Evolutionary progress; Extensive simulations; Graph coloring; Graph coloring problem; Graph colorings; Greedy algorithms; IMPROVE-A; Particle swarm; Particle swarm optimization algorithm; Coloring; Computer science; Graph theory; Heuristic algorithms; Particle swarm optimization (PSO)