Solving the frequency assignment problem using genetic algorithms, evolutionary simulated annealing and differential evolution

Authors:
Eugénia Bernardino;Anabela Bernardino;Juan M. Sánchez Pérez;Juan A. Gómez Pulido;Miguel A. Vega Rodríguez
Affiliations:
Polytechnic Institute of Leiria, Leiria, Portugal;Polytechnic Institute of Leiria, Leiria, Portugal;University of Extremadura, Cáceres, Spain;University of Extremadura, Cáceres, Spain;University of Extremadura, Cáceres, Spain
Venue:
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Year:
2008

Citing 7
Cited 0

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Key issues for the design and development of mobile commerce services and applications

International Journal of Mobile Communications
Fixed channel assignment using new dynamic programming approach in cellular radio networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years we have witnessed a tremendous growth of mobile communication networks resulted in a run out of the most important resource, frequencies in the radio spectrum. In this paper we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. Our procedure includes some original features, including the application of a Differential Evolution, new methods of crossover and mutation when Genetic Algorithms and Evolutionary Simulated Annealing are used. For testing we use standard benchmark instances from the literature that allow models and algorithms to be compared more easily, and allow comparisons between the work of different authors.