改进图聚类算法及其应用  

Improved graph clustering algorithm and its application

作　　者：丁利[1] 向来生[1] 刘希玉[1] 宋超超[1] 

机构地区：[1]山东师范大学管理科学与工程学院,济南250014

出　　处：《计算机应用》2012年第12期3278-3282,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61170038);山东省自然科学基金资助项目(ZR2011FM001)

摘　　要：第四方物流企业联盟建立问题是研究如何将区域内物流企业以一种高效、低联系代价的方式建立合作联盟的问题。针对该问题提出一种基于离散粒子群优化算法的改进图聚类算法,有助于降低合作联盟之间的联系代价。通过离散粒子群算法优化基本图聚类算法得到的初期聚类结果,利用扰动策略对优化结果进行再拓展。对于实验中的100家虚拟企业进行了聚类,使得联盟企业内部总联系代价从初始时的39991降低到最后的24800。实验结果表明,基于离散粒子群算法的改进图聚类算法能以较低的花费解决物流企业联盟建立问题。The fourth-party logistics company alliance building problem is to study how to build alliance with a method of high efficiency and low cost.An improved algorithm about graph clustering based on Particle Swarm Optimization（PSO） was proposed to solve the problem,and it contributed to reduce the connection cost between companies in the group.Discretization PSO was used to optimize the clustering result of graph clustering algorithm,and the result with disturbance strategies got enhanced.Clustering the 100 virtual companies,the cost was reduced from 39 991 to 24 800.The experimental result shows that,the improved graph clustering algorithm based on discretization PSO can solve the problem in a way with high efficiency and low cost.

关 键 词：第四方物流 企业联盟 图聚类 粒子群优化 离散化 扰动策略 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]