Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.13091/881
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKoç, İsmail-
dc.contributor.authorBabaoğlu, İsmail-
dc.date.accessioned2021-12-13T10:32:06Z-
dc.date.available2021-12-13T10:32:06Z-
dc.date.issued2021-
dc.identifier.issn1568-4946-
dc.identifier.issn1872-9681-
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2020.106753-
dc.identifier.urihttps://hdl.handle.net/20.500.13091/881-
dc.description.abstractLand Readjustment and redistribution (LR) is a land management tool that helps regular urban development with the contribution of landowners. The main purpose of LR is to transform irregularly developed land parcels into suitable forms. Since it is necessary to handle many criteria simultaneously to solve LR problems, classical mathematical methods can be insufficient due to time limitation. Since LR problems are similar to traveling salesman problems and typical scheduling problems in terms of structure, they are kinds of NP-hard problems in combinatorial optimization. Therefore, metaheuristic algorithms are used in order to solve NP-hard problems instead of classical methods. At first, in this study, an effective problem-specific objective function is proposed to address the main criteria of the problem. In addition, a map-based crossover operator and three different mutation operators are proposed for the LR, and then a hybrid approach is implemented by utilizing those operators together. Furthermore, since the optimal value of the problem handled in real world cannot be exactly estimated, a synthetic dataset is proposed as a benchmarking set in LR which makes the success of algorithms can be objectively evaluated. This dataset consists of 5 different problems according to number of parcel which are 20, 40, 60, 80 and 100. Each problem set consists of 4 sub-problems in terms of number of landowners per-parcel which are 1, 2, 3 and 4. Therefore, the dataset consists of 20 kinds of problems. In this study, artificial bee colony, particle swarm optimization, differential evolution, genetic and tree seed algorithm are used. In the experimental studies, five algorithms are set to run under equal conditions using the proposed synthetic dataset. When the acquired experimental results are examined, genetic algorithm seems to be the most effective algorithm in terms of both speed and performance. Although artificial bee colony has better results from genetic algorithm in a few problems, artificial bee colony is the second most successful algorithm after genetic algorithm in terms of performance. However, in terms of time, artificial bee colony is an algorithm nearly as successful as genetic algorithm. On the other hand, the results of differential evolution, particle swarm optimization and tree seed algorithms are similar to each other in terms of solution quality. In conclusion, the statistical tests clearly show that genetic algorithm is the most effective technique in solving LR problems in terms of speed, performance and robustness. (C) 2020 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherELSEVIERen_US
dc.relation.ispartofAPPLIED SOFT COMPUTINGen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSwarm Intelligenceen_US
dc.subjectUrban Land Readjustmenten_US
dc.subjectMap-Based Crossover And Mutation Operatoren_US
dc.subjectSynthetic Dataseten_US
dc.subjectArtificial Bee Colonyen_US
dc.subjectTree-Seed Algorithmen_US
dc.subjectDifferential Evolutionen_US
dc.subjectGenetic Algorithmen_US
dc.subjectOptimizationen_US
dc.subjectImplementationen_US
dc.subjectGrowthen_US
dc.subjectImageen_US
dc.subjectToolen_US
dc.titleA comparative study of swarm intelligence and evolutionary algorithms on urban land readjustment problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.asoc.2020.106753-
dc.identifier.scopus2-s2.0-85092012210en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.identifier.volume99en_US
dc.identifier.wosWOS:000608175000015en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.authorscopusid57190306475-
dc.authorscopusid23097339300-
item.openairetypeArticle-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextembargo_20300101-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept02.13. Department of Software Engineering-
crisitem.author.dept02.03. Department of Computer Engineering-
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections
Files in This Item:
File SizeFormat 
1-s2.0-S1568494620306918-main.pdf
  Until 2030-01-01
7.88 MBAdobe PDFView/Open    Request a copy
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

3
checked on Mar 23, 2024

WEB OF SCIENCETM
Citations

7
checked on Mar 23, 2024

Page view(s)

162
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.