2021
DOI: 10.24996/ijs.2021.62.1.20
|View full text |Cite
|
Sign up to set email alerts
|

A Metaheuristic Approach to the C1S Problem

Abstract: Given a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…For this purpose, a fitness value, related to the objective of the optimization problem, is the key criterion for ranking the individuals. A chromosome with a larger fitness value has high probability of resulting in an optimal solution to the problem [37,38].…”
Section: Ga-based Power Allocation Schemementioning
confidence: 99%
“…For this purpose, a fitness value, related to the objective of the optimization problem, is the key criterion for ranking the individuals. A chromosome with a larger fitness value has high probability of resulting in an optimal solution to the problem [37,38].…”
Section: Ga-based Power Allocation Schemementioning
confidence: 99%
“…GA can be applied in different ways. 18,19 They are essentially distinguished by the way chromosomes are represented. Concerning simplicity and computation time, some representations can be suitable for a problem more than others.…”
Section: The Proposed Algorithmmentioning
confidence: 99%