An exact approach for the reliable fixed-charge location problem with capacity constraints
Introducing capacities in the reliable fixed charge location problem is a complex task since successive failures might yield in high facility overloads. Ideally, the goal consists in minimizing the total cost while keeping the expected facility overloads under a given threshold. Several heuristic ap...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/389686 |
| Acesso em linha: | https://hdl.handle.net/2117/389686 https://dx.doi.org/10.1016/j.ejor.2023.04.017 |
| Access Level: | acceso abierto |
| Palavra-chave: | Reliability (Engineering) -- Statistical methods Location Discrete location problems Reliability models Expected overload Capacitated facilities Fiabilitat (Enginyeria) -- Models matemàtics Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa |
| Resumo: | Introducing capacities in the reliable fixed charge location problem is a complex task since successive failures might yield in high facility overloads. Ideally, the goal consists in minimizing the total cost while keeping the expected facility overloads under a given threshold. Several heuristic approaches have been proposed in the literature for dealing with this goal. In this paper, we present the first exact approach for this problem, which is based on a cutting planes algorithm. Computational results illustrate its good performance |
|---|