Parallel artificial immune system for the constrained graph list multicolouring problem

  • Authors:
  • Riad Hadji;Nabil Menni;Ahmed Meraga;Malika Bessedik

  • Affiliations:
  • Laboratoire des Méthodes de Conception de Systèmes LMCS, E.S.I ex I.N.I., BP 68M Oued Smar, 16309, Alger, Algeria;Ecole Supérieure d'Informatique, E.S.I ex I.N.I., BP 68M Oued Smar, 16309, Alger, Algeria;Ecole Supérieure d'Informatique, E.S.I ex I.N.I., BP 68M Oued Smar, 16309, Alger, Algeria;Laboratoire des Méthodes de Conception de Systèmes LMCS, E.S.I ex I.N.I., BP 68M Oued Smar, 16309, Alger, Algeria

  • Venue:
  • International Journal of Metaheuristics
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

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.