Parallelizing Nsgaii For Accelerating The Registration Areas Optimization In Mobile Communication Networks

In this work, we propose a parallel version of our adaptation of the Non-dominated Sorting Genetic Algorithm II (NSGAII) with the aim of reducing its execution time when solving the Registration Areas Planning Problem (RAPP), a problem that describes one of the most popular strategies to manage the subscribers' movement in a mobile communication network. In this problem, the use of mobile activity traces is a good choice that allows us to assess the Registration Areas strategy in an accurate way. However and due to the huge number of mobile subscribers, a mobile activity trace of a current network could contain several millions of events, which leads to a large execution time. That is the reason why we propose to parallelize our version of NSGAII in a shared memory system, using for that the OpenMP Application Program Interface. The quality and efficiency of our approach is shown by means of an experimental study.