Discrete tree seed algorithm for urban land readjustment

• Published in: Engineering applications of artificial intelligence Vol. 112; p. 104783
• Main Authors: Koc, Ismail, Atay, Yilmaz, Babaoglu, Ismail
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.06.2022
• Subjects: Efficient TSA; Evolutionary algorithms; Hybrid approach; Spatial-based crossover and mutation operators; Swarm intelligence algorithms; Urban land readjustment; Swarm intelligence algorithms; Urban land readjustment; Hybrid approach; Spatial-based crossover and mutation operators; Evolutionary algorithms; Efficient TSA
• ISSN: 0952-1976; 1873-6769
• DOI: 10.1016/j.engappai.2022.104783

Land readjustment and redistribution (LR) is an important approach used to realize development plans by converting rural lands to urban land and also providing urban infrastructure. The LR problem, which is a complex challenging real-world problem, is a discrete optimization problem because its structure is similar to TSP (Traveling Salesman Problem) and scheduling problems which are combinatorial optimization problems. Since classical mathematical methods are insufficient for solving NP (Nondeterministic Polynomial) optimization problems due to time limitations, meta-heuristic optimization algorithms are commonly utilized for solving these kinds of problems. In this paper, meta-heuristic algorithms including genetic, particle swarm, differential evolution, artificial bee, and tree seed algorithms are utilized for solving LR problems. The stated meta-heuristic algorithms are used by applying spatial-based crossover and mutation operators depending upon the LR problem on each algorithm. Moreover, a synthetic dataset is used to ensure that the quality of the solution obtained is acceptable to everyone, to prove an optimal solution easily. By utilizing the suggested spatial-based crossover and mutation operators, finding the ideal solution is aimed using the synthetic dataset. In addition, five different modifications on TSA (Tree-Seed Algorithm) are performed and used to solve LR problems. All the modified versions of TSA are carried out only by changing the mechanism of seed reproduction. The novel TSA approaches are respectively named as tcTSA (tournament current), tbTSA (tournament best), pbTSA (personal-best based), t2TSA (double tournament), and elTSA (elitism based). In the experimental studies, the hybrid approach, which includes the crossover and mutation operators, is successfully applied in all of the algorithms under equal conditions for a fair comparison. According to experimental results performed using the dataset, it can be clearly stated that especially t2TSA outperforms all the algorithms in terms of performance and time.