The improved ColourAnt algorithm: a hybrid algorithm for solving the graph colouring problem
by Anderson Faustino Da Silva; Luis Gustavo Araujo Rodriguez; João Fabrício Filho
International Journal of Bio-Inspired Computation (IJBIC), Vol. 16, No. 1, 2020

Abstract: The graph colouring problem is interesting because of its application areas, ranging from register allocation, frequency association in telecommunications, timetabling and scheduling, and others. This problem is NP-complete and thus, several metaheuristic algorithms have been proposed in order to provide a good solution in an acceptable time-frame. Among several metaheuristics, this paper focuses on ant colony optimisation. In this context, a hybrid algorithm was developed called iColourAnt, which uses ant colony optimisation and an efficient local search strategy, consequently providing good solutions to the graph colouring problem. The experiment results indicate that iColourAnt outperforms its predecessor, ColourAnt.

Online publication date: Fri, 14-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com