互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

基于仿射传播聚类的大规模选址布局问题求解唐东明 朱清新 杨 凡 白 勇


摘 要:选址布局问题是一个广泛研究的运筹学问题。通过将选址布局问题看做聚类问题,结合仿射传播聚类算法并且将候选地址的信息映射为特征向量,提出了两种求解选址布局问题的方法:基于块划分的选址布局方法和基于道路网络的选址布局方法。使用模拟数据集和真实数据集来评估两种方法,实验结果表明两种方法都能够求解设施资源受限和不受限情况下的选址布局问题,而且可以很好地解决大规模的选址布局问题。
  关键词:仿射传播聚类; 选址布局问题; 道路网络; 运筹学
  中图分类号:TP391 文献标志码:A
  文章编号:1001-3695(2010)03-0841-04
  doi:10.3969/j.issn.1001-3695.2010.03.009
  
  Solving large scale location problem using affinity propagation clustering
  
  TANG Dong-ming, ZHU Qing-xin, YANG Fan, BAI Yong
  
  (School of Computer Science & Engineering, University of Electronic Science & Technology of China, Chengdu 610054, China)
  
  Abstract:Location problem is a well-studied problem in operations research. By treating location problem as clustering problem, integrating affinity propagation clustering algorithm andmapping information of candidate into feature vector, this paper presented two methods to select suitably situation from candidate situation:location method based on region division and location method based on road network. It evaluated two methods using synthetic data sets as well as real-world data sets. The experimental results show that two methods can solve location problem with fixed number facilities and location problem with unfixed number facilities, and can solve large location problems and provide good solutions. ......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017