Please use this identifier to cite or link to this item:
Title: Heuristic methods to consecutive block minimization.
Authors: Soares, Leonardo Cabral da Rocha
Reinsma, Jordi Alves
Nascimento, Luis H. L.
Carvalho, Marco Antonio Moreira de
Keywords: Combinatorial problems
Iterated local search
Exact algorithms
Issue Date: 2020
Citation: SOARES, L. C. da R. et al. Heuristic methods to consecutive block minimization. Computers and Operations Research, v. 120, artigo 104948, 2020. Disponível em: <>. Acesso em: 25 ago. 2021.
Abstract: Many combinatorial problems addressed in the literature are modeled using binary matrices. It is often of interest to verify whether these matrices hold the consecutive ones property (C1P), which implies that there exists a permutation of the columns of the matrix such that all nonzero elements can be placed contiguously, forming a unique 1-block in every row. The minimization of the number of 1-blocks is approached by a well-known problem in the literature called consecutive block minimization (CBM), an N P-hard problem. In this study, we propose a graph representation, a heuristic based on a classical algorithm in graph theory, the implementation of a metaheuristic for solving the CBM and the application of an exact method based on a reduction of the CBM to a particular version of the well-known traveling salesman problem. Computational experiments demonstrate that the proposed metaheuristic implementation is competitive, as it matches or improves the best known solution values for all benchmark instances available in the literature, except for a single instance. The proposed exact method reports, for the first time, optimal solutions for these benchmark instances. Consequently, the proposed methods outperform previous methods and become the new state-of-the-art for solving the CBM.
ISSN: 0305-0548
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
896 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.