论文信息 - Elementary landscapes of frequency assignment problems

Elementary landscapes of frequency assignment problems

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.

Enrique Alba | Francisco Luna | L. Darrell Whitley | Francisco Chicano

[1] J. Wesley Barnes,et al. Linearity in the Traveling Salesman Problem , 2000, Appl. Math. Lett..

[2] Andrew M. Sutton,et al. Partial neighborhoods of elementary landscapes , 2009, GECCO '09.

[3] J. Wesley Barnes,et al. Weakly symmetric graphs, elementary landscapes, and the TSP , 2003, Appl. Math. Lett..

[4] J. Wesley Barnes,et al. The theory of elementary landscapes , 2003, Appl. Math. Lett..

[5] P. Stadler. Landscapes and their correlation functions , 1996 .

[6] J. Wesley Barnes,et al. Arbitrary elementary landscapes & AR(1) processes , 2005, Appl. Math. Lett..

[7] Lov K. Grover. Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..

[8] Andrew M. Sutton,et al. A polynomial time computation of the exact correlation structure of k-satisfiability landscapes , 2009, GECCO '09.

[9] Enrique Alba,et al. ACO vs EAs for solving a real-world frequency assignment problem in GSM networks , 2007, GECCO '07.

[10] Doug Hains,et al. Tunneling between optima: partition crossover for the traveling salesman problem , 2009, GECCO.