期刊
COMPUTERS ENVIRONMENT AND URBAN SYSTEMS
卷 37, 期 -, 页码 45-58出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.compenvurbsys.2012.05.003
关键词
Land use planning; Genetic algorithms; Parallel programming; Distributed programming; Clusters of multi-core systems; GIS
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据