Metaheuristics for solving a real-world frequency assignment problem in GSM networks

The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeable future. There are many versions of FAP, most of them benchmarking-like problems. We use a formulation of FAP, developed in published work, that focuses on aspects which are relevant for real-world GSM networks. In this paper, we have designed, adapted, and evaluated several types of metaheuristic for different time ranges. After a detailed statistical study, results indicate that these metaheuristics are very appropriate for this FAP. New interference results have been obtained, that significantly improve those published in previous research.

[1]  Juha Rapeli,et al.  UMTS: targets, system concept, and standardization in a global framework , 1995, IEEE Wirel. Commun..

[2]  Anders Furuskar,et al.  EDGE: enhanced data rates for GSM and TDMA/136 evolution , 1999, IEEE Wirel. Commun..

[3]  Bernhard H. Walke.  Mobile Radio Networks: Networking, Protocols and Traffic Performance, 2nd Edition , 2001 .

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

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

[6]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

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

[9]  Ajay R. Mishra,et al.  Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G , 2004 .

[10]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[11]  Bernhard Walke.  Mobile Radio Networks: Networking and Protocols , 1999 .

[12]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[13]  Håkan Granbohm,et al.  GPRS—General packet radio service , 1999 .

[14]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[15]  A.M.J. Kuurne.  On GSM mobile measurement based interference matrix generation , 2002, Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367).

[16]  H. Keselman,et al.  Multiple Comparison Procedures , 2005 .

[17]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[18]  U Aickelin,et al.  Handbook of metaheuristics (International series in operations research and management science) , 2005 .

[19]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[20]  W. Press,et al.  Numerical Recipes in Fortran: The Art of Scientific Computing.@@@Numerical Recipes in C: The Art of Scientific Computing. , 1994 .

[21]  A. Tamhane,et al.  Multiple Comparison Procedures , 1989 .

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

[23]  Maliha S. Nash,et al.  Handbook of Parametric and Nonparametric Statistical Procedures , 2001, Technometrics.

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

[25]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[26]  A. Eisenblätter.  Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds , 2001 .

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

[28]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.