dc.creator | Körner, Mark Christof | es |
dc.creator | Mesa López-Colmenar, Juan Antonio | es |
dc.creator | Perea Rojas-Marcos, Federico | es |
dc.creator | Schöbel, Anita | es |
dc.creator | Scholz, Daniel | es |
dc.date.accessioned | 2020-07-03T10:32:34Z | |
dc.date.available | 2020-07-03T10:32:34Z | |
dc.date.issued | 2014 | |
dc.identifier.citation | Körner, M.C., Mesa López-Colmenar, J.A., Perea Rojas-Marcos, F., Schöbel, A. y Scholz, D. (2014). A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments. Top (Journal of Operations Research), 22 (1), 227-253. | |
dc.identifier.issn | 1134-5764 | es |
dc.identifier.issn | 1863-8279 | es |
dc.identifier.uri | https://hdl.handle.net/11441/98727 | |
dc.description.abstract | 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. | es |
dc.description.sponsorship | Future and Emerging Technologies Unit of EC (IST priority—6th FP) FP6-021235-2 (project ARRIVAL) | es |
dc.description.sponsorship | Ministerio de Educación, Ciencia e Innovación (Spain)/FEDER MTM2009-14243 | es |
dc.description.sponsorship | Junta de Andalucía (Spain)/FEDER P09-TEP-5022 | es |
dc.description.sponsorship | Junta de Andalucía (Spain)/FEDER FQM-5849 | es |
dc.format | application/pdf | es |
dc.format.extent | 27 p. | es |
dc.language.iso | eng | es |
dc.publisher | Sociedad Española de Estadística e Investigación Operativa | es |
dc.relation.ispartof | Top (Journal of Operations Research), 22 (1), 227-253. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Location | es |
dc.subject | Covering problem | es |
dc.subject | Transportation | es |
dc.title | A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada II | es |
dc.relation.projectID | FP6-021235-2 (project ARRIVAL) | es |
dc.relation.projectID | MTM2009-14243 | es |
dc.relation.projectID | P09-TEP-5022 | es |
dc.relation.projectID | FQM-5849 | es |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s11750-012-0251-y | es |
dc.identifier.doi | 10.1007/s11750-012-0251-y | es |
dc.contributor.group | Universidad de Sevilla. FQM241: Grupo de Investigación en Localización | es |
dc.journaltitle | Top (Journal of Operations Research) | es |
dc.publication.volumen | 22 | es |
dc.publication.issue | 1 | es |
dc.publication.initialPage | 227 | es |
dc.publication.endPage | 253 | es |