The Hierarchical Network Design Problem: A New Formulation and Solution Procedures

Hasan Pirkul, John Current and V. Nagarajan
Additional contact information
Hasan Pirkul: College of Business, The Ohio State University, Columbus, Ohio 43210-1399
John Current: College of Business, The Ohio State University, Columbus, Ohio 43210-1399
V. Nagarajan: College of Business, The Ohio State University, Columbus, Ohio 43210-1399

Transportation Science, 1991, vol. 25, issue 3, 175-182

Abstract: In this paper we develop a new heuristic for the hierarchical network design problem. The heuristic is based upon Lagrangian relaxation of a reformulation of the problem. In addition, we develop a branch and bound algorithm to identify the optimal solution for the 5% of the test problems for which the new heuristic failed to do so. This algorithm proved to be very efficient due to the tight bounds generated by the heuristic.

Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.25.3.175 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:25:y:1991:i:3:p:175-182

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().