Single-facility huff location problems on networks

Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination. Since the probl...

Descripción completa

Detalles Bibliográficos
Autores: Blanquero Bravo, Rafael, Carrizosa Priego, Emilio José, Nogales Gómez, Amaya, Plastria, Frank
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/107835
Acceso en línea:https://hdl.handle.net/11441/107835
https://doi.org/10.1007/s10479-013-1445-x
Access Level:acceso abierto
Palabra clave:Huff location models
Location on networks
DC optimization
Interval analysis
id ES_de88ea1b64a2cc0ccd93bfbfab3a7133
oai_identifier_str oai:idus.us.es:11441/107835
network_acronym_str ES
network_name_str España
repository_id_str
spelling Single-facility huff location problems on networksBlanquero Bravo, RafaelCarrizosa Priego, Emilio JoséNogales Gómez, AmayaPlastria, FrankHuff location modelsLocation on networksDC optimizationInterval analysisHuff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination. Since the problems are multimodal, a branch and bound algorithm is proposed, in which two different bounding strategies, based on Interval Analysis and DC optimization, are used and compared. Computational results are given for the two bounding procedures, showing that problems of rather realistic size can be solved in reasonable time.SpringerEstadística e Investigación OperativaFQM329: Optimización2013info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/107835https://doi.org/10.1007/s10479-013-1445-xreponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésAnnals of Operations Research, 222 (1), 175-195.http://doi.org/10.1007/s10479-013-1445-xinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/1078352026-06-17T12:51:07Z
dc.title.none.fl_str_mv Single-facility huff location problems on networks
title Single-facility huff location problems on networks
spellingShingle Single-facility huff location problems on networks
Blanquero Bravo, Rafael
Huff location models
Location on networks
DC optimization
Interval analysis
title_short Single-facility huff location problems on networks
title_full Single-facility huff location problems on networks
title_fullStr Single-facility huff location problems on networks
title_full_unstemmed Single-facility huff location problems on networks
title_sort Single-facility huff location problems on networks
dc.creator.none.fl_str_mv Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Nogales Gómez, Amaya
Plastria, Frank
author Blanquero Bravo, Rafael
author_facet Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Nogales Gómez, Amaya
Plastria, Frank
author_role author
author2 Carrizosa Priego, Emilio José
Nogales Gómez, Amaya
Plastria, Frank
author2_role author
author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM329: Optimización
dc.subject.none.fl_str_mv Huff location models
Location on networks
DC optimization
Interval analysis
topic Huff location models
Location on networks
DC optimization
Interval analysis
description Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination. Since the problems are multimodal, a branch and bound algorithm is proposed, in which two different bounding strategies, based on Interval Analysis and DC optimization, are used and compared. Computational results are given for the two bounding procedures, showing that problems of rather realistic size can be solved in reasonable time.
publishDate 2013
dc.date.none.fl_str_mv 2013
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/107835
https://doi.org/10.1007/s10479-013-1445-x
url https://hdl.handle.net/11441/107835
https://doi.org/10.1007/s10479-013-1445-x
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Annals of Operations Research, 222 (1), 175-195.
http://doi.org/10.1007/s10479-013-1445-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 Springer
publisher.none.fl_str_mv Springer
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_ 1869421982873812992
score 15,300724

Similares en LA Referencia