Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Advances in evolutionary computing
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
ACO vs EAs for solving a real-world frequency assignment problem in GSM networks
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Metaheuristics for solving a real-world frequency assignment problem in GSM networks
Proceedings of the 10th annual conference on Genetic and evolutionary computation
SS vs PBIL to solve a real-world frequency assignment problem in GSM networks
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
| Hi-index | 0.00 |
In this work we study and compare hybrid versions of two different metaheuristics to solve a real-world frequency assignment problem (FAP) in GSM networks. We have used a precise mathematical formulation, developed in published work, in which the frequency plans are evaluated using accurate interference information coming from a real GSM network. Therefore, we focus on solving FAP problem for a realistic-sized, real-world GSM network using a hybrid version of Scatter Search and Differential Evolution algorithms. We have analyzed and fixed both approaches to the FAP problem and, after a detailed statistical study, the obtained results prove that our hybrid approaches compute accurate frequency plans for real-world instances in an optimum way. In fact, our results surpass all the results previously published in the literature.