The Multilevel Capacitated Minimum Spanning Tree Problem

Authors:
Ioannis Gamvros;Bruce Golden;S. Raghavan
Affiliations:
The Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815, USA;The Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815, USA;The Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815, USA
Venue:
INFORMS Journal on Computing
Year:
2006

Citing 6
Cited 2

The convex hull of two core capacitated network design problems

Mathematical Programming: Series A and B
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Minimum cost capacity installation for multicommodity network flows

Mathematical Programming: Series A and B - Special issue on computational integer programming
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Tabu Search for a Network Loading Problem with Multiple Facilities

Journal of Heuristics
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

INFORMS Journal on Computing

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

Journal of Heuristics
A filter-and-fan algorithm for the capacitated minimum spanning tree problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the multilevel capacitated minimum spanning tree (MLCMST) problem, a generalization of the well-known capacitated minimum spanning tree (CMST) problem, that allows for multiple facility types in the design of the network. We develop two flow-based mixed integer programming formulations that can be used to find tight lower bounds for MLCMST problems with up to 150 nodes. We also develop several heuristic procedures for the MLCMST problem. First, we present a savings-based heuristic. Next, we develop local search algorithms that use exponential size, node-based, cyclic and path exchange neighborhoods. Finally, we develop a hybrid genetic algorithm for the MLCMST. Extensive computational results on a large set of test problems indicate that the genetic algorithm is robust and, among the heuristics, generates the best solutions. They are typically 6.09% from the lower bound and 0.25% from the optimal solution value.