Pontificia Universidad Católica de Chile Pontificia Universidad Católica de Chile
Obreque C. and Marianov V. (2007)

An optimal procedure for solving the hierarchical network design problem. http://dx.doi.org/10.1080/07408170600941615

Revista : IIE Transactions
Volumen : 39
Número : 5
Páginas : 513-824
Tipo de publicación : ISI Ir a publicación


The hierarchical network design problem consists of finding a minimum cost bilevel network that connects all the nodes in a set, created by a loopless main path and a forest. The main path is formed by primary (higher cost) arcs, providing a path between an origin node and a destination node. The forest, built using secondary (lower cost) arcs, connects all the nodes not on the main path, to the path itself. We state and prove some properties of the problem, which allow finding good upper bounds to the solution in polynomial time when the primary costs are proportional to secondary costs. We also propose an O(n 4) procedure to improve on these bounds. In turn, these bounds are used to significantly reduce the number of nodes and arcs of the problem. Once the problem is reduced, large instances can be solved to optimality. At this stage, we use one of two linear integer optimization formulations. The first and preferred one is based on multicommodity flows, which avoids the formation of subtours. The second formulation avoids subtours by iteratively adding ad hoc constraints. We show some examples and provide computational experiments performed on networks with sizes up to 600 nodes and 14 000 arcs.