In many telecommunication network architectures a given set of client nodes must be served by different kinds of facility, which provide di fferent services and have diff erent capabilities. Such facilities must be located and dimensioned in the design phase. We tackle a particular location problem in which two sets of facilities, mid level and high level, have to be located. Different devices can be installed in each mid level facility, providing diff erent capacities at di fferent costs. The assignment of clients to facilities and of facilities to higher level entities must be optimized, as well. We propose a heuristic approach, based on very large scale neighborhood search, to tackle the problem, in which both ad-hoc algorithms and general purpose solvers are applied to explore the search space. We report on experimental results using datasets of instances from the literature. These experiments show that the approach is promising and that Integer Linear Programming based neighborhoods are significantly effective.
Neighborhood based heuristics for a two-level hierarchical location problem with modular node capacities / B. Addis, G. Carello, A. Ceselli. - [s.l] : Mathematical Optimization Society, 2011.
Neighborhood based heuristics for a two-level hierarchical location problem with modular node capacities
A. CeselliUltimo
2011
Abstract
In many telecommunication network architectures a given set of client nodes must be served by different kinds of facility, which provide di fferent services and have diff erent capabilities. Such facilities must be located and dimensioned in the design phase. We tackle a particular location problem in which two sets of facilities, mid level and high level, have to be located. Different devices can be installed in each mid level facility, providing diff erent capacities at di fferent costs. The assignment of clients to facilities and of facilities to higher level entities must be optimized, as well. We propose a heuristic approach, based on very large scale neighborhood search, to tackle the problem, in which both ad-hoc algorithms and general purpose solvers are applied to explore the search space. We report on experimental results using datasets of instances from the literature. These experiments show that the approach is promising and that Integer Linear Programming based neighborhoods are significantly effective.File | Dimensione | Formato | |
---|---|---|---|
3031.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
295.7 kB
Formato
Adobe PDF
|
295.7 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.