A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm

The land-use optimization involves divisions of land into subregions to obtain spatial configuration of compact subregions and desired connections among them. Computational geometry-based algorithms, such as Voronoi diagram, are known to be efficient and suitable for iterative design processes to ac...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International Journal of Geographical Information Science Ročník 35; číslo 5; s. 999 - 1031
Hlavní autori: Suppakitpaisarn, Vorapong, Ariyarit, Atthaphon, Chaidee, Supanut
Médium: Journal Article
Jazyk:English
Japanese
Vydavateľské údaje: Abingdon Taylor & Francis 04.05.2021
Informa UK Limited
Taylor & Francis LLC
Predmet:
Algorithms
Benchmarks
Computational geometry
Computer applications
Design optimization
Genetic algorithms
gradient descent method
interactive design
Iterative methods
Land use
Land-use optimization problem
Optimization
SDP-based graph drawing
Semidefinite programming
Voronoi diagram
Voronoi graphs
ISSN:1365-8816, 1362-3087, 1365-8824
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The land-use optimization involves divisions of land into subregions to obtain spatial configuration of compact subregions and desired connections among them. Computational geometry-based algorithms, such as Voronoi diagram, are known to be efficient and suitable for iterative design processes to achieve land-use optimization. However, such algorithms assume that generating point positions are given as inputs, while we usually do not know the positions in advance. In this study, we propose a method to automatically calculate the suitable point positions. The method uses (1) semidefinite programming to approximate locations while maintaining relative positions among locations; and (2) gradient descent to iteratively update locations subject to area constraints. We apply the proposed framework to a practical case at Chiang Mai University and compare its performance with a benchmark, the differential genetic algorithm. The results show that the proposed method is 28 times faster than the differential genetic algorithm, while the resulting land allocation error is slightly larger than that of the benchmark but still acceptable. Additionally, the output does not contain disconnected areas, as found in all evolutionary computations, and the compactness is almost equal to the maximum possible value.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1365-8816
1362-3087
1365-8824
DOI:10.1080/13658816.2020.1841203