1) adjacent mutation
邻近变异
1.
In this algorithm,the integer encoding technique based on node numbering is adopted, the adjacent mutation operator and partial mapped crossover operator integrating with the physical characteristic of power system and integer encoding strategy are presented.
算法采用基于节点编号的整数编码方式,结合电网的物理特性和十进制整数编码的特点,提出了部分映射交叉和邻近变异的操作算子;在遗传迭代结束后再引入邻域搜索技术,进一步挖掘全局最优解。
2) nearest neighbor partition mutation
最近邻划分变异
1.
This paper proposed a novel search strategy of the nearest neighbor partition mutation, and a new codebook design algorithm via the hybrid engine combining the evolutionary programming (EP) with the estimation of distribution algorithm (EDA).
提出一种以最近邻划分变异为搜索策略,并以EP(进化规划)与EDA(概率密度估计算法)相结合的混合进化方法作为搜索引擎的新型码书设计算法。
3) contiguous dissimilation
邻近异化
4) heuristic border upon mutation
邻域变异
1.
At first according to the value of individual fitness, the adaptive crossover and adaptive mutation are performed,and heuristic border upon mutation can speed up the anagenesis.
首先根据个体适应度值进行自适应交叉和变异操作,并采用启发式二次邻域变异的方法,使个体的进化更符合无功优化问题的实际,然后运用模拟退火进行个体更新,以便增加群的多样性,避免陷入局部最优;最后将所得最优解作为禁忌搜索的初始解,进行局部寻优求解过程。
5) variable k nearest neighbor
可变k近邻
6) Exotic contiguous relation
奇异邻近关系式
补充资料：邻近
1.附近。 2.接近。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条