Multi-Criteria Optimization of FTTx Networks
Multi-Criteria Optimization of FTTx Networks
DACH: Österreich - Deutschland - Schweiz
Disciplines
Computer Sciences (40%); Mathematics (60%)
Keywords
-
Combinatorial Optimization,
Network Design,
Multi-Criteria Optimization,
Facility Location,
Telecommunications
Modern fixed telecommunication networks are based on fiber-optic technology. In the context of access networks, planners speak of FTTx (fiber-to-the-x) networks, where "x" indicates the device/location/customer to which the fibers are laid out. The planning of an FTTx network is a highly complex task for which mathematical optimization offers powerful modeling and solution tools. There has been no lack of research in this area in the past; the existing models, however, lack a satisfactory treatment of several important issues arising in practice. Many of these, we believe, can be appropriately addressed by employing multi-objective optimization. This conviction is the guideline of our project. Our first goal is to develop, based on existing models for FTTx network planning, suitable multi- objective optimization models for the network design problems arising in this context. Finding "efficient`` solutions of multi-objective optimization problems is, though, much more difficult than the treatment of the single-objective case. Hence, the second goal is to design appropriate methods for the proposed models that allow to solve realistic scenarios to "multi-objective optimality``. Phrased in more technical terms: We will devise exact methods and at the same time develop heuristics that approximate the Pareto set and provide, if possible, quality guarantees.
The main topics of this project were bi-objective combinatorial optimization problems arising in the design of last-mile telecommunication networks (FTTx networks) that are based on fiber- optic technology. The newest technological and sociological developments require a significant upgrade of existing telecommunication networks. Thereby, telecommunication providers are interested in improving the quality of broadband connections in the local access areas between the central office (connection to the backbone) and end-subscribers (ranging from large businesses to single households) while keeping their costs as small as possible. Since planning such networks is a highly complex task, powerful modeling and solution tools from mathematical optimization need to be used. Despite a large amount of existing research in this area existing models and algorithms fail to satisfactorily treat several important issues arising in practice. This particularly concerns trade-offs between overall costs for an operator and quality-of-service (e.g., available bandwidth) for the customers. These issues can be appropriately addressed by employing bi- or multi-objective optimization. This conviction was the starting point and the guideline of this project. We first proposed generalizations of the most relevant single-objective problem variants known from the literature to the bi-objective case. New models and algorithmic solution methods for these problems have been developed. These algorithms enable the computation of a set of solutions that account for the trade-off between costs and quality-of-service and which can be presented to a decision maker as alternatives under which he or she may choose a most preferred solution. Besides proposing new, exact, methods for solving bi-objective combinatorial optimization problems, we developed heuristics that allow to compute a set of high-quality solutions much faster. Finally, we also performed computational studies in which the practical performance of several alternatives for solving problems from the considered classes have been evaluated and compared in detail. During the course of these developments several research gaps regarding the study of theoretical properties of the considered problems as well as concerning further quality-of-service measures (e.g., packet delay) have been identified and addressed in subsequent research within the project. Results of the research have been successfully presented at various high-level scientific conferences in the area of network optimization and several articles have been published in top- level journals. Furthermore, fruitful cooperations with researchers from Belgium, Canada, Germany, Italy, Portugal, and Spain have been established and / or deepened.
- Universität Wien - 100%
- Günther R. Raidl, Technische Universität Wien , associated research partner
- Ivana Ljubic, Universität Wien , former principal investigator
Research Output
- 226 Citations
- 13 Publications
-
2016
Title ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design DOI 10.1016/j.cor.2016.02.006 Type Journal Article Author Leitner M Journal Computers & Operations Research Pages 128-146 -
2016
Title Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems DOI 10.1007/s10589-016-9836-y Type Journal Article Author Leitner M Journal Computational Optimization and Applications Pages 73-92 Link Publication -
2017
Title An algorithmic framework for the exact solution of tree-star problems DOI 10.1016/j.ejor.2017.02.011 Type Journal Article Author Leitner M Journal European Journal of Operational Research Pages 54-66 Link Publication -
2017
Title Design of survivable networks with vulnerability constraints DOI 10.1016/j.ejor.2016.09.003 Type Journal Article Author Gouveia L Journal European Journal of Operational Research Pages 89-103 Link Publication -
2016
Title Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem DOI 10.1016/j.cor.2015.06.012 Type Journal Article Author Leitner M Journal Computers & Operations Research Pages 1-18 -
2016
Title Thinning out Steiner trees: a node-based model for uniform edge costs DOI 10.1007/s12532-016-0111-0 Type Journal Article Author Fischetti M Journal Mathematical Programming Computation Pages 203-229 Link Publication -
2015
Title A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem DOI 10.1287/ijoc.2014.0614 Type Journal Article Author Leitner M Journal INFORMS Journal on Computing Pages 118-134 -
2014
Title On the Asymmetric Connected Facility Location Polytope DOI 10.1007/978-3-319-09174-7_32 Type Book Chapter Author Leitner M Publisher Springer Nature Pages 371-383 -
2014
Title The two-level diameter constrained spanning tree problem DOI 10.1007/s10107-013-0743-z Type Journal Article Author Gouveia L Journal Mathematical Programming Pages 49-78 -
2013
Title Solving the bi-objective prize-collecting Steiner tree problem with the ?-constraint method DOI 10.1016/j.endm.2013.05.091 Type Journal Article Author Leitner M Journal Electronic Notes in Discrete Mathematics Pages 181-188 -
2014
Title A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs DOI 10.1007/978-3-319-07644-7_5 Type Book Chapter Author Leitner M Publisher Springer Nature Pages 56-70 -
2014
Title Hop constrained Steiner trees with multiple root nodes DOI 10.1016/j.ejor.2013.11.029 Type Journal Article Author Gouveia L Journal European Journal of Operational Research Pages 100-112 -
2013
Title On the Two-Architecture Connected Facility Location Problem DOI 10.1016/j.endm.2013.05.113 Type Journal Article Author Leitner M Journal Electronic Notes in Discrete Mathematics Pages 359-366