.png){kind=icon}
.png){kind=icon}
Return
Frequency assignment problem in satellite communications using differential evolution
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2010.03.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Satellite communications technology has a tremendous impact in refining our world. The frequency assignment problem is of a fundamental importance when it comes to providing high-quality transmissions in satellite communication systems. The NP-complete frequency assignment problem in satellite communications involves the rearrangement of frequencies of one set of carriers while keeping the other set fixed in order to minimize the largest and total interference among carriers. In this paper, we present a number of algorithms, based on differential evolution, to solve the frequency assignment problem. We investigate several schemes ranging from adaptive differential evolution to hybrid algorithms in which heuristic is embedded within differential evolution. The effectiveness and robustness of our proposed algorithms is demonstrated through solving a set of benchmark problems and comparing the results with a number of previously proposed techniques that solve the same problem. Experimental results show that our proposed algorithms, in general, and hybrid ones in particular, outperform the existing algorithms both in terms of the quality of the solutions and computational time. Crown Copyright (C) 2010 Published by Elsevier Ltd. All rights reserved.
Keywords:
Combinatorial optimization
Differential evolution
Evolutionary computations
Frequency assignment Problem
NP-complete
Satellite communication
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W