Elementary landscapes of frequency assignment problems

Authors:
L. Darrell Whitley;Francisco Chicano;Enrique Alba;Francisco Luna
Affiliations:
Colorado State University, Fort Collins, CO, USA;University of Málaga, Málaga, Spain;University of Málaga, Málaga, Spain;University of Málaga, Málaga, Spain
Venue:
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Year:
2010

Citing 4
Cited 2

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
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Partial neighborhoods of elementary landscapes

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Tunneling between optima: partition crossover for the traveling salesman problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation

Elementary landscape decomposition of the frequency assignment problem

Theoretical Computer Science
Quasi-elementary landscapes and superpositions of elementary landscapes

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either directly an Elementary Landscape, or are a superposition of two Elementary Landscapes. We also examine the computability of neighborhood averages for partial neighborhoods.