Undesirable facility location with minimal covering objectives

An undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into account: a radius of influence to be maximised, indicating within which distanc...

Descripción completa

Detalles Bibliográficos
Autores: Plastria, Frank, Carrizosa Priego, Emilio José
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:1999
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/107824
Acceso en línea:https://hdl.handle.net/11441/107824
https://doi.org/10.1016/S0377-2217(98)00335-X
Access Level:acceso abierto
Palabra clave:Undesirable facility location
Bicriterion covering problem
Euclidean distance
Minimal covering
Largest circle
Voronoi diagram
id ES_9b92b8aee6a0d4066879bb58f0d5d232
oai_identifier_str oai:idus.us.es:11441/107824
network_acronym_str ES
network_name_str España
repository_id_str
spelling Undesirable facility location with minimal covering objectivesPlastria, FrankCarrizosa Priego, Emilio JoséUndesirable facility locationBicriterion covering problemEuclidean distanceMinimal coveringLargest circleVoronoi diagramAn undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into account: a radius of influence to be maximised, indicating within which distance from the facility population disturbance is taken into consideration, and the total covered population, i.e. lying within the influence radius from the facility, which should be minimised. Low complexity polynomial algorithms are derived to determine all nondominated solutions, of which there are only O(n3) for a fixed feasible region or O(n2) when locating on a planar network. Once obtained, this information allows almost instant answers and a trade-off sensitivity analysis to questions such as minimising the population within a given radius (minimal covering problem) or finding the largest circle not covering more than a given total population.ELSEVIER SCIENCE BVEstadística e Investigación OperativaFQM329: Optimización1999info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/107824https://doi.org/10.1016/S0377-2217(98)00335-Xreponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésEuropean Journal of Operational Research, 119 (1), 158-180.http://doi.org/10.1016/S0377-2217(98)00335-Xinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/1078242026-06-17T12:51:07Z
dc.title.none.fl_str_mv Undesirable facility location with minimal covering objectives
title Undesirable facility location with minimal covering objectives
spellingShingle Undesirable facility location with minimal covering objectives
Plastria, Frank
Undesirable facility location
Bicriterion covering problem
Euclidean distance
Minimal covering
Largest circle
Voronoi diagram
title_short Undesirable facility location with minimal covering objectives
title_full Undesirable facility location with minimal covering objectives
title_fullStr Undesirable facility location with minimal covering objectives
title_full_unstemmed Undesirable facility location with minimal covering objectives
title_sort Undesirable facility location with minimal covering objectives
dc.creator.none.fl_str_mv Plastria, Frank
Carrizosa Priego, Emilio José
author Plastria, Frank
author_facet Plastria, Frank
Carrizosa Priego, Emilio José
author_role author
author2 Carrizosa Priego, Emilio José
author2_role author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM329: Optimización
dc.subject.none.fl_str_mv Undesirable facility location
Bicriterion covering problem
Euclidean distance
Minimal covering
Largest circle
Voronoi diagram
topic Undesirable facility location
Bicriterion covering problem
Euclidean distance
Minimal covering
Largest circle
Voronoi diagram
description An undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into account: a radius of influence to be maximised, indicating within which distance from the facility population disturbance is taken into consideration, and the total covered population, i.e. lying within the influence radius from the facility, which should be minimised. Low complexity polynomial algorithms are derived to determine all nondominated solutions, of which there are only O(n3) for a fixed feasible region or O(n2) when locating on a planar network. Once obtained, this information allows almost instant answers and a trade-off sensitivity analysis to questions such as minimising the population within a given radius (minimal covering problem) or finding the largest circle not covering more than a given total population.
publishDate 1999
dc.date.none.fl_str_mv 1999
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/107824
https://doi.org/10.1016/S0377-2217(98)00335-X
url https://hdl.handle.net/11441/107824
https://doi.org/10.1016/S0377-2217(98)00335-X
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv European Journal of Operational Research, 119 (1), 158-180.
http://doi.org/10.1016/S0377-2217(98)00335-X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv ELSEVIER SCIENCE BV
publisher.none.fl_str_mv ELSEVIER SCIENCE BV
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869414549042495488
score 15.300719

Similares en LA Referencia