...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Systems and Computers in Japan >An Efficient Algorithm for a Fixed Frequency Assignment Problem with Limited Bandwidth Constraint
【24h】

An Efficient Algorithm for a Fixed Frequency Assignment Problem with Limited Bandwidth Constraint

机译：带宽受限的固定频率分配问题的高效算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we propose an efficient genetic algorithm (GA) for a fixed frequency assignment problem with limited bandwidth constraint. We propose a new GA-based algorithm for the problem of minimizing the weighted sum of damage due to interference and damage due to blocked call, which was formulated by Jin and colleagues. The proposed algorithm, which uses a steady-state GA that adaptively controls the mutation rate to search for an appropriate instruction sequence for a virtual machine performing the frequency assignment work, introduces a solution improvement algorithm based on a local search. The results of applying the proposed algorithm to benchmark problems, which show better performance than the existing GAs, indicate that this is an efficient algorithm.
机译：在本文中，我们针对带宽受限的固定频率分配问题提出了一种有效的遗传算法（GA）。我们提出了一种新的基于遗传算法的算法，用于最小化干扰和因阻塞呼叫造成的损害的加权总和，该算法由Jin和同事提出。所提出的算法使用自适应控制突变率的稳态GA来搜索执行频率分配工作的虚拟机的适当指令序列，并引入了一种基于局部搜索的解决方案改进算法。将提出的算法应用于基准问题的结果表明，这是比现有GA更好的性能，表明该算法是一种有效的算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号