Abstract
The paper studies the problem of designing telecommunication networks using transmission facilities of two different capacities. The point-to-point communication demands are met by installing a mix of facilities of both capacities on the edges to minimize total cost. We consider 3-partitions of the original graph which results in smaller 3-node subproblems. The extreme points of this subproblem polyhedron are enumerated using a set of proposed theorems. We introduce a new approach for computing the facets of the 3-node problem based on polarity theory after obtaining the extreme points. The facets of the subproblem are then translated back to those of the original problem using an extended version of a previously known theorem. We have tested our approach on several randomly generated and real life networks. The computational results show that 3-partition facets reduce the integrality gap by approximately 30-50% compared to that provided by 2-partition facets. Also there is a substantial reduction in the size of the branch-and-bound tree if these facets are used.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, Y.K.: k-Partition-based facets of the network design problem. Networks 47(3), 123–139 (2006)
Atamtürk, A.: On capacitated network design cut-set polyhedra. Mathematical Programming B 92(3), 425–437 (2002)
Avella, P., Mattiab, S., Sassanob, A.: Metric inequalities and the network loading problem. Discrete Optimization 4(1), 103–114 (2007)
Barahona, F.: Network design using cut inequalities. SIAM Journal on Optimization 6(3), 823–837 (1996)
Bienstock, D., Günlük, O.: Capacitated network design - polyhedral structure and computation. INFORMS Journal on Computing 8(3), 243–259 (1996)
Bienstock, D., Chopra, S., Günlük, O., Tsai, C.: Minimum cost capacity installation for multicommodity network flows. Mathematical Programming 81(2), 177–199 (1998)
Günlük, O.: A branch-and-cut algorithm for capacitated network design problems. Mathematical Programming A 86(1), 17–39 (1999)
Lomonosov, M.V.: Combinatorial approaches to multiflow problems. Discrete Applied Mathematics 11(1), 1–93 (1985)
Magnanti, T.L., Mirchandani, P.: Shortest paths, single origin-destination network design and associated polyhedra. Networks 23(2), 103–121 (1993)
Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Operations Research 43(1), 142–157 (1995)
Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley, New York (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamid, F., Agarwal, Y.K. (2011). A Polyhedral Approach for Solving Two Facility Network Design Problem. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)