By Topic

A Novel Bi-objective Genetic Algorithm for the Graph Coloring Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lixia Han ; Sch. of Comput. Sci. & Technol., China Univ. of Min. & Technol., Xuzhou, China ; Zhanli Han

Graph coloring problem is a classical NP-hard combinatorial optimization problem. In this paper, a new bi-objective model for the coloring problem is presented. Based on this new model, a bi-objective genetic algorithm is proposed which employs effective crossover and simple mutation operator as the genetic operators. The global convergence of the proposed algorithm to globally optimal set with probability one is proved. Experimental results demonstrate that the proposed algorithm is expected.

Published in:

Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on  (Volume:4 )

Date of Conference:

22-24 Jan. 2010