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

基于鲸鱼优化改进算法的基站选址
引用本文:唐丽晴,应忠于,罗云.基于鲸鱼优化改进算法的基站选址[J].计算机与现代化,2020,0(9):100-105.
作者姓名:唐丽晴  应忠于  罗云
作者单位:武警海警学院计算机教研室,浙江宁波315801
基金项目:公安部科技基金资助项目
摘    要:基站选址优化是网络通讯中的重要优化问题,对网络通讯质量有着极大的影响。本文基于基站选址优化问题的约束条件,以网络覆盖率作为优化指标,构建一种基站选址优化模型。传统优化算法有着收敛速度慢、易于陷入局部最优等问题,为此本文提出一种鲸鱼优化改进算法。首先,引入收敛因子随着迭代次数非线性递减的自适应改变策略以提升算法收敛能力;然后,对部分个体施加服从正态分布的变异扰动,以避免算法早熟收敛。其测试函数和基站选址优化问题的测试算例的仿真结果表明,本文提出的改进算法能够获得更理想的优化解,且具有较快的收敛速度。

关 键 词:基站选址  鲸鱼优化算法  收敛因子  余弦控制因子  变异扰动  
收稿时间:2020-09-24

Base Station Location Planning Based on Improved Whale Optimization Algorithm
Abstract:Base station location planning is a significant optimization problem in network communication, and there is a great impact on the quality of network communication. Based on the constrained conditions of base station location planning, this paper constructs a base station location planning optimization model with the network coverage as the optimization index. The traditional optimization algorithms have some disadvantages such as slow convergence rate, easy to fall into local optimal, so this paper proposes an improved whale optimization algorithm. Firstly, aiming at improving the algorithm convergence rate, an adaptive changing strategy for convergence factor decreasing with the iteration number nonlinearly is introduced to improve global convergence ability. Then, the variation disturbance which obeys normal distribution is applied in some individuals to avoid premature convergence of the algorithm. The simulation results of the benchmark functions and the test example of base station location planning test problem show that the improved algorithm proposed in this paper can obtain a more ideal optimal solution and has faster convergence rate.
Keywords:base station location planning  whale optimization algorithm  convergence factor  cosine decreasing factor  variation disturbance  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机与现代化》浏览原始摘要信息
点击此处可从《计算机与现代化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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