Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/jspui/handle/123456789/14446
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSoares, Leonardo Cabral da Rocha-
dc.contributor.authorReinsma, Jordi Alves-
dc.contributor.authorNascimento, Luis H. L.-
dc.contributor.authorCarvalho, Marco Antonio Moreira de-
dc.date.accessioned2022-02-07T18:53:05Z-
dc.date.available2022-02-07T18:53:05Z-
dc.date.issued2020pt_BR
dc.identifier.citationSOARES, L. C. da R. et al. Heuristic methods to consecutive block minimization. Computers and Operations Research, v. 120, artigo 104948, 2020. Disponível em: <https://www.sciencedirect.com/science/article/abs/pii/S0305054820300654>. Acesso em: 25 ago. 2021.pt_BR
dc.identifier.issn0305-0548-
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/14446-
dc.description.abstractMany 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.pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectCombinatorial problemspt_BR
dc.subjectMetaheuristicpt_BR
dc.subjectIterated local searchpt_BR
dc.subjectExact algorithmspt_BR
dc.titleHeuristic methods to consecutive block minimization.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.identifier.uri2https://www.sciencedirect.com/science/article/abs/pii/S0305054820300654pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.cor.2020.104948pt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

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


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