A Multiobjectivised Memetic Algorithm for the Frequency Assignment Problem

被引:0
|
作者
Segredo, Eduardo [1 ]
Segura, Carlos [1 ]
Leon, Coromoto [1 ]
机构
[1] Univ La Laguna, Dpto Estad Invest Operat & Computac, San Cristobal la Laguna 38271, Santa Cruz De T, Spain
关键词
LOCAL SEARCH; GENETIC ALGORITHM; OPTIMIZATION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This work presents a set of approaches used to deal with the Frequency Assignment Problem (FAP), which is one of the key issues in the design of Global System for Mobile Communications (GSM) networks. The used formulation of the FAP is focused on aspects which are relevant for real-world GSM networks. The best up to date frequency plans for the considered version of the FAP had been obtained by using parallel memetic algorithms. However, such approaches suffer from premature convergence with some real world instances. Multiobjectivisation is a technique which transforms a mono-objective optimisation problem into a multi-objective one with the aim of avoiding stagnation. A Multiobjectivised Memetic Algorithm, based on the well-known Non-Dominated Sorting Genetic Algorithm II (NSGA-II) together with its required operators, is presented in this paper. Several multiobjectivised schemes, based on the addition of an artificial objective, are analysed. They have been combined with a novel crossover operator. Computational results obtained for two different real-world instances of the FAP demonstrate the validity of the proposed model. The new model provides benefits in terms of solution quality, and in terms of time saving. The previously known best frequency plans for both tested real-world networks have been improved.
引用
收藏
页码:1132 / 1139
页数:8
相关论文
共 50 条