A branch and cut algorithm for the hierarchical network design problem
Loading...
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
ELSEVIER SCIENCE BV
Abstract
The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting the remaining nodes to the path. We optimally solve the problem using an ad hoc branch and cut procedure. Relaxed versions of a base model are solved using an optimization package and, if binary variables have fractional values or if some of the relaxed constraints are violated in the solution, cutting planes are added. Once no more cuts can be added. branch and bound is used. The method for finding valid cutting planes is presented. Finally, we use different available test instances to compare the procedure with the best known published optimal procedure, with good results. In none of the instances we needed to apply branch and bound, but only the cutting planes. (C) 2008 Elsevier B.V. All rights reserved.
Description
Keywords
Extensive facility location, Hierarchical networks, Branch and cut, Cutting planes, FORMULATION