Article

ACO vs EAs for solving a real-world frequency assignment problem in GSM networks

Authors:

Francisco Luna,

Christian Blum,

Antonio J. NebroAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

Pages 94 - 101

https://doi.org/10.1145/1276958.1276972

Published: 07 July 2007 Publication History

Abstract

Frequency planning is a very important task for current GSM operators. In this work we present a new mathematical formulation of the problem in which the frequency plans are evaluated by using accurate interference information coming from a real GSM network. We have developed an ant colony optimization (ACO) algorithm to tackle this problem. After accurately tuning this algorithm, it has been compared against a (1,10) Evolutionary Algorithm (EA). The results show that the ACO clearly outperforms the EA when using different time limits as stopping condition for a rather extensive comparison.

References

[1]

K. I. Aardal, S. P. M. van Hoesen, A. M. C. A. Koster, C. Mannino, and A. Sassano. Models and solution techniques for frequency assignment problems. 4OR, 1(4):261--317, 2003.

[2]

K. I. Aardal, S. P. M. van Hoesen, A. M. C. A. Koster, C. Mannino, and A. Sassano. Models and solution techniques for frequency assignment problems. Annals of Operations Research, To appear, 2007.

[3]

P. Björklund, P. Värbrand, and D. Yuan. Optimized planning of frequency hopping in cellular networks. Computers and Operations Research, 32(1):169--186, 2005.

Digital Library

[4]

C. Blum and M. Dorigo. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics - Part B, 34(2):1161--1172, 2004.

Digital Library

[5]

C. Blum and A. Roli. Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys, 35(3):268--308, 2003.

Digital Library

[6]

R. Borndörfer, A. Eisenblätter, M. Grötschel, and A. Martin. Frequency assignment in cellular phone networks. Annals of Operations Research, 76:73--93, 1998.

[7]

A. De Pasquale, N. P. Magnani, and P. Zanini. Optimizing frequency planning in the GSM system. In IEEE 1998 Int. Conf. on Universal Personal Communications, pages 293--297, 1998.

[8]

M. Dorigo and T. Stützle. Ant Colony Optimization. MIT press, Cambridge, MA, 2004.

Digital Library

[9]

R. Dorne and J.-K. Hao. An evolutionary approach for frequency assignment in cellular radio networks. In Proc. of the IEEE Int. Conf. on Evolutionary Computation, pages 539--544, 1995.

[10]

A. Eisenblätter. Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, Technische Universität Berlin, 2001.

[11]

A. Eisenblätter, M. Grötschel, and A. M. C. A. Koster. Frequency planning and ramifications of coloring. Discussiones Mathematicae Graph Theory, 22(1):51--88, 2002.

[12]

FAP Web. http://fap.zib.de/.

[13]

A. Furuskar, J. Naslund, and H. Olofsson. EDGE - enhanced data rates for GSM and TDMA/136 evolution. Ericsson Review, (1), 1999.

[14]

H. Granbohm and J. Wiklund. GPRS - general packet radio service. Ericsson Review, (1), 1999.

[15]

W. K. Hale. Frequency assignment: Theory and applications. Proceedings of the IEEE, 68(12):1497--1514, 1980.

[16]

N. Jaldén. Autonomous frequency planning for GSM networks. Master's thesis, Royal Institute of Technology, Stockholm, 2004.

[17]

A. M. J. Kuurne. On GSM mobile measurement based interference matrix generation. In IEEE 55th Vehicular Technology Conference, VTC Spring 2002, pages 1965--1969, 2002.

[18]

F. Luna, E. Alba, A. Nebro, and S. Pedraza. Evolutionary algorithms for real-world instances of the automatic frequency planning problem in GSM networks. In 7th European Conf. on Evolutionary Computation in Combinatorial Optimisation, EVOCOP 2007, 2007 (to appear).

Digital Library

[19]

V. Maniezzo and A. Carbonaro. An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems, 16(9):927--935, 2000.

Digital Library

[20]

A. R. Mishra. Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G. Evolution to 4G, chapter Radio Network Planning and Optimisation, pages 21--54. Wiley, 2004.

[21]

J. N. J. Moon, L. A. Hughes, and D. H. Smith. Assignment of frequency lists in frequency hopping networks. IEEE Trans. on Vehicular Technology, 54(3):1147--1159, 2005.

[22]

M. Mouly and M. B. Paulet. The GSM System for Mobile Communications. Mouly et Paulet, Palaiseau, 1992.

Digital Library

[23]

W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge Unive. Press, 1992.

Digital Library

[24]

J. Rapeli. UMTS: Targets, system concept, and standardization in a global framework. IEEE Personal Communications, 2(1):30--37, 1995.

[25]

S. Ruíz, X. Colet, and J. J. Estevez. Frequency planning optimisation in real mobile networks. In IEEE VTS 50th Vehicular Technology Conference, pages 2082--2086, 1999.

[26]

M. K. Simon and M-S. Alouini. Digital Communication over Fading Channels: A Unified Approach to Performance Analysis. Wiley, 2005.

[27]

B. H. Walke. Mobile Radio Networks: Networking, protocols and traffic performance. Wiley, 2002.

Digital Library

Cited By

Zhang JFei ZWang XLiu PHuang JZheng Z(2023)Joint resource allocation and user association for multi-cell integrated sensing and communication systemsEURASIP Journal on Wireless Communications and Networking10.1186/s13638-023-02264-12023:1Online publication date: 21-Jul-2023
https://doi.org/10.1186/s13638-023-02264-1
Kiouche ABessedik MBenbouzid-SiTayeb FKeddar M(2020)An efficient hybrid multi-objective memetic algorithm for the frequency assignment problemEngineering Applications of Artificial Intelligence10.1016/j.engappai.2019.10326587(103265)Online publication date: Jan-2020
https://doi.org/10.1016/j.engappai.2019.103265
Lahsinat YBoughaci DBenhamou B(2019)Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular NetworksInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.201907010710:3(134-150)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.4018/IJAMC.2019070107
Show More Cited By

Index Terms

ACO vs EAs for solving a real-world frequency assignment problem in GSM networks

Recommendations

Parallelizing PBIL for Solving a Real-World Frequency Assignment Problem in GSM Networks
PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)

Frequency planning (also known as frequency assignment problem -FAP-) is a very important task for current GSM operators. The problem consists in trying to minimize the number of interferences caused when a limited number of frequencies has to be ...
A Co-Evolutionary Hybrid ACO for Solving Traveling Salesman Problem
CSAE '21: Proceedings of the 5th International Conference on Computer Science and Application Engineering

Ant Colony Optimization (ACO) is an approximate method proposed recently. Many ACO based approaches and hybrid methods have been proposed for solving the traveling salesman problem (TSP); However, the balance between intensification and diversification ...
Study on hybrid PS-ACO algorithm

Ant colony optimization (ACO) algorithm is a recent meta-heuristic method inspired by the behavior of real ant colonies. The algorithm uses parallel computation mechanism and performs strong robustness, but it faces the limitations of stagnation and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

July 2007

2313 pages

ISBN:9781595936974

DOI:10.1145/1276958

General Chair:
Hod Lipson
Cornell University, USA

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, England

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
474
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang JFei ZWang XLiu PHuang JZheng Z(2023)Joint resource allocation and user association for multi-cell integrated sensing and communication systemsEURASIP Journal on Wireless Communications and Networking10.1186/s13638-023-02264-12023:1Online publication date: 21-Jul-2023
https://doi.org/10.1186/s13638-023-02264-1
Kiouche ABessedik MBenbouzid-SiTayeb FKeddar M(2020)An efficient hybrid multi-objective memetic algorithm for the frequency assignment problemEngineering Applications of Artificial Intelligence10.1016/j.engappai.2019.10326587(103265)Online publication date: Jan-2020
https://doi.org/10.1016/j.engappai.2019.103265
Lahsinat YBoughaci DBenhamou B(2019)Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular NetworksInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.201907010710:3(134-150)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.4018/IJAMC.2019070107
Siddiqi USait S(2018)An Optimization Heuristic Based on Non-Dominated Sorting and Tabu Search for the Fixed Spectrum Frequency Assignment ProblemIEEE Access10.1109/ACCESS.2018.28825956(72635-72648)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2882595
Lahsinat YBoughaci DBenhamou B(2018)Breakout variable neighbourhood search for the minimum interference frequency assignment problemJournal of Systems and Information Technology10.1108/JSIT-10-2017-009420:4(468-488)Online publication date: 12-Nov-2018
https://doi.org/10.1108/JSIT-10-2017-0094
Chagwiza G(2018)Parasitic Optimisation Algorithm: a Lesson from Striga Asiatica (L) Kuntze WeedProcess Integration and Optimization for Sustainability10.1007/s41660-018-0064-z3:2(213-226)Online publication date: 22-Aug-2018
https://doi.org/10.1007/s41660-018-0064-z
Yang CJiang BPeng SZhang ZGu NLi SLu TLi L(2017)A Cooperative Co-evolutionary Approach for Large Scale Frequency Assignment Problem in TD-SCDMAProceedings of the 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing10.1145/3127404.3127421(129-136)Online publication date: 22-Sep-2017
https://dl.acm.org/doi/10.1145/3127404.3127421
Segura CHernandez-Aguirre ALuna FAlba E(2017)Improving Diversity in Evolutionary Algorithms: New Best Solutions for Frequency AssignmentIEEE Transactions on Evolutionary Computation10.1109/TEVC.2016.264147721:4(539-553)Online publication date: Aug-2017
https://doi.org/10.1109/TEVC.2016.2641477
Lahsinat YBoughaci DBenhamou B(2017)Iterated harmony differential search for the minimum interference frequency assignment problem2017 International Conference on Mathematics and Information Technology (ICMIT)10.1109/MATHIT.2017.8259705(122-127)Online publication date: Dec-2017
https://doi.org/10.1109/MATHIT.2017.8259705
Lahsinat YBoughaci DBenhamou B(2017)Harmony Search Based Algorithms for the Minimum Interference Frequency Assignment ProblemHarmony Search Algorithm10.1007/978-981-10-3728-3_18(179-189)Online publication date: 29-Jan-2017
https://doi.org/10.1007/978-981-10-3728-3_18
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten