• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Arabian Journal for Science and Engineering >A Neighborhood Search-Based Heuristic for the Fixed Spectrum Frequency Assignment Problem
【24h】

A Neighborhood Search-Based Heuristic for the Fixed Spectrum Frequency Assignment Problem

机译：固定频谱频率分配问题的基于邻域搜索的启发式方法

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

摘要

This article proposes a heuristic for the fixed spectrum frequency assignment (FS-FA) problem of telecommunications networks. A network composes of many connections, and each connection needs a frequency from the spectrum. The assignment of frequencies to the transmitters should satisfy a set of constraints. The constraints specify the separation which is necessary between frequencies of different transmitters. Violation of constraints creates interference. The goal of the FS-FA problem is to find an assignment of frequencies for the transmitters, which has minimum interference. The proposed heuristic has two main components: a local search heuristic and a compound move. The local search heuristic employs one-change moves (i.e., a move that changes the frequency of one transmitter at a time). It also employs a lookup table that classifies all possible one-change moves as positive or negative. The local search heuristic chooses positiveegative moves until it traps in a locally minimal solution. The compound-move operation shifts the local search to a new location in the search space. We can repeatedly apply the local search and compound move for many iterations. The proposed heuristic has been evaluated on the same benchmarks as used by others in the recently published literature. We have compared our algorithm with two existing tabu-search-based algorithms: dynamic-list-based tabu search (DTS) (Montemanni et al. in IEEE Trans Veh Technol 52(4):891-901, 2003. 10.1109/TVT.2003.810976) and heuristic manipulation technique-based TS (Montemanni and Smith in Comput Oper Res 37(3):543-551, 2010. 10.1016/j.cor.2008.08.006) (HMT). The solution quality of the proposed algorithm is found to be better than or equal to the HMT and DTS in 88% and 79% of test problems, respectively.
机译：本文针对电信网络的固定频谱频率分配（FS-FA）问题提出了一种启发式方法。网络由许多连接组成，每个连接都需要频谱中的一个频率。给发射机的频率分配应满足一组约束。约束条件规定了不同发射机频率之间必要的间隔。违反约束会产生干扰。 FS-FA问题的目的是为发射机找到频率分配，其干扰最小。提议的启发式方法有两个主要组成部分：局部搜索启发式方法和复合动作。本地搜索试探法采用一次更改动作（即一次更改一个发射机频率的动作）。它还使用了一个查找表，该表将所有可能的一次更改动作归为正或负。局部搜索启发式方法选择正/负移动，直到陷入局部最小解。复合移动操作将本地搜索移动到搜索空间中的新位置。我们可以重复应用局部搜索和复合移动进行多次迭代。提议的启发式方法已在与最近发表的文献中的其他人相同的基准上进行了评估。我们已经将我们的算法与两个现有的基于禁忌搜索的算法进行了比较：基于动态列表的禁忌搜索（DTS）（Montemanni等人在IEEE Trans Veh Technol 52（4）：891-901，2003.10.1109 / TVT。 2003.810976）和基于启发式操纵技术的TS（Montemanni和Smith在Comput Oper Res 37（3）：543-551，2010. 10.1016 / j.cor.2008.08.006）（HMT）。发现所提出算法的解决方案质量分别在88％和79％的测试问题中优于或等于HMT和DTS。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号