High performance genetic algorithm for land use planning
Ver/Abrir
Use este enlace para citar
http://hdl.handle.net/2183/20937
Excepto si se señala otra cosa, la licencia del ítem se describe como Atribución-NoComercial-SinDerivadas 3.0 España
Colecciones
- GI-GAC - Artigos [193]
Metadatos
Mostrar el registro completo del ítemTítulo
High performance genetic algorithm for land use planningAutor(es)
Fecha
2013Cita bibliográfica
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.
Resumen
[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.
Palabras clave
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
Versión del editor
Derechos
Atribución-NoComercial-SinDerivadas 3.0 España
ISSN
0198-9715
1873-7587
1873-7587