Handayanto, Rahmadya Trias and Guha, Sumanta and Tripathi, Nitin Kumar and Herlawati, Herlawati (2018) Genetic algorithms with variable length chromosomes for high constraint problems in spatial data. In: Proceedings of the 3rd International Conference on Informatics and Computing, ICIC 2018.
![[img]](http://repository.unismabekasi.ac.id/style/images/fileicons/text.png) |
Text
handayanto2018-GAs.pdf - Published Version Download (893kB) |
Abstract
Constraint handling is the main task in constrained optimization problems. Variable length chromosomes in the genetic algorithm has been used widely for faster computation, but in this study it was used to handle the constraint as well. This method uses the characteristic of the genetic algorithm with bit-strings conversion from real numbers. By the bit-strings format, the population of the candidates can be limited only in the study area where it is impossible when the real number format is used. Therefore, it will reduce the searching area and make the optimization process faster. Variable length chromosomes method can also be integrated with another constraint handling, i.e. the death penalty method. The results showed that the proposed method was able to optimize land use in Bekasi City, Indonesia, as a case study. © 2018 IEEE.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Cited by: 0 |
| Keywords / Kata Kunci: | constrained-optimization, death penalty, constraint handling, Bekasi City |
| Subjects: | Geoteknik Jaringan Komputer |
| Faculty: | Fakultas Teknik > Teknik Komputer D3 |
| Depositing User: | Mr. Pustakawan Fatek |
| Date Deposited: | 07 Dec 2023 13:30 |
| Last Modified: | 07 Dec 2023 13:42 |
| URI: | http://repository.unismabekasi.ac.id/id/eprint/4470 |
Actions (login required)
 |
View Item |