Article ID: | iaor1992607 |
Country: | United States |
Volume: | 25 |
Issue: | 3 |
Start Page Number: | 175 |
End Page Number: | 182 |
Publication Date: | Aug 1991 |
Journal: | Transportation Science |
Authors: | Pirkul Hasan, Current John, Nagarajan V. |
In this paper the authors 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, the authors 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.