Abstract
In this paper, we study the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting two edge-disjoint paths between source and destination node pairs and determining the location of the relays in the network to minimize the network cost. A constraint is imposed on the distance that a signal or commodity can travel in the network without being processed by a relay. An efficient and effective meta-heuristic approach is proposed to solve large sized problems and compared with construction heuristics and an exact approach run for up to 24 hours using CPLEX.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balakrishnan, A, Altinkemer, K (1992) Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing 4: 192–205
Cabral, EA, Erkut, E, Laporte, G, et al. (2007) The network design problem with relays. European Journal of Operational Research 180: 834–844
Choplin, S (2001). Virtual path layout in ATM path with given hop count. Proceedings of the First International Conference on Networking-Part 2, Colmar, France, Springer-Verlag.
Fogel, DB, Bäck, T, Michalewicz, Z (1999) Evolutionary Computation 1. IOP Publishing Ltd, Bristol, UK
Gouveia, L (1996) Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research 95: 178–190
Gouveia, L, Magnanti, TL (2003) Network flow models for designing diameter-constrained minimum spanning and Steiner trees. Networks 41: 159–173
Gouveia, L, Requejo, C (2001) A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. European Journal of Operational Research 132: 539–552
Hakimi, SL (1964) Optimum locations of switching centers and absolute centers and medians of graph. Operations Research 12: 450–459
Kulturel-Konak, S, Konak, A (2008) A Local Search Hybrid Genetic Algorithm Approach to the Network Design Problem with Relay Stations. in S. Raghavan, B. L. Golden and E. Wasil (ed) Telecommunications Modeling, Policy, and Technology. Springer, New York
Kwangil, L, Shayman, MA (2005) Optical network design with optical constraints in IP/WDM networks. IEICE Transactions on Communications E88-B: 1898–1905
LeBlanc, L, Reddoch, R (1990). Reliable link topology/capacity design and routing in backbone telecommunication networks. First ORSA Telecommunications SIG Conference.
Magnanti, TL, Mirchandani, P, Vachani, R (g and solving the two-facility capacitated network loading problem. Operations Research 43: 142–157
Monma, CL, Shallcross, DF (1989) Methods for designing communications networks with certain two-connected survivability constraints. Operations Research 37: 531–541
Randall, M, McMahon, G, Sugden, S (2002) A simulated annealing approach to communication network design. Journal of Combinatorial Optimization 6: 55–65
Suurballe, JW, Tarjan, RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14: 325–336
Voss, S (1999) The Steiner tree problem with hop constraints. Annals of Operations Research 86: 321–345
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Konak, A., Kulturel-Konak, S., Smith, A.E. (2009). Two-Edge Disjoint Survivable Network Design Problem with Relays. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds) Operations Research and Cyber-Infrastructure. Operations Research/Computer Science Interfaces, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88843-9_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-88843-9_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88842-2
Online ISBN: 978-0-387-88843-9
eBook Packages: Computer ScienceComputer Science (R0)