- author = "Moritz J. Hildemann and Alan T. Murray and Judith Anne Verstegen",
- editor = "Roger Beecham and Jed A. Long and Dianna Smith and Qunshan Zhao and Sarah Wise",
- title = "Genetic Programming for Computationally Efficient Land Use Allocation Optimization",
- booktitle = "12th International Conference on Geographic Information Science, GIScience 2023",
- series = "LIPIcs",
- volume = "277",
- pages = "4:1--4:15",
- publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik",
- year = "2023",
- month = sep # " 12-15",
- address = "Leeds, UK",
- keywords = "genetic algorithms, genetic programming, Computation time reduction, Land use planning, Solution encoding, Spatial optimization, NSGA2, NSGA3, CoMOLA, repair",
- timestamp = "Sat, 30 Sep 2023 01:00:00 +0200",
-
biburl = "
https://dblp.org/rec/conf/giscience/HildemannMV23.bib",
- bibsource = "dblp computer science bibliography, https://dblp.org",
-
URL = "https://doi.org/10.4230/LIPIcs.GIScience.2023.4",
-
DOI = "
10.4230/LIPICS.GISCIENCE.2023.4",
-
URL = "https://research-portal.uu.nl/en/publications/genetic-programming-for-computationally-efficient-land-use-alloca/",
-
URL = "http://hdl.handle.net/1874/436314",
-
URL = "https://dspace.library.uu.nl/server/api/core/bitstreams/ddad1414-3f0c-4325-ba7c-379ab3c1aae6/content",
-
data_url = "https://data.mendeley.com/datasets/4tw223jvjv/4",
- size = "15 pages",
- abstract = "Land use allocation optimization is essential to identify ideal landscape compositions for the future. However, due to the solution encoding, standard land use allocation algorithms cannot cope with large land use allocation problems. Solutions are encoded as sequences of elements, in which each element represents a land unit or a group of land units. As a consequence, computation times increase with every additional land unit. We present an alternative solution encoding: functions describing a variable in space. Function encoding yields the potential to evolve solutions detached from individual land units and evolve fields representing the landscape as a single object. In this study, we use a genetic programming algorithm to evolve functions representing continuous fields, which we then map to nominal land use maps. We compare the scalability of the new approach with the scalability of two state-of-the-art algorithms with standard encoding. We perform the benchmark on one raster and one vector land use allocation problem with multiple objectives and constraints, with ten problem sizes each. The results prove that the run times increase exponentially with the problem size for standard encoding schemes, while the increase is linear with genetic programming. Genetic programming was up to 722 times faster than the benchmark algorithm. The improvement in computation time does not reduce the algorithm performance in finding optimal solutions; often, it even increases. We conclude that evolving functions enables more efficient land use allocation planning and yields much potential for other spatial optimization applications.",
-
notes = "'GP was up to 722 times faster than the NSGA 2 land
use allocation algorithm.'
GIScience 2023 https://giscience2023.github.io/",
