A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements
In this paper we present a Population-Based Iterated Greedy (PBIG) algorithm for delimiting and zoning rural settlements. Each cadastral plots is allocated to a category (traditionalhistorical, common or none) considering restrictions such as the characteristics of the existing edifications and the building density. Since the problem has multiple solutions, heuristic search algorithms, as PBIG, are a good strategy to solve it. Besides the resolution of the problem according to the requirements of the laws, our work explores also new methods of delimitation. The comparison between both types of solutions can help to improve the current methodology. The algorithm, implemented using the Java programming language and integrated into an open-source GIS software, has been tested in rural settlements with different morphological characteristics, providing adjustable solutions to the specific needs of each rural settlement.
population-based iterated greedy algorithm rural settlements gis java land-use planning