Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCampos, Jean Carlos Tiburcio-
dc.contributor.authorMartins, Alexandre Xavier-
dc.contributor.authorSouza, Marcone Jamilson Freitas-
dc.identifier.citationCAMPOS, J. C. T.; MARTINS, A. X.; SOUZA, M. J. F. A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem. Electronic notes in discrete mathematics, v. 66, p. 159-166, abr. 2018. Disponível em: <>. Acesso em: 19 fev. 2019.pt_BR
dc.description.abstractThis work addresses the multi-level capacitated minimum spanning tree (MLCMST) problem. It consists of finding a minimal cost spanning tree such that the flow to be transferred from a central node (root) to the other nodes is bounded by the edge capacities. In this paper, a hybrid algorithm, combining the Variable Neighborhood Search (VNS) metaheuristic and one mathematical programming formulation of the literature, is used for solving it. The formulation is used to give an initial solution to VNS. Five neighborhoods are used for exploring the solution space. Results show that the VNS is able to improve the initial solutions and to obtain small gap solutions for all instance sets.pt_BR
dc.subjectMulti-level capacitated minimum spanning treept_BR
dc.subjectVariable neighborhood searchpt_BR
dc.subjectCombinatorial optimizationpt_BR
dc.subjectNeighborhood structurespt_BR
dc.titleA hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Appears in Collections:DEENP - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_HybridVNSAlgorithm.pdf656,17 kBAdobe PDFView/Open    Request a copy

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