Performance assessment of biogeography-based multi-objective algorithm for frequency assignment problem
by Asma Daoudi; Karima Benatchba; Malika Bessedik; Leila Hamdad
International Journal of Bio-Inspired Computation (IJBIC), Vol. 18, No. 4, 2021

Abstract: Solving frequency assignment problem (FAP) with multiple objectives is NP-hard. The network has many constraints to be respected when assigning frequencies. In this paper, we consider two objectives: reduce the number of frequencies and the interference caused by the violation of the network constraints. We use a new model based on a set-T-colouring graph which takes in consideration all constraints related to cellular network. We propose to use an evolutionary metaheuristic, biogeography-based multi-objective optimisation algorithm (BBMO), to solve the considered problem. As it is a bi-objective approach, our results are represented by a set of non-dominated solutions based on the definition of Pareto optimum front. A framework to study and measure the quality of the obtained Pareto fronts based on six performance indicators (ONVGR, HV, Spread, GS, GD, IGD) has been implemented. The obtained results show the efficiency of the BBMO on FAP based on a well known COST259 dataset. Moreover, a statistical analysis compares our approach BBMO-FAP to NSGA-II and identifies the best-performing method.

Online publication date: Tue, 04-Jan-2022

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