A Java-based Parallel Genetic Algorithm for the Land Use Planning Problem
In this work, the application of genetic algorithms to the elaboration of land use plans is studied. These plans follow the national legal rules and experts' considerations. Two optimization criteria are applied: aptitude and compactness. As the number of affected plots can be large and, consequently, the execution time of the algorithm can be potentially high, the work is focused on the implementation and analysis of different parallel paradigms: multi-core parallelism, cluster parallelism and the combination of both.
keywords:
Publication: Congress
1624015019688
June 18, 2021
/research/publications/a-java-based-parallel-genetic-algorithm-for-the-land-use-planning-problem
In this work, the application of genetic algorithms to the elaboration of land use plans is studied. These plans follow the national legal rules and experts' considerations. Two optimization criteria are applied: aptitude and compactness. As the number of affected plots can be large and, consequently, the execution time of the algorithm can be potentially high, the work is focused on the implementation and analysis of different parallel paradigms: multi-core parallelism, cluster parallelism and the combination of both. - J. Porta, J. Parapar, G. Taboada, R. Doallo, F.F. Rivera, I. Sante, M. Suárez, M. Boullón and R. Crecente - 10.1145/2001858.2001978
publications_en