GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem

Authors:
Alexandre X. Martins;Mauricio C. Souza;Marcone J. Souza;Túlio A. Toffolo
Affiliations:
Departamento de Ciências Exatas e Aplicadas, Universidade Federal de Ouro Preto, João Monlevade, Brazil;Departamento de Engenharia de Produção, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil cep: 31250-970;Departamento de Computação, Universidade Federal de Ouro Preto, Ouro Preto, Brazil;Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
Venue:
Journal of Heuristics
Year:
2009

Citing 8
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Tabu Search for a Network Loading Problem with Multiple Facilities

Journal of Heuristics
An Oil Pipeline Design Problem

Operations Research
A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy

Metaheuristics
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations

Computers and Operations Research
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

Computers and Operations Research
The Multilevel Capacitated Minimum Spanning Tree Problem

INFORMS Journal on Computing
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a GRASP using an hybrid heuristic-subproblem optimization approach for the Multi-Level Capacitated Minimum Spanning Tree (MLCMST) problem. The motivation behind such approach is that to evaluate moves rearranging the configuration of a subset of nodes may require to solve a smaller-sized MLCMST instance. We thus use heuristic rules to define, in both the construction and the local search phases, subproblems which are in turn solved exactly by employing an integer programming model. We report numerical results obtained on benchmark instances from the literature, showing the approach to be competitive in terms of solution quality. The proposed GRASP have in fact improved the best known upper bounds for almost all of the considered instances.