EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
858. Multi-product maximal covering second-level facility location problem
Invited abstract in session TA-61: Covering Location Problems, stream Locational Analysis.
Tuesday, 8:30-10:00Room: S10 (building: 101)
Authors (first author is the speaker)
1. | Luisa I. Martínez-Merino
|
Departamento de Estadística e Investigación Operativa, Universidad de Cádiz | |
2. | Marta Baldomero-Naranjo
|
Estadística e Investigación Operativa, Universidad de Cádiz | |
3. | Antonio Manuel Rodriguez-Chia
|
Estadistica e IO, Universidad de Cádiz |
Abstract
In this work, we consider a hierarchical facility framework consisting in three levels. The first-level is composed by a set of facilities which manufacture certain products, the second-level facilities act as warehouses, and finally, the clients demanding some of these products compose the third-level. The products must be supplied to the clients by using the second-level facilities. It should be noted that, in order to satisfy the customers' demand, there must be a double coverage: the client must be covered by a second-level facility, and this, in turn, by a first-level facility. This kind of problem can be identified in several applications as healthcare systems, telecommunication networks or e-commerce.
The aim of the proposed model, denoted as SL-MCFLP, is to determine the location and product configuration of second-level facilities in such a way that the overall client satisfaction with respect their coverage is maximized. We propose a mixed integer linear programming formulation, and we introduce several valid inequalities to improve its performance time. In some cases, the number of valid inequalities is exponential and, consequently, separation algorithms are developed. In addition, several variants of a matheuristic approach are introduced.
Keywords
- Location
- Programming, Integer
- Combinatorial Optimization
Status: accepted
Back to the list of papers