A Comparison of Binary and Integer Encodings in Genetic Algorithms for the Maximum <i>k</i>-Coverage Problem with Various Genetic Operators

A Comparison of Binary and Integer Encodings in Genetic Algorithms for the Maximum <i>k</i>-Coverage Problem with Various Genetic Operators

The maximum <i>k</i>-coverage problem (MKCP) is a problem of finding a solution that includes the maximum number of covered rows by selecting <i>k</i> columns from an <i>m</i> <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" disp...

Full description

Saved in:
Bibliographic Details
Main Authors: Yoon Choi, Jingeun Kim, Yourim Yoon
Format: Article
Language:English
Published: MDPI AG 2025-04-01
Series:Biomimetics
Subjects:
maximum k-coverage problem
genetic algorithm
combinatorial optimization
binary encoding
integer encoding
Online Access:https://www.mdpi.com/2313-7673/10/5/274
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2313-7673/10/5/274

Similar Items