Frequency Assignment in Military Synchronous FH Networks with Cosite Constraints

摘要

Frequency Assignment Problems (FAPs) are among the hardest combinatorial optimization problems of great practical importance in radio communication industries. Metaheuristic algorithms for FAPs have received considerable attention in the literature, but no paper has addressed the question of FAPs with cosite constraints in frequency hopping (FH) networks. In this paper, we consider FAPs occurring in a military cosite FH communication, and the constraints considered include frequency gap constraints, spurious emission and response constraints, inter-modulation interference constraints, full-band constraints and given minimum gap constraints. The whole solution method is proposed and extensive computational experiments are carried out on realistic instances.