首页 | 本学科首页   官方微博 | 高级检索  
     

平面选址问题的引力搜索算法求解
引用本文:刘勇,马良. 平面选址问题的引力搜索算法求解[J]. 计算机工程与应用, 2012, 48(27): 42-44,62
作者姓名:刘勇  马良
作者单位:1. 盐城工学院基础教学部,江苏盐城224051;上海理工大学管理学院,上海200093
2. 上海理工大学管理学院,上海,200093
基金项目:国家自然科学基金(No.70871081);上海市重点学科建设项目(No.S30504);盐城工学院2010年度引进人员科研项目(No.XKR2010048)
摘    要:为求解平面选址问题,给出了一种基于引力搜索算法的求解方法。算法利用万有引力定律进行全局搜索,采用一种邻域搜索方法进行局部搜索,实现算法全局优化和局部优化的平衡。通过大量实验和与现有求解方法的比较,结果验证了算法的可行性和有效性。

关 键 词:选址问题  引力搜索算法  优化

Gravitational search algorithm for location problem
LIU Yong , MA Liang. Gravitational search algorithm for location problem[J]. Computer Engineering and Applications, 2012, 48(27): 42-44,62
Authors:LIU Yong    MA Liang
Affiliation:1.Foundation Courses Department,Yancheng Institute of Technology,Yancheng,Jiangsu 224051,China 2.School of Management,University of Shanghai for Science and Technology,Shanghai 200093,China
Abstract:A method based on gravitational search algorithm is proposed for solving location problem.The presented algorithm performs a global search due to the law of gravity and uses a neighborhood search method to balance between the global and local search abilities.The results and the comparison with existing methods show that the proposed algorithm is effective and efficient to solve location problem.
Keywords:location problem  gravitational search algorithm  optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号