2 research outputs found
A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem.
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