EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
4162. A robust maximal covering location model considering partial coverage
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. | Esra Karasakal
|
| Industrial Engineering Department, Middle East Technical University | |
| 2. | Burak Köksal
|
| Industrial Engineering Department, Middle East Technical University | |
| 3. | Orhan Karasakal
|
| Industrial Engineering Department, Cankaya University |
Abstract
Maximal Coverage Location Problem (MCLP) attempts to find a predetermined number of facilities to maximize the number of demand points that can be covered. In MCLP, while all demand points within a critical distance of a facility are completely covered, demand points outside this region are not covered at all. In Partial MCLP (MCLP-P), another critical distance is introduced, which allows coverage between two critical distances, monotonically decreasing with respect to demand points’ distance from facilities. In this study, we explore MCLP-P under coverage uncertainty. We utilize a robust optimization framework and introduce an approach to hedge against uncertainty. We present the model and the solution approaches and compare the performance of the proposed solution approaches on randomly generated datasets.
Keywords
- Location
- Combinatorial Optimization
- Mathematical Programming
Status: accepted
Back to the list of papers