Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/11351
Título: | A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem. |
Autor(es): | Campos, Jean Carlos Tiburcio Martins, Alexandre Xavier Souza, Marcone Jamilson Freitas |
Palavras-chave: | Multi-level capacitated minimum spanning tree Variable neighborhood search Combinatorial optimization Neighborhood structures |
Data do documento: | 2018 |
Referência: | CAMPOS, 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: <https://www.sciencedirect.com/science/article/pii/S1571065318300672>. Acesso em: 19 fev. 2019. |
Resumo: | This 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. |
URI: | http://www.repositorio.ufop.br/handle/123456789/11351 |
Link para o artigo: | https://www.sciencedirect.com/science/article/pii/S1571065318300672 |
DOI: | https://doi.org/10.1016/j.endm.2018.03.021 |
ISSN: | 1571-0653 |
Aparece nas coleções: | DEENP - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_HybridVNSAlgorithm.pdf Restricted Access | 656,17 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.