首页 | 本学科首页   官方微博 | 高级检索  
     


The dynamic frequency assignment problem
Authors:Audrey Dupont,André  a Carneiro Linhares,Christian Artigues,Dominique Feillet,Philippe Michelon,Michel Vasquez
Affiliation:1. Laboratoire d’Informatique d’Avignon, Université d’Avignon, Agroparc BP 1228, 84911 Avignon Cedex 9, France;2. Université de Toulouse, LAAS CNRS, 7 Avenue du Colonel Roche, 31077 Toulouse Cedex 4, France;3. Centre de Recherche LGI2P, Ecole des Mines d’Alès, Site EERIE, Parc Scientifique Georges Besse, 30035 Nîmes Cedex 01, France
Abstract: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.
Keywords:Frequency assignment   Dynamic problem   Heuristics   Tabu search and consistent neighborhood   Branch&  Bound
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号