首页> 外文期刊>International Journal of Scientific & Technology Research >Minimizing Interference In Frequency Assignment Problem Based On Guided Particle Swarm Optimization Algorithm
【24h】

Minimizing Interference In Frequency Assignment Problem Based On Guided Particle Swarm Optimization Algorithm

机译:基于导粒子群优化算法的频率分配问题最小化

获取原文
           

摘要

This paper presents a modified approach based on Particle Swarm Optimization algorithm (PSO) for minimizing interference in Frequency Assignment Problem (FAP). This problem, known to be NP-hard, is to find an assignment of limited available frequencies for a number of communication cells. The main goal of the minimum interference FAP (MI-FAP) is to minimize the interference penalty cost provided in the solution. This cost related to the number of violated interference constraints, which predefined in interference matrix (IM). The modified algorithm named Guided search PSO (GPSO), which improve the particle location update strategy of the regular PSO to escape from local minimum. The proposed algorithm, enhance the convergence rate; robustness of the regular algorithm, and optimization stability of the search results. The computational efficiency and quality of the solutions obtained from the presented algorithm has been tested on well-known benchmark problems. The results obtained shows more efficiency than other results of previously related works.
机译:本文提出了一种基于粒子群优化算法(PSO)的改进方法,可将频率分配问题(FAP)中的干扰降至最低。已知为NP难题的这个问题是为多个通信小区找到有限的可用频率的分配。最小干扰FAP(MI-FAP)的主要目标是最小化解决方案中提供的干扰代价。此成本与在干扰矩阵(IM)中预定义的违反干扰约束的数量有关。改进后的算法名为“导引搜索PSO(GPSO)”,它改进了常规PSO的粒子位置更新策略以逃避局部最小值。提出的算法,提高了收敛速度;常规算法的鲁棒性以及搜索结果的优化稳定性。从提出的算法获得的解决方案的计算效率和质量已在众所周知的基准问题上进行了测试。获得的结果显示出比以前相关工作的其他结果更高的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号