A Comparative Study on Meta-Heuristic Algorithms For Solving the RNP Problem

  • Abeer Sufyan Khalil Department of Computer Science, College of Science, University of Baghdad, Baghdad, Iraq
  • Rawaa Dawoud Al-Dabbagh Department of Computer Science, College of Science, University of Baghdad, Baghdad, Iraq
Keywords: differential evolution, self-adaptive, radio network planning

Abstract

The continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vector mutation surpassed the other metaheuristic variants, such as DE/rand/1 and classical GA, in term of deployment cost, coverage rate and quality of service (QoS).

Published
2019-07-19
How to Cite
Khalil, A. S., & Al-Dabbagh, R. D. (2019). A Comparative Study on Meta-Heuristic Algorithms For Solving the RNP Problem. Iraqi Journal of Science, 60(7), 1639-1648. https://doi.org/10.24996/ijs.2019.60.7.24
Section
Computer Science

Most read articles by the same author(s)