Article ID: | iaor20043276 |
Country: | Netherlands |
Volume: | 2 |
Issue: | 1 |
Start Page Number: | 37 |
End Page Number: | 56 |
Publication Date: | Jan 2003 |
Journal: | Journal of Mathematical Modelling and Algorithms |
Authors: | Mateus G.R., Smith J. MacGregor, Cruz F.R.B. |
Keywords: | location |
Multi-level network optimization problems arise in many contexts such as telecommunication, transportation, and electric power systems. A model for multi-level network design is formulated as a mixed-integer program. The approach is innovative because it integrates in the same model aspects of discrete facility location, topological network design, and dimensioning. We propose a branch-and-bound algorithm based on Lagrangian relaxation to solve the model. Computational results for randomly generated problems are presented showing the quality of our approach. We also present and discuss a real world problem of designing a two-level local access urban telecommunication network and solving it with the proposed methodology.