Mostrar el registro sencillo del ítem

Artículo

dc.creatorBlanquero Bravo, Rafaeles
dc.creatorCarrizosa Priego, Emilio Josées
dc.creatorGazdag-Tóth, Boglárkaes
dc.creatorNogales Gómez, Amayaes
dc.date.accessioned2016-09-13T10:15:41Z
dc.date.available2016-09-13T10:15:41Z
dc.date.issued2016-11-16
dc.identifier.citationBlanquero Bravo, R., Carrizosa Priego, E.J., Gazdag-Tóth, B. y Nogales Gómez, A. (2016). p-facility Huff location problem on networks. European Journal of Operational Research, 255 (1), 34-42.
dc.identifier.issn0377-2217es
dc.identifier.urihttp://hdl.handle.net/11441/44945
dc.description.abstractThe p-facility Huff location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the field of continuous location, in this paper we study the p-facility Huff location problem on networks formulated as a Mixed Integer Nonlinear Programming problem that can be solved by a branch-and-bound algorithm. We propose two approaches for the initialization and division of subproblems, the first one based on the straightforward idea of enumerating every possible combination of p edges of the network as possible locations, and the second one defining sophisticated data structures that exploit the structure of the combinatorial and continuous part of the problem. Bounding rules are designed using DC (difference of convex) and Interval Analysis tools. In our computational study we compare the two approaches on a battery of 21 networks and show that both of them can handle problems for p ≤ 4 in reasonable computing time.es
dc.description.sponsorshipMinisterio de Economía y Competitividades
dc.description.sponsorshipJunta de Andalucíaes
dc.description.sponsorshipHungarian National Research, Development and Innovation Officees
dc.description.sponsorshipInformation and Communication Technologies COSTes
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofEuropean Journal of Operational Research, 255 (1), 34-42.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectHuff location problemes
dc.subjectLocation on networkses
dc.subjectp-facilityes
dc.subjectDifference of convexes
dc.subjectGlobal optimizationes
dc.titlep-facility Huff location problem on networkses
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Estadística e Investigación Operativaes
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO/MTM2015-65915-Res
dc.relation.projectIDP11-FQM-7603es
dc.relation.projectIDFQM-329es
dc.relation.projectIDPD115554es
dc.relation.projectIDTD1207es
dc.relation.publisherversionhttp://ac.els-cdn.com/S0377221716302764/1-s2.0-S0377221716302764-main.pdf?_tid=59bbe7c0-799a-11e6-a497-00000aab0f26&acdnat=1473761631_b0be6236aa3353cc7238c44a8631e367es
dc.identifier.doi10.1016/j.ejor.2016.04.039es
dc.contributor.groupUniversidad de Sevilla. FQM329: Optimizaciones
idus.format.extent17 p.es
dc.journaltitleEuropean Journal of Operational Researches
dc.publication.volumen255es
dc.publication.issue1es
dc.publication.initialPage34es
dc.publication.endPage42es
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/44945

FicherosTamañoFormatoVerDescripción
p-facility Huff location problerm ...319.6KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional