Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/11352
Title: HMS : a hybrid multi-start algorithm for solving binary linear programs.
Authors: Rezende, Josiane da Costa Vieira
Souza, Marcone Jamilson Freitas
Coelho, Vitor Nazário
Martins, Alexandre Xavier
Keywords: Variable neighborhood descent
Heuristic
Local branching
Binary problems
Constraint propagation
Issue Date: 2018
Citation: REZENDE, J. da C. V. et al. HMS : a hybrid multi-start algorithm for solving binary linear programs. Electronic Notes In Discrete Mathematics, v. 66, p. 7-14, abr. 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300489>. Acesso em: 19 fev. 2019.
Abstract: This work presents a hybrid multi-start algorithm for solving generic binary linear programs. This algorithm, called HMS, is based on a Multi-Start Metaheuristic and combines exact and heuristic strategies to address the problem. The initial solutions are generated by a strategy that applies linear programming and constraint propagation for defining an optimized set of fixed variables. In order to refine them, a local search, guided by a Variable Neighborhood Descent heuristic, is called, which, in turn, uses Local Branching cuts. The algorithm was tested in a set of binary LPs from the MIPLIB 2010 library and the results pointed out its competitive performance, resulting in a promising matheuristic.
URI: http://www.repositorio.ufop.br/handle/123456789/11352
metadata.dc.identifier.uri2: https://www.sciencedirect.com/science/article/pii/S1571065318300489
metadata.dc.identifier.doi: https://doi.org/10.1016/j.endm.2018.03.002
ISSN: 1571-0653
Appears in Collections:DEENP - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_HMSHybridMulti-start.pdf233,24 kBAdobe PDFView/Open    Request a copy


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