This paper proposes a direct search algorithm for global optimization and multi-peak searching of functions with boundary constraints. 针对边界约束函数全局最优化和多峰寻优问题,提出一种直接搜索算法(SA)。
We propose a two layers neighborhood search algorithm to avoid the separation between agent choices and road optimization. 为了避免将代理商选择和线路优化作为两个互相分离的子问题来处理,提出了求解它的两层邻域搜索算法(SA)。
In this paper, a local optimization search algorithm was introduced to accelerate the convergence velocity and mitigated the influence of the initial value. 引入了局部优化搜索算法(SA),加快了算法的收敛速度,减轻了初值对结果的影响。
Based on3D cell grids, we proposed a new K-nearest neighbors search algorithm. 提出了一种新的基于立方体小栅格的K邻域搜索算法(SA)。
A fast block-matching search algorithm based on down-sampling named Down-sampling Three Step Search ( DTSS ) was proposed. 提出一种基于下采样的快速块匹配搜索算法(SA)&下采样三步搜索算法(SA)(DTSS)。