High performance genetic algorithm for land use planning
View/ Open
Use this link to cite
http://hdl.handle.net/2183/20937
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España
Collections
- GI-GAC - Artigos [193]
Metadata
Show full item recordTitle
High performance genetic algorithm for land use planningAuthor(s)
Date
2013Citation
Porta, J., Parapar, J., Doallo, R., Rivera, F. F., Santé, I., & Crecente, R. (2013). High performance genetic algorithm for land use planning. Computers, Environment and Urban Systems, 37, 45-58.
Abstract
[Abstract] 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.
Keywords
Land use planning
Genetic algorithms
Parallel programming
Distributed programming
Clusters of multi-core systems
GIS
Genetic algorithms
Parallel programming
Distributed programming
Clusters of multi-core systems
GIS
Editor version
Rights
Atribución-NoComercial-SinDerivadas 3.0 España
ISSN
0198-9715
1873-7587
1873-7587