A method for the minimum coloring problem using genetic algorithms

Harmanani, Haidar; Abas, Hani

A method for the minimum coloring problem using genetic algorithms

Harmanani, Haidar; Abas, Hani

URL: http://www.actapress.com/PaperInfo.aspx?PaperID=26827&reason=500

Date: 2018-04-27

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

This paper presents a method to solve the graph coloring problem for arbitrary graphs using genetic algorithms. The graph coloring problem, an NP-hard problem, has important applications in many areas including time tabling and scheduling, frequency assignment, and reg ister allocation. The algorithm was implemented and tested on various set of instances including large DIMACS challenge benchmark graphs, all yielding favorable results.

Citation:

Harmanani, H., & Abas, H. (2006, May). A method for the minimum coloring problem using genetic algorithms. In Proceedings of the 17th IASTED international conference on Modelling and simulation. ACTA Press.