A Dual-Based Algorithm for Multi-Level Network Design
Name
OR-261-91.pdf
Size
2.2 MB
Format
Adobe PDF
Checksum (MD5)
082581b608cc2fc024caaed6ac8e3e68
Author(s)
Balakrishnan, Anantaram
Magnanti, Thomas L.
Mirchandani, Prakash
Date Issued
December 1991
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 261-91
Abstract
Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the Multi-level Network Design (MLND) problem seeks a fixed cost minimizing design that spans all the nodes and connects the nodes at each level by facilities of the corresponding or higher type. This problem generalizes the well-known Steiner network problem and the hierarchical network design problem, and has applications in telecommunication, transportation, and electric power distribution network design. In a companion paper we introduced the problem, studied alternative model formulations, and analyzed the worst-case performance of heuristics based on Steiner network and spanning tree solutions. This paper develops and tests a dual-based algorithm for the Multi-level Network Design (MLND) problem. The method first performs problem preprocessing to fix certain design variables, and then applies a dual ascent procedure to generate upper and lower bounds on the optimal value. We report extensive computational results on large, random networks (containing up to 500 nodes, and 5000 edges) with varying cost structures. The integer programming formulation of the largest of these problems has 20,000 integer variables and over 5 million constraints. Our tests indicate that the dualbased algorithm is very effective, producing solutions guaranteed to be within 0 to 0.9% of optimality.
Subjects
Network design, integer programming, dual ascent algorithm
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
