K-meanssuanfa

代码说明：

  邻域法。文献[ 24 ]提出一种基于动态邻域的选择策略,将一个目标定义为优化目标,而将其它所有目标定义为邻域目标,进而提出了选择全局最优粒子的动态邻域策略,但该方法对优化目标的选择以及邻域目标函数的排序较敏感。(Neighborhood method. [24] proposed a dynamic neighborhood based on the choice of strategy, a goal is defined as the optimization objective, and all other objectives will be defined as a neighborhood goals, and then select the global optimal particle proposed dynamic neighborhood strategy, but the Methods for optimizing the choice of target and neighborhood sensitive sort of objective function.)