Paper Info
Title
An (MI)LP-Based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design.
Abstract
We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks integrating wired and wireless technologies. We propose an original optimization model for the problem that includes additional variables and constraints to take into account wireless signal coverage represented through signal-to-interference ratios. Since the problem can prove very challenging even for modern state-of-the art optimization solvers, we propose to solve it by an original primal heuristic that 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.
Year
DOI
Venue
2016
10.1007/978-3-319-31204-0_19
Lecture Notes in Computer Science
Keywords
Field
DocType
Telecommunications,FTTX access networks,Connected facility location,Mixed integer linear programming,Tight linear relaxations,MIP heuristics
Mathematical optimization,Architecture,Heuristic,Wireless,Computer science,Facility location problem,Linear programming,Solver,Probabilistic logic,Access network
Conference
Volume
ISSN
Citations 
9597
0302-9743
3
PageRank 
References 
Authors
0.38
14
3
Name
Order
Citations
PageRank
Fabio D'Andreagiovanni121117.03
Fabian Mett280.85
Jonad Pulaj3382.85