A computational comparison of several formulations for the multi-period incremental service facility location problem
The Multi-period Incremental Service Facility Location Problem, which was recently introduced, is a strategic problem for timing the location of facilities and the assignment of customers to facilities in a multi-period environment. Aiming at finding the strongest formulation for this problem, in th...
| Autores: | , , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/83314 |
| Acceso en línea: | https://hdl.handle.net/11441/83314 |
| Access Level: | acceso abierto |
| Palabra clave: | Multi-period location-assignment Pure 0–1 formulations Impulse variables Step variables |
| Sumario: | The Multi-period Incremental Service Facility Location Problem, which was recently introduced, is a strategic problem for timing the location of facilities and the assignment of customers to facilities in a multi-period environment. Aiming at finding the strongest formulation for this problem, in this work we study three alternative formulations based on the so-called impulse variables and step variables. To this end, an extensive computational comparison is performed. As a conclusion, the hybrid impulse–step formulation provides better computational results than any of the other two formulations. |
|---|