.png){kind=icon}
.png){kind=icon}
Return
The dynamic frequency assignment problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2008.01.028.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring frequency assignments need to be established throughout a battlefield deployment. The problem resolution framework decomposes into three phases: assignment of an initial kernel of communications, dynamic assignment of new communication links and a repair process when no assignment is possible. Different solution methods are proposed and extensive computational experiments are carried out on realistic instances. (c) 2008 Elsevier B.V. All rights reserved.
Keywords:
Frequency assignment
Dynamic problem
Heuristics
Tabu search and consistent neighborhood
Branch&Bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations