运筹学

基于梯度的自适应快速布谷鸟搜索算法

展开
  • 1.南京工业大学计算机科学与技术学院, 南京 211816

收稿日期: 2016-02-01

  网络出版日期: 2016-09-15

基金资助

江苏省高校自然科学基金(No. 12KJB510007)

Gradient-based adaptive quick cuckoo search algorithm

Expand
  • 1. School of Computer Science and Technology, Nanjing Tech University, Nanjing 211816, China

Received date: 2016-02-01

  Online published: 2016-09-15

摘要

针对标准布谷鸟搜索(CS)算法存在全局搜索和局部搜索能力不平衡的缺点, 提出一种基于梯度的自适应快速布谷鸟搜索(GBAQCS)算法. 在改进的算法中, 针对偏好随机游动的步长, 在利用目标函数的梯度决定步长方向的基础上, 首先提出自适应搜索机制平衡了算法的全局搜索和局部搜索能力; 其次提出快速 搜索策略, 充分利用当前鸟巢信息进行精细化搜索, 从而提高算法的搜索精度和收敛速度. 实验结果表明, 相比其他算法, 所提出的改进策略使算法的全局搜索和局部搜索能力保持了相对的平衡, 并提高了算法的收敛性能.

本文引用格式

李荣雨, 刘洋 . 基于梯度的自适应快速布谷鸟搜索算法[J]. 运筹学学报, 2016 , 20(3) : 45 -56 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.03.005

Abstract

 For the problems of the unbalanced capability between global search and local search of standard cuckoo search (CS) algorithm, a gradient-based adaptive quick cuckoo search (GBAQCS) is proposed. The direction of the step is determined based on the sign of the gradient of the function. On the one hand, the adaptive search strategy is used to balance the global search and local search capability. On the other hand, the current-guided search method is adopted to improve the convergence precision and rate. The simulation experiments show that GBAQCS fully utilizes and balances the global search and local search capability, and greatly improves the convergence speed and quality of solutions compared with other optimization algorithms.

文章导航

/