Abstract
In this paper, we consider a problem relevant to the telecommunications industry. In atwo‐level concentrator access network, each terminal has to be connected to a first‐levelconcentrator, which in turn must be connected to a second‐level concentrator. If no extracomplicating constraints are taken into account, the problem, translated into the language ofdiscrete location theory, amounts to an extension to two levels of facilities of the simpleplant location problem (SPLP). A straightforward formulation can be used, but we proposea more complicated model involving more variables and constraints. We show that the linearprogramming relaxations of both formulations have the same optimal values. However, thesecond formulation can be tightened by using a family of polyhedral cuts that define facetsof the convex hull of integer solutions. We develop a Lagrangian relaxation method tocompute lower bounds on the optimal value of the linear programming formulations andfeasible solutions of the integer programming model. A simulated annealing algorithm isalso designed to improve upon some of the upper bounds returned by the Lagrangian relaxationalgorithm. Experiments show the effectiveness of the formulation incorporating poly‐hedralcuts and of an approach combining a Lagrangian relaxation method and a simulatedannealing algorithm.
Similar content being viewed by others
References
K. Aardal, Y. Pochet and L. A. Wolsey, Capacited facility location: Valid inequalities and facets, Mathematics of Operations Research 20(1995)562-582.
J. Barcelo, E. Fernandez and K.O. Jörnsten, Computational results from a new Lagrangian relaxation algorithm for the capacited plant location problem, European Journal of Operational Research 53(1991)38-45.
J.E. Beasley, Lagrangean heuristics for location problems, European Journal of Operational Research 33(1993)383-399.
P. Chardaire, J.-L. Lutton and A. Sutter, Thermostatistical persistency: A new improving concept for simulated annealing algorithms, European Journal of Operation Research 86(1995)565-579.
P. Chardaire and J.-L. Lutton, Using simulated annealing to solve concentrator location problems in telecommunication networks, in: Applied Simulated Annealing, ed. R.V. Valqui Vidal, a volume of the Lecture Notes Series, Springer, 1993, pp. 175-199.
G. Cornuéjols, private communication.
G. Cornuéjols, M.L. Fisher and G.L. Nemhauser, Location of banks account to optimise float: An analytic study of exact and approximate algorithms, Management Science 23(1977)789-810.
G. Cornuéjols, R. Sridharan and J.M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, European Journal of Operational Research 50(1991)280-297.
D. Erlenkotter, A dual-based procedure for uncapacited facilities location, Operations Research 26(1978)992-1009.
R.L. Francis and P.B. Mirchandani (eds.), Discrete Location Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990.
M. Gondran and M. Minoux, Graphs and Algorithms, Wiley-Interscience Series in Discrete Mathematics, 1984.
S. Kirkpatrick, C.D. Gelatt, Jr. and M.M. Vecchi, Optimisation by simulated annealing, Science 220(1983)671-680.
V.K. Konangi, T. Aidja and C.R. Dhas, On the multilevel concentrator location problem for local access networks, in: Proceedings of IEEE Globecom, 1984, pp. 912-915.
J. Krarup and P.M. Pruzan, The simple plant location problem: Survey and synthesis, European Journal of Operational Research 12(1983)36-81.
N. Metropolis et al., Equation of state calculations by fast computing machines, Journal of Chemical Physics 21(1953)1087-1092.
S. Narasimhan and H. Pirkul, Hierarchical concentrator location problem, Computer Communications 15(1992)185-191.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1988.
P. McGregor and D. Shen, Network design: An algorithm for access facility location problems, IEEE Trans. Commun. 25(1977)61-73.
G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Computer Networks 6(1982)1-11.
Rights and permissions
About this article
Cite this article
Chardaire, P., Lutton, J. & Sutter, A. Upper and lower bounds for the two‐level simple plant location problem. Annals of Operations Research 86, 117–140 (1999). https://doi.org/10.1023/A:1018942415824
Issue Date:
DOI: https://doi.org/10.1023/A:1018942415824