Multi-period capacitated location with modular equipments

Authors:
íric Gourdin;Olivier Klopfenstein
Affiliations:
France Télécom R&D/DAC/OAT, 38-40 bd du Géénéral Leclerc, 92794 Issy-les-Moulineaux Cedex 9, France;France Télécom R&D/DAC/OAT, 38-40 bd du Géénéral Leclerc, 92794 Issy-les-Moulineaux Cedex 9, France
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes

Operations Research
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Capacitated facility location: separation algorithms and computational experience

Mathematical Programming: Series A and B - Special issue on computational integer programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary from one period to another. On each concentrator site, several capacitated concentrators can be installed at each period. Similarly, several capacitated modules can be installed at each period between each terminal and concentrator sites. We assume that equipments can never be removed. An integer linear model is proposed, and some of its dynamic properties are investigated. Then, a polyhedral analysis of the problem is performed, and some original facet-defining inequalities are introduced. The different improvements proposed are validated on numerical examples.