求解k中间点问题的新局部搜索算法  

New local search algorithm for k-median problem

作　　者：潘锐[1] 朱大铭[2] 董林光[1] 董颖[1] 

机构地区：[1]山东省农村信用社联合社计算机网络中心,济南250001 [2]山东大学计算机科学与技术学院,济南250061

出　　处：《计算机工程与应用》2008年第4期36-38,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.60573024)

摘　　要：为有效求解大规模k中间点问题,利用适应度距离相关性方法分析,发现该问题局部最优解的适应度与其到全局最优解的距离无太大关系,且多个局部最优解求交所得子集以极大概率包含全局最优解中的元素,进而提出一种基于求交操作的k中间点问题局部搜索算法。实验结果表明该算法在求解质量上与目前已知算法相比有较大改进。Aiming at effectively solving the large-scale k-median problem,by using fitness distance correlation method,this paper finds that there is little relation between the fitness of local minimum and the distance of local minimum to global minimum,and that the intersection of local minima contains the members in global minimum with a high probability.Then a intersection-based local search algorithm for k-median problem is proposed.Finally,the experimental results show that the algorithm outperforms the known algorithms in the quality of solutions.

关 键 词：k-中间点 组合优化 局部搜索 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]