Por favor, use este identificador para citar o enlazar este ítem:
http://www.repositorio.ufop.br/jspui/handle/123456789/11352
Título : | HMS : a hybrid multi-start algorithm for solving binary linear programs. |
Autor : | Rezende, Josiane da Costa Vieira Souza, Marcone Jamilson Freitas Coelho, Vitor Nazário Martins, Alexandre Xavier |
Palabras clave : | Variable neighborhood descent Heuristic Local branching Binary problems Constraint propagation |
Fecha de publicación : | 2018 |
Citación : | 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. |
Resumen : | 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 |
Aparece en las colecciones: | DEENP - Artigos publicados em periódicos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
ARTIGO_HMSHybridMulti-start.pdf Restricted Access | 233,24 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.