Gene-similarity normalization in a genetic algorithm for the maximum k-Coverage problem
- Authors
- Yoon Y.; Kim Y.-H.
- Issue Date
- Apr-2020
- Publisher
- MDPI AG
- Keywords
- Genetic algorithm; Maximum k-coverage; Normalization; Redundant representation
- Citation
- Mathematics, v.8, no.4
- Journal Title
- Mathematics
- Volume
- 8
- Number
- 4
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/47131
- DOI
- 10.3390/math8040513
- ISSN
- 2227-7390
- Abstract
- The maximum k-coverage problem (MKCP) is a generalized covering problem which can be solved by genetic algorithms, but their operation is impeded by redundancy in the representation of solutions to MKCP. We introduce a normalization step for candidate solutions based on distance between genes which ensures that a standard crossover such as uniform and n-point crossovers produces a feasible solution and improves the solution quality. We present results from experiments in which this normalization was applied to a single crossover operation, and also results for example MKCPs. © 2020 by the authors.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 컴퓨터공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/47131)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.