A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments

In this paper the following facility location problem in a mixed planarnetwork space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (Ai,Aj ) is called covered if the time to access the netw...

Descripción completa

Detalles Bibliográficos
Autores: Körner, Mark Christof, Mesa López-Colmenar, Juan Antonio, Perea Rojas-Marcos, Federico, Schöbel, Anita, Scholz, Daniel
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2014
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/98727
Acceso en línea:https://hdl.handle.net/11441/98727
https://doi.org/10.1007/s11750-012-0251-y
Access Level:acceso abierto
Palabra clave:Location
Covering problem
Transportation
id ES_c8c0ae528e2fb5447fb0365083cb1855
oai_identifier_str oai:idus.us.es:11441/98727
network_acronym_str ES
network_name_str España
repository_id_str
spelling A maximum trip covering location problem with an alternative mode of transportation on tree networks and segmentsKörner, Mark ChristofMesa López-Colmenar, Juan AntonioPerea Rojas-Marcos, FedericoSchöbel, AnitaScholz, DanielLocationCovering problemTransportationIn this paper the following facility location problem in a mixed planarnetwork space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (Ai,Aj ) is called covered if the time to access the network from Ai plus the time for traveling along the network plus the time for reaching Aj is lower than, or equal to, a given acceptance level related to the travel time without using the network. The objective is to find facilities (i.e. entry and exit points) on the network that maximize the number of covered pairs. We present a reformulation of the problem using convex covering sets and use this formulation to derive a finite dominating set and an algorithm for locating two facilities on a tree network. Moreover, we adapt a geometric branch and bound approach to the discrete nature of the problem and suggest a procedure for locating more than two facilities on a single line, which is evaluated numerically.Future and Emerging Technologies Unit of EC (IST priority—6th FP) FP6-021235-2 (project ARRIVAL)Ministerio de Educación, Ciencia e Innovación (Spain)/FEDER MTM2009-14243Junta de Andalucía (Spain)/FEDER P09-TEP-5022Junta de Andalucía (Spain)/FEDER FQM-5849Sociedad Española de Estadística e Investigación OperativaMatemática Aplicada IIFQM241: Grupo de Investigación en Localización2014info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/98727https://doi.org/10.1007/s11750-012-0251-yreponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésTop (Journal of Operations Research), 22 (1), 227-253.FP6-021235-2 (project ARRIVAL)MTM2009-14243P09-TEP-5022FQM-5849https://link.springer.com/article/10.1007/s11750-012-0251-yinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/987272026-06-17T12:51:07Z
dc.title.none.fl_str_mv A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
title A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
spellingShingle A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
Körner, Mark Christof
Location
Covering problem
Transportation
title_short A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
title_full A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
title_fullStr A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
title_full_unstemmed A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
title_sort A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
dc.creator.none.fl_str_mv Körner, Mark Christof
Mesa López-Colmenar, Juan Antonio
Perea Rojas-Marcos, Federico
Schöbel, Anita
Scholz, Daniel
author Körner, Mark Christof
author_facet Körner, Mark Christof
Mesa López-Colmenar, Juan Antonio
Perea Rojas-Marcos, Federico
Schöbel, Anita
Scholz, Daniel
author_role author
author2 Mesa López-Colmenar, Juan Antonio
Perea Rojas-Marcos, Federico
Schöbel, Anita
Scholz, Daniel
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Matemática Aplicada II
FQM241: Grupo de Investigación en Localización
dc.subject.none.fl_str_mv Location
Covering problem
Transportation
topic Location
Covering problem
Transportation
description In this paper the following facility location problem in a mixed planarnetwork space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (Ai,Aj ) is called covered if the time to access the network from Ai plus the time for traveling along the network plus the time for reaching Aj is lower than, or equal to, a given acceptance level related to the travel time without using the network. The objective is to find facilities (i.e. entry and exit points) on the network that maximize the number of covered pairs. We present a reformulation of the problem using convex covering sets and use this formulation to derive a finite dominating set and an algorithm for locating two facilities on a tree network. Moreover, we adapt a geometric branch and bound approach to the discrete nature of the problem and suggest a procedure for locating more than two facilities on a single line, which is evaluated numerically.
publishDate 2014
dc.date.none.fl_str_mv 2014
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/98727
https://doi.org/10.1007/s11750-012-0251-y
url https://hdl.handle.net/11441/98727
https://doi.org/10.1007/s11750-012-0251-y
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Top (Journal of Operations Research), 22 (1), 227-253.
FP6-021235-2 (project ARRIVAL)
MTM2009-14243
P09-TEP-5022
FQM-5849
https://link.springer.com/article/10.1007/s11750-012-0251-y
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 Sociedad Española de Estadística e Investigación Operativa
publisher.none.fl_str_mv Sociedad Española de Estadística e Investigación Operativa
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_ 1869419312422322176
score 15,301629

Similares en LA Referencia