Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem

Authors:
Luis Gouveia;Ana Paias;Dushyant Sharma
Affiliations:
Faculdade de Ciências, Departamento de Estatística e Investigação Operacional, Centro de Investigação Operacional, Universidade de Lisboa, Lisbon, Portugal 1749-016;Faculdade de Ciências, Departamento de Estatística e Investigação Operacional, Centro de Investigação Operacional, Universidade de Lisboa, Lisbon, Portugal 1749-016;Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, USA 48109
Venue:
Journal of Heuristics
Year:
2011

Citing 7
Cited 0

The design of centralized networks with reliability and availability constraints

Computers and Operations Research
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

Computers and Operations Research
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Extended neighborhood: Definition and characterization

Mathematical Programming: Series A and B
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
The 2-hop spanning tree problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop, study and test new neighborhood structures for the Hop-constrained Minimum Spanning Tree Problem (HMSTP). These neighborhoods are defined by restricted versions of a new dynamic programming formulation for the problem and provide a systematic way of searching neighborhood structures based on node-level exchanges. We have also developed several local search methods that are based on the new neighborhoods. Computational experiments for a set of benchmark instances with up to 80 nodes show that the more elaborate methods produce in a quite fast way, heuristic solutions that are, for all cases, within 2% of the optimum.