Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897749 | European Journal of Operational Research | 2013 | 12 Pages |
Abstract
In this paper we tackle a generalization of the Single Source Capacitated Facility Location Problem in which two sets of facilities, called intermediate level and upper level facilities, have to be located; the dimensioning of the intermediate set, the assignment of clients to intermediate level facilities, and of intermediate level facilities to upper level facilities, must be optimized, as well. Such problem arises, for instance, in telecommunication network design: in fact, in hierarchical networks the traffic arising at client nodes often have to be routed through different kinds of facility nodes, which provide different services. 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 from the capacitated location literature. Such results show that the approach is promising and that Integer Linear Programming based neighborhoods are significantly effective.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Bernardetta Addis, Giuliana Carello, Alberto Ceselli,