Two hybrid ant algorithms for the general T-colouring problem
by Mahmoudi Aicha, Bessedik Malika, Drias Habiba
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 5, 2010

Abstract: GCP is a well-known combinatorial problem that admits several generalisations from which the T-colouring (GTCP). Given a graph G and sets T of positive integers associated to the edges of G, a T-colouring of G is an assignment of colours to its vertices so the assigned colours distances do not exist in the associated set T. Since this problem is NP-Complete, only few heuristics are implemented for restricted conditions on the sets T. The ant colony optimisation (ACO) has been successfully applied to different problems [SAL08]. Nevertheless, no attempt of ACO has been published for the T-colouring problem. We introduce, in this paper, two hybrid evolutionary approaches combining an ACO algorithm and a tabu search for the GTCP. These approaches are experimented for the general and restricted cases of the GTCP with different parameter's settings. The results are encouraging and show often better results than those published.

Online publication date: Mon, 25-Oct-2010

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