Abo-Alsabeh, Rewayda and Salhi, Abdellah (2021) A Metaheuristic Approach to the C1S Problem. Iraqi Journal of Science, 62 (1). pp. 218-227. DOI https://doi.org/10.24996/ijs.2021.62.1.20
Abo-Alsabeh, Rewayda and Salhi, Abdellah (2021) A Metaheuristic Approach to the C1S Problem. Iraqi Journal of Science, 62 (1). pp. 218-227. DOI https://doi.org/10.24996/ijs.2021.62.1.20
Abo-Alsabeh, Rewayda and Salhi, Abdellah (2021) A Metaheuristic Approach to the C1S Problem. Iraqi Journal of Science, 62 (1). pp. 218-227. DOI https://doi.org/10.24996/ijs.2021.62.1.20
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 performed on real-world and randomly generated matrices of the set covering type.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Approximation algorithm; Genetic algorithm; Consecutive Ones Property; Consecutive Block Minimization |
Divisions: | Faculty of Science and Health Faculty of Science and Health > Mathematics, Statistics and Actuarial Science, School of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 04 Oct 2024 10:55 |
Last Modified: | 04 Oct 2024 10:55 |
URI: | http://repository.essex.ac.uk/id/eprint/39329 |
Available files
Filename: 1415-Article+Text-32226-35256-10-20210129.pdf
Licence: Creative Commons: Attribution 4.0