Abstract
This paper presents the main findings when approaching an optimization problem proposed to us by a telecommunication company in Austria. It concerns deploying a broadband telecommunications system that lays optical fiber cable from a central office to a number of end-customers, i.e., fiber to the home technology. End-customers represent buildings with apartments and/or offices. It is a capacitated network design problem that requires an installation of optical fiber cables with sufficient capacity to carry the traffic from the central office to the end-customers at minimum cost. This type of problem arises in the design of a Local Access Network (LAN) and in the literature is also named Single-Source Network Loading. In the situation motivating our work the network does not necessarily need to connect all customers (or at least not with the best available technology). Instead, some nodes are potential customers. The aim is to select the customers to be connected to the central server and to choose the cable capacities to establish these connections. The telecom company takes the strategic decision of fixing a percentage of customers that should be served, and aims for minimizing the total cost of the network proving this minimum service. For that reason the underlying problem is called the Prize-Collecting LAN problem (PC-LAN). We propose a sophisticated heuristic to solve real-world instances with up to 86000 nodes and around 1500 potential customers.
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
Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization. Operations Research/Computer Science Interfaces Series, vol. 45. Springer, Heidelberg (November 2008)
Frangioni, A., Gendron, B.: 0-1 reformulations of the multicommodity capacitated network design problem. Discrete Applied Mathematics 157(6), 1229–1241 (2009)
Ljubić, I., Putz, P., Salazar, J.J.: Exact approaches to the single-source network loading problem. Networks (2011) (to appear)
Salman, F.S., Ravi, R., Hooker, J.N.: Solving the Capacitated Local Access Network Design Problem. INFORMS Journal on Computing 20(2), 243–254 (2008)
Gualandi, S., Malucelli, F., Sozzi, D.: On the design of the next generation access networks. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 162–175. Springer, Heidelberg (2010)
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
Ljubić, I., Putz, P., Salazar-González, JJ. (2011). A Heuristic Algorithm for a Prize-Collecting Local Access 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_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_17
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)