Locating a semi-obnoxious covering facility with repelling polygonal regions
A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is formulated as a margin maximization model. Necessary optimality conditions are s...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| 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/107732 |
| Acceso en línea: | https://hdl.handle.net/11441/107732 https://doi.org/10.1016/j.dam.2013.05.010 |
| Access Level: | acceso abierto |
| Palabra clave: | Continuous location Push–pull Semi-obnoxious facility Covering Euclidean distance Margin maximization |
| Sumario: | A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is formulated as a margin maximization model. Necessary optimality conditions are studied and a finite dominating set of solutions is obtained, leading to a polynomial algorithm. The method is illustrated on some examples. |
|---|