计算机应用研究2011，Vol.28Issue(12)：4513-4516,4.DOI:10.3969/j.issn.1001-3695.2011.12.030
求解粮库选址问题的量子粒子群优化算法
Quantum-behaved particle swarm optimization algorithm for locating grain storages
摘要
Abstract
This paper analyzed grain storage' s main function and principle of site selection, and built the grain storages loca-tion model. Taking account of the obstacle constraints, chose the spatial clustering algorithm with obstacle constraints based on QPSO to solution this model. Then studied the case under the application background of the sites selection for Henan grain stor-age. The experimental results improve the scientificalness of the sites selection for grain storage using optimization algorithm, and provide guidance for actual application.关键词
量子粒子群优化/粮库选址/带障碍约束/空间聚类Key words
quantum-behaved particle swarm optimization(QPSO) / sites selection for grain storage/ obstacle constraints/ spatial clustering/分类
信息技术与安全科学引用本文复制引用
张雪萍,杨腾飞,付晓炎,王家耀..求解粮库选址问题的量子粒子群优化算法[J].计算机应用研究,2011,28(12):4513-4516,4.基金项目
国家教育部新世纪优秀人才支持计划资助项目(NCET-08-0660) （NCET-08-0660）
河南省科技攻关资助项目(0624220081) （0624220081）
