Parallel artificial immune system for the constrained graph list multicolouring problem
by Riad Hadji; Nabil Menni; Ahmed Meraga; Malika Bessedik
International Journal of Metaheuristics (IJMHEUR), Vol. 3, No. 1, 2014

Abstract: The constrained graph list multicolouring problem (CGLMP) is a generalised form of the graph colouring problem (CGP). It is NP-hard combinatorial optimisation problem. In this paper, the CGLMP is used to solve the well-known frequency assignment problem (FAP). The artificial immune system (AIS) has been proposed for solving several combinatorial optimisation problems. This paper presents a hybrid approach based on AIS combined to a local search for solving the CGLMP. To validate the implemented approach, many tests were carried out on academic benchmarks, and, an empirical adjustment of its parameters has been achieved. To improve the performance of this algorithm, a parallel implementation has been realised.

Online publication date: Fri, 25-Jul-2014

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 Metaheuristics (IJMHEUR):
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