全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2005 

多维参数反演遗传算法的元胞自动机模型与应用

Keywords: 遗传算法,元胞自动机,城市扩展,北京

Full-Text   Cite this paper   Add to My Lib

Abstract:

摘要: 城市是一个自组织的复杂系统,其扩展受许多不确定性因素影响。元胞自动机(CA)模型具有强大的空间运算能力,可以有效地模拟复杂的动态系统,在模拟城市扩展及其他地理现象中,得到了良好的效果。转换规则是CA模型的核心,其利用由地理元胞的状态及空间关系得出的空间参数计算元胞的变化。空间参数权重的确定是模型应用的难点。现有的权重确定方法存在可靠性不高,运算量大等不足。通过一种改进的遗传算法--实数编码遗传算法可以自动获取参数的权重。分析表明,所提出的方法在CA模型运算时间、模拟精度方面均有所提高。

References

[1]  [1J周成虎,孙战利,谢一春.地理元胞自动机研究.北京:科 学出版社,1999.
[2]  Li X,A G 0 Yeh.Modeling sustainable urban develop- ment场the integration of constrained cellular automata and GIS.International Journal of Geographical Information Science,2000,14(2): 131152.
[3]  [3Wu F.Housing provision under globalization: a case study of Shanghai.Environment and Planning A,2001,33: 1741-1764.
[4]  Clarke K C,Hoppen S,Gaydos L.A self-modifying cellu- lar automata model of historical urbanization in the San Francisco Bay~.Environment and Planning B: Planning and Design,1997,24: 247-261.
[5]  Wu F Webster C J.Simulation of land development through the integration of cellular automata and multicrite- ria evaluation.Environment and Planning B,1998,25: 103-126.
[6]  Jin Chen,Peng Gong,Chunyang He,et al.Assessment of the urban development plan of Beijing by using a CA- based urban growth model.Photogrammetric Engineering &Remote Sensing,2002,68(10): 1063-1071.
[7]  邢文训,谢金星.现代优化计算方法.北京:清华大学出 版社,1999.
[8]  韩瑞峰,张永奎一种改进的实数编码遗传算法.计算机 工程与应用,2002,13: 78-80.
[9]  Li Xu.An economic environmental input-output model and its application to regional economic environmental impact analysis.Environment and Planning B,2001,28: 581一 594.
[10]  Li Xia,Anthony Gar-On Yeh.A constrained CA model for the simulation and planning of sustainable urban forms by using GIS.Environment and Planning B,2001,28: 733- 753.
[11]  Li Xia,Anthony Gar-On Yeh.A cellular automata model to simulate development density for urban planning.Envi- ronment and Planning B,2002,29: 431--450.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133