Keywords
Asignación de frecuencias
Ant System Meta heuristics
frequency allocation
Ant System
How to Cite
Abstract
In this research a real problem of telecommunications networks is analyzed, we intend to apply Meta heuristic techniques to problems of frequency allocation, using the algorithm Ant System (AS) in scenarios that simulate a GSM cellular network.
The telecommunications industry has provided, and continues to provide, a lot of optimization problems that arise from the design of the communication system itself to some aspects of its operation and here are the Meta heuristic procedures which are a class of approximate methods they are designed to solve complex optimization problems, where the classic heuristics are not effective. The meta-heuristics provide a general framework to create new hybrid algorithms combining different concepts derived from artificial intelligence.
With all this we want to reach a mathematical modeling of optimization based on ant algorithms (ACO) for assignment of frequencies.
References
Bello, R and A. Puris. (2006). Two Step Ant Colony System to Solve the Feature Selection Problem. 11th Iberoamerican Congress on Pattern Recognition CIARP, (págs. 588-596). Mexico.
Eberhart, J. K. (1995). Particle swarm optimization. in on neural networks. Piscataway, NJ.
Eisenblätter, A., Koster, A. (1996). COST 259. Wireless Flexible Personalized Communications. Obtenido de http://fap.zib.de/problems/COST259/.
Koster, A. (1999). Frequency Assignment, Models and Algorithms. Ph.D Thesis, Universiteit Maastricht,. The Netherlands.
M. Mouly, Marie-Bernadette Pautet. (1992). The GSM System for Mobile. Published by the authors.
Puris, A. and R. Bello. (2007). Two Step Ant Colony Optimzation for solving Salesman Problem. 2nd International work-conference on the interplay Between natural and artificial computation, (págs. 307-316). España.
Reeves, C. (1995). Modern Heuristic Techniques for Combinatorial Problems. UK: Ed. McGraw-Hill.
Resende, T. (1989). A probabilistic heuristic for a computational difficult set covering problems. Operations research letters, 67–71.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright (c) 2019 Emilio Rodrigo Zhuma, Amilkar Puris