期刊文献+

大型城市地下物流网络优化布局的模拟植物生长算法 被引量:41

Optimization layout of underground logistics network in big cities with plant growth simulation algorithm
原文传递
导出
摘要 交通拥堵问题的加剧使传统物流网络在我国大型城市已达到极限,未来地面物流系统将逐步向地下不同层次里转移并释放出城市地上空间.本文以斯坦纳最小树(SMT)为理论模型,建立了符合我国大型城市不断扩展这一特点的树状地下物流网络布局模型.由于SMT为NP-完全问题,因此算法的寻优能力是研究的关键.本文所采用的模拟植物生长算法(PGSA)是以植物向光性理论为启发式准则的智能算法,该算法是利用人工植物在给定物流节点集解空间中的生长过程得到城市地下物流网络的最优布局.通过对国际公布的STEINLIB实例数据计算并与蚁群算法和模拟退火算法进行比较,表明模拟植物生长算法具有较强的精确性、稳定性和全局搜索能力. With the aggravation of traffic jam traditional logistics network has reached high-point in big cities in China, so the logistics system on the ground will gradually transfer to underground on various layers in the future so as to release the ground space in cities. Based on SMT theory, this paper establishes underground tree logistics network layout model. Because SMT is NP-complete problem, the algorithm optimization capability is the key of research. Plant growth simulation algorithm (PGSA) in this paper is an intelligence optimization algorithm, which takes plant phototropism growth pattern as its heuristic criterion. Through artificial plant growth process in solution space of given logistics node set, we can get the optimal layout of underground logistics network in cities. Through the calculation of STEINLIB lab data announced internationally, PGSA is demonstrated with better accuracy, stability and global searching ability, by comparing the solutions of ant algorithm and simulated annealing algorithm.
作者 李彤 王众托
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2013年第4期971-980,共10页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(71171070,71072161,71173066) 教育部人文社科基金(12YJAZH063) 浙江省自然科学基金(Y7-100447) 浙江省高校人文社科重点研究基地“决策科学与创新管理”重大项目(RWSKZD04-2012ZB,RWSKZD04-2012ZB3)
关键词 城市地下物流 模拟植物生长算法 斯坦纳最小树 最优布局 city underground logistics plant growth sinmlation algorithm Steiner minimum tree theoptimal layout
  • 相关文献

参考文献47

  • 1Noon C E, Hankins C. Spatial data visualization in healthcare: Supporting a facility location decision via GIS- based market analysis[C]// 34th Annual Hawaii International Conference on System Sciences, 2001.
  • 2Brimberg J, ReVelle C. Solving the plant location problem on a line by linear programming[J]. TOP, 1998, 6(2): 277-286.
  • 3王淳,程浩忠,谭永香,翁新林.发电机组检修计划的模拟植物生长算法[J].电工技术学报,2008,23(9):105-110. 被引量:15
  • 4Ambrosino D, Grazia Scutella M. Distribution network design: New problems and related models[J]. European Journal of Operational Research, 2005, 165(3): 610 624.
  • 5罗伟强,于建涛,黄家栋.一种求非线性整数规划最优解的仿生算法[J].计算机工程与应用,2008,44(7):57-59. 被引量:17
  • 6Taniguchi E, Thompson R C. Modeling city logistics[J]. Transportation Research Record, 2002, 1790: 45-51.
  • 7王淳,程浩忠.基于模拟植物生长算法的电力系统无功优化[J].电网技术,2006,30(21):37-41. 被引量:23
  • 8Wang C, Cheng H Z, Yao L Z. Reactive power optimization by plant growth simulation algorithm[C]// Third International Conference on Electric Utility Deregulation and Restructuring and Power Technologies, 2008(4): 771-774.
  • 9Thiruvenkadam S, Nirmalkumar A, Sakthivel A. Energy management of large distribution network with plant growth simulation algorithm and heuristic fuzzy[J]. International Journal on Electronic &: Electrical Engineering, 2009, 1(1): 97-108.
  • 10Drezner Z, Wesolowsky G O. The Weber problem on the plane with some negative weights[J]. INFOR Journal, 1991, 29: 87-99.

二级参考文献264

共引文献452

同被引文献389

引证文献41

二级引证文献198

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部