返回
High performance genetic algorithm for land use planning
DOI:10.1016/j.compenvurbsys.2012.05.003.png)
摘要
En 中文
This study uses genetic algorithms to formulate and develop land use plans. The restrictions to be imposed and the variables to be optimized are selected based on current local and national legal rules and experts' criteria. Other considerations can easily be incorporated in this approach. Two optimization criteria are applied: land suitability and the shape-regularity of the resulting land use patches. We consider the existing plots as the minimum units for land use allocation. As the number of affected plots can be large, the algorithm execution time is potentially high. The work thus focuses on implementing and analyzing different parallel paradigms: multi-core parallelism, cluster parallelism and the combination of both. Some tests were performed that show the suitability of genetic algorithms to land use planning problems. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Land use planning
Genetic algorithms
Parallel programming
Distributed programming
Clusters of multi-core systems
GIS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.6K
被引数:
8.3K
机构
引用论文
A general-purpose parallel raster processing programming library test application using a geographic cellular automata model使用地理元胞自动机模型的通用并行光栅处理编程库测试应用程序

