Parallel artificial immune system for the constrained graph list multicolouring problem

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.

[1]  Mohamed Bakhouya,et al.  An Immune Inspired-based Optimization Algorithm: Application to the Traveling Salesman Problem , 2007 .

[2]  A. B. Watkins,et al.  A new classifier based on resource limited artificial immune systems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  F. Burnet.  The clonal selection theory of acquired immunity , 1959 .

[4]  Peter J. Bentley,et al.  Artificial Immune Systems , 2004, Lecture Notes in Computer Science.

[5]  Vincenzo Cutello,et al.  Clonal Selection Algorithms: A Comparative Case Study Using Effective Mutation Potentials , 2005, ICARIS.

[6]  A. B. Watkins,et al.  A resource limited artificial immune classifier , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[7]  F. von Zuben,et al.  An evolutionary immune network for data clustering , 2000, Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks.

[8]  Mahmoud Naghshineh,et al.  Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 1996 .

[9]  Leandro Nunes de Castro,et al.  Artificial Immune Systems: A New Computational Approach , 2002 .

[10]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[11]  J. C. Tay,et al.  Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules , 2005, ICARIS.

[12]  Teodor Gabriel Crainic,et al.  Parallel Meta-Heuristics , 2010 .

[13]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[14]  Vincenzo Cutello,et al.  Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators , 2004, ICARIS.

[15]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[16]  Jonathan Timmis,et al.  Artificial immune systems - a new computational intelligence paradigm , 2002 .

[17]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[18]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[19]  Vincenzo Cutello,et al.  An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem , 2007, J. Comb. Optim..

[20]  D. Dasgupta,et al.  Advances in artificial immune systems , 2006, IEEE Computational Intelligence Magazine.

[21]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[22]  Lata Narayanan,et al.  Static Frequency Assignment in Cellular Networks , 2001, Algorithmica.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Robert James Waters,et al.  Graph Colouring and Frequency Assignment , 2005 .

[25]  Leandro Nunes de Castro,et al.  The Clonal Selection Algorithm with Engineering Applications 1 , 2000 .