We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Architecture & Planning/An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design
PeriodicalsArchitecture & Planning

An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design

arXiv2015

Checking your access to this record.

Abstract & Overview

We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks. We propose an original optimization model for the problem that includes additional variables and constraints to take into account wireless signal coverage. Since the problem can prove challenging even for modern state-of-the art optimization solvers, we propose to solve it by an original primal heuristic which combines a probabilistic fixing procedure, guided by peculiar Linear Programming relaxations, with an exact MIP heuristic, based on a very large neighborhood search. Computational experiments on a set of realistic instances show that our heuristic can find solutions associated with much lower optimality gaps than a state-of-the-art solver.

Cite this record

Fabio D'Andreagiovanni, Fabian Mett, Jonad Pulaj (2015). An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design. arXiv. https://library.shubhaarti.in/content/e7e8e5e3-ac00-4e93-b1e3-267a8b8de8c8

Copy in another style

D'Andreagiovanni, F., Mett, F., & Pulaj, J. (2015). An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design. arXiv. https://library.shubhaarti.in/content/e7e8e5e3-ac00-4e93-b1e3-267a8b8de8c8
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.