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

利用离散霍普菲尔德神经网络解决基于"繁华度"的网点设计
引用本文:刘宇 李一安. 利用离散霍普菲尔德神经网络解决基于"繁华度"的网点设计[J]. 科学技术与工程, 2005, 5(8): 481-486
作者姓名:刘宇 李一安
作者单位:华中科技大学,计算机系,武汉,430074;华中科技大学,计算机系,武汉,430074
摘    要:针对2008年奥运会实际情况进行预测,首先从三次的调查结果中寻找规律,运用动态规划,逐步搜索最终得到最短路径,并求出各个商区的人流量。综合了人流量及该人流量的平均购买力来定义一个新的量:"繁华度",从而求出分配给各个商区的销售额。利用对商圈的研究的结论,得到用最少的商店满足最大人流需求的方案,根据克里斯塔勒的"中心地理论"和各个商区的人均消费水平,运用神经网络迭代并行处理优化;进一步求解,得到经过修正的大小规模商店个数,从而使结果更能符合实际预测2008年的情况。设计计算机仿真模拟算法,证明采用繁华度比例来分配商区规模是合理的。

关 键 词:奥运会  离散霍普菲尔德神经网络  最短路径  并行处理

Solution of Based-on-"prosperity" Net Point Design by Discrete Hopfield Neural Networks
LIU Yu,LI Yi''an. Solution of Based-on-"prosperity" Net Point Design by Discrete Hopfield Neural Networks[J]. Science Technology and Engineering, 2005, 5(8): 481-486
Authors:LIU Yu  LI Yi''an
Abstract:Focusing at predicting the reality in 2008 Olympic Games, the regularity is finded from the 3 researches, searches step by step by dynamic programming, gets the shortest route and people current at each business district. A new variable is thus defined: "prosperity", which is based on the people current and the purchasing power per head. The sales amount in each business district depends on the prosperity. Using the conclusion of the research on business circle, a scheme of satisfying the maximum people current need with least stores is got. Considering the "Central Place Theory" by Christaller and the consumption per head, optimizing by iterative parallel processing by neural networks and solving further, the modified number and scale of stores are got. In this way the result is powerful in predicting the reality in 2008 O-lympic Games. Design a computer analog simulation algorithm to prove that it is reasonable to distribute business district according to prosperity.
Keywords:Olympic Games discrete Hopfield neural networks shortest route parallel process
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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