Multi-period capacitated location with modular equipments

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.

[1]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[2]  Martine Labbé,et al.  Locations on time‐varying networks , 1999 .

[3]  Donald Erlenkotter,et al.  A comparative study of approaches to dynamic location problems , 1981 .

[4]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[5]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[6]  Jiawei Zhang,et al.  Approximation algorithms for facility location problems , 2004 .

[7]  Karen Aardal,et al.  Reformulation of capacitated facility location problems:How redundant information can help , 1998, Ann. Oper. Res..

[8]  António Pais Antunes,et al.  On solving complex multi-period location models using simulated annealing , 2001, Eur. J. Oper. Res..

[9]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[10]  Zvi Drezner,et al.  Telecommunication and location , 2002 .

[11]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[12]  Alexander Shulman,et al.  An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes , 1991, Oper. Res..

[13]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[14]  P. Chardaire,et al.  Solving the dynamic facility location problem , 1996 .

[15]  Thomas L. Magnanti,et al.  Valid inequalities and facets of the capacitated plant location problem , 1989, Math. Program..

[16]  Manfred W. Padberg,et al.  Classical Cuts for Mixed-Integer Programming and Branch-and-Cut , 2005, Ann. Oper. Res..

[17]  R. Sridharan The capacitated plant location problem , 1995 .

[18]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[19]  Pierre Chardaire,et al.  Solving the dynamic facility location problem , 1996, Networks.