【24h】

Adaptive Local Search for a New Military Frequency Hopping Planning Problem

机译:自适应本地搜索新的军事跳频规划问题

获取原文

摘要

The military radio stations with frequency hopping propose new problems of frequency assignment which must take into account the size of the deployment, the limited resources and also new interferences constraints on transmitters. This new problem is public since the publication [1] with a set of 10 instances. The computing resources and the computing times are imposed. We tackle this problem with a method based on adaptive local search coming from the graph-coloring which manages phases of intensive research and diversified research. We developed several alternatives that are tested and compared on the scenarios.
机译:具有跳频的军用电台站提出了频率分配的新问题,该问题必须考虑到部署的大小,有限的资源以及发射器上的新干扰约束。这一新问题是公开的,因为发布了一组10实例。计算资源和计算时间。我们用基于自适应本地搜索的方法来解决这一问题,该方法来自图形着色,该方法管理密集研究和多元化研究的阶段。我们开发了几种测试的替代方案,并在方案上进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号