A multiobjectivised memetic algorithm for the Frequency Assignment Problem

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.

[1]  Panos M. Pardalos,et al.  Handbook of Optimization in Telecommunications , 2006 .

[2]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[3]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[4]  Gara Miranda,et al.  Metaheuristics for solving a real-world frequency assignment problem in GSM networks , 2008, GECCO '08.

[5]  Hussein A. Abbass,et al.  Multiobjective optimization for dynamic environments , 2005, 2005 IEEE Congress on Evolutionary Computation.

[6]  Ken-ichi Tokoro,et al.  Application of the parameter-free genetic algorithm to the fixed channel assignment problem , 2005, Systems and Computers in Japan.

[7]  Poonam Garg,et al.  A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm , 2010, ArXiv.

[8]  Frank Neumann,et al.  Do additional objectives make a problem harder? , 2007, GECCO '07.

[9]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[10]  A. M. J. Kuume.  On GSM mobile measurement based interference matrix generation , 2002 .

[11]  Enrique Alba,et al.  ACO vs EAs for solving a real-world frequency assignment problem in GSM networks , 2007, GECCO '07.

[12]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

[13]  Bernhard Sendhoff,et al.  Lamarckian memetic algorithms: local optimum and connectivity structure analysis , 2009, Memetic Comput..

[14]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[15]  Francisco Luna,et al.  Solving large-scale real-world telecommunication problems using a grid-based genetic algorithm , 2008 .

[16]  Gara Miranda,et al.  Parallel hyperheuristics for the frequency assignment problem , 2011, Memetic Comput..

[17]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[18]  Mohamed-Slim Alouini,et al.  Digital Communication Over Fading Channels: A Unified Approach to Performance Analysis , 2000 .

[19]  Joshua D. Knowles,et al.  Multiobjectivization by Decomposition of Scalar Cost Functions , 2008, PPSN.

[20]  L. Darrell Whitley,et al.  Lamarckian Evolution, The Baldwin Effect and Function Optimization , 1994, PPSN.

[21]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[22]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[23]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Kalyanmoy Deb,et al.  Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[25]  Eduardo Segredo,et al.  Multiobjectivisation of the Antenna Positioning Problem , 2011, DCAI.

[26]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[27]  Di Yuan,et al.  Optimized planning of frequency hopping in cellular networks , 2005, Comput. Oper. Res..

[28]  Ning Li,et al.  Exploring the Effects of Lamarckian Evolution and Baldwin Effect in Differential Evolution , 2010, ISICA.

[29]  Carlo Mannino,et al.  Optimization Problems and Models for Planning Cellular Networks , 2006, Handbook of Optimization in Telecommunications.

[30]  Sung-Soo Kim,et al.  A memetic algorithm for channel assignment in wireless FDMA systems , 2007, Comput. Oper. Res..

[31]  René Schott,et al.  A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[32]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[33]  Hisao Ishibuchi,et al.  An empirical study on the specification of the local search application probability in multiobjective memetic algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.

[34]  Carlo Mannino,et al.  An Enumerative Algorithm for the Frequency Assignment Problem , 2003, Discret. Appl. Math..

[35]  Carlo Mannino,et al.  The stable set problem and the thinness of a graph , 2007, Oper. Res. Lett..