Abstract
The problem of locating obnoxious facilities has gained attention, as do environmental issues. Particularly, in view of the impacts of facilities on their clients, Labbé et al. formulated a model, called the obnoxious p-median problem, to locate obnoxious facilities away from the clients. However, this model is a difficult 0–1 programming problem, involving a large number of 0–1 variables. Actually, many of the 0–1 variables can be relieved in some alternative formulations. This paper presents three alternative formulations for the obnoxious p-median problem. Numerical examples show that the formulation based on distance-sorting appeared to be the most efficient one.
Original language | English |
---|---|
Pages (from-to) | 366-373 |
Number of pages | 8 |
Journal | Discrete Applied Mathematics |
Volume | 289 |
DOIs | |
State | Published - 31 01 2021 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2020 Elsevier B.V.
Keywords
- Combinatorial optimization
- Facility location problem
- Obnoxious facility