A Dynamic Genetic Algorithm Approach to the Problem of UMTS Network Assignment

摘要

The problem of the universal mobile telecommunication system (UMTS) network assignment is divided into two assignment sub-problems: the assignment of a set of Nodes Bs to a set of radio network controllers (RNCs), and the assignment of those RNC concurrently to a set of Mobile Switching Centers (MSCs) and a set of Serving GPRS Support Nodes (SGSNs). The objective is to find an assignment that minimizes the cost of such implementation. This paper proposes, first, an improvement of the existing mathematical modelling. Second, it presents a solution method to the problem based on genetic algorithms with a dynamic approach. To compare our proposed model to the existing one, some numerical examples are given. The obtained results show the efficiency of our model and our approach.