Towards the Integration of Power-Indexed Formulations in Multi-Architecture Connected Facility Location Problems for the Optimal Design of Hybrid Fiber-Wireless Access Networks

Authors Fabio D’Andreagiovanni, Fabian Mett, Jonad Pulaj



PDF
Thumbnail PDF

File

OASIcs.SCOR.2016.8.pdf
  • Filesize: 0.5 MB
  • 11 pages

Document Identifiers

Author Details

Fabio D’Andreagiovanni
Fabian Mett
Jonad Pulaj

Cite AsGet BibTex

Fabio D’Andreagiovanni, Fabian Mett, and Jonad Pulaj. Towards the Integration of Power-Indexed Formulations in Multi-Architecture Connected Facility Location Problems for the Optimal Design of Hybrid Fiber-Wireless Access Networks. In 5th Student Conference on Operational Research (SCOR 2016). Open Access Series in Informatics (OASIcs), Volume 50, pp. 8:1-8:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/OASIcs.SCOR.2016.8

Abstract

Urban access networks are the external part of worldwide networks that make telecommunication services accessible to end users and represent a critical part of the infrastructures of modern cities. An important recent trend in urban access networks is the integration of fiber and wireless networks, leading to so-called fiber-wireless (Fi-Wi) networks. Fi-Wi networks get the best of both technologies, namely the high capacity offered by optical fiber networks and the mobility and ubiquity offered by wireless networks. The optimal design of fiber and wireless networks has been separately extensively studied. However, there is still a lack of mathematical models and algorithms for the integrated design problem. In this work, we propose a new Power-Indexed optimization model for the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks. The new model includes additional power-indexed variables and constraints to represent the signal-to-interference formulas expressing wireless signal coverage. To solve the problem, which can prove very hard even for a state-of-the art optimization solver, we propose a new heuristic that combines a probabilistic variable fixing procedure, guided by (tight) linear relaxations, with an MIP heuristic, corresponding to an exact very large neighborhood search. Computational experiments on realistic instances show that our heuristic can find solutions of much higher quality than a state-of-the-art solver.
Keywords
  • Telecommunications Access Networks
  • Connected Facility Location
  • Mixed Integer Linear Programming
  • Power-Indexed Formulations
  • MIP Heuristics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail