Multiple comparison procedures
Multiple comparison procedures
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Mobile Radio Networks: Networking and Protocols
Mobile Radio Networks: Networking and Protocols
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
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
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Comparing Hybrid Versions of SS and DE to Solve a Realistic FAP Problem
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Solving a Realistic FAP Using GRASP and Grid Computing
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
A multi-objective evolutionary approach for the antenna positioning problem
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Hi-index | 0.00 |
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.