Publication:
A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule

dc.contributor.authorFernández Hernández, Pascual
dc.contributor.authorLancinskas, Algirdas
dc.contributor.authorPelegrín Pelegrín, Blas
dc.contributor.authorZilinskas, Julius
dc.contributor.departmentEstadística e Investigación Operativa
dc.date.accessioned2024-01-25T09:09:34Z
dc.date.available2024-01-25T09:09:34Z
dc.date.issued2020
dc.description©2020. This manuscript version is made available under the CC-BY 4.0 license http://creativecommons.org/licenses/by /4.0/ This document is the Published, version of a Published Work that appeared in final form in Informatica: An International Journal. To access the final edited and published work see https://doi.org/10.15388/20-INFOR410es
dc.description.abstractWe consider a geographical region with spatially separated customers, whose demand is currently served by some pre-existing facilities owned by different firms. An entering firm wants to compete for this market locating some new facilities. Trying to guarantee a future satisfactory captured demand for each new facility, the firm imposes a constraint over its possible locations (a finite set of candidates): a new facility will be opened only if a minimal market share is captured in the short-term. To check that, it is necessary to know the exact captured demand by each new facility. It is supposed that customers follow the partially binary choice rule to satisfy its demand. If there are several new facilities with maximal attraction for a customer, we consider that the proportion of demand captured by the entering firm will be equally distributed among such facilities (equity-based rule). This ties breaking rule involves that we will deal with a nonlinear constrained discrete competitive facility location problem. Moreover, minimal attraction conditions for customers and distances approximated by intervals have been incorporated to deal with a more realistic model. To solve this nonlinear model, we first linearize the model, which allows to solve small size problems because of its complexity, and then, for bigger size problems, a heuristic algorithm is proposed, which could also be used to solve other constrained problems.es
dc.formatapplication/pdfes
dc.format.extent20es
dc.identifier.citationInformatica: An International Journal (2020) 205–224
dc.identifier.doihttps://doi.org/10.15388/20-INFOR410
dc.identifier.issn1822-8844
dc.identifier.issn0868-4952
dc.identifier.urihttp://hdl.handle.net/10201/137731
dc.languageenges
dc.publisherIOS PRESSes
dc.relationThis research has been supported by the Fundación Séneca (The Agency of Science and Technology of the Region of Murcia) under the research project 20817/PI/18, and by a Grant (No. S-MIP-17-67) from the Research Council of Lithuania.es
dc.relation.publisherversionhttps://content.iospress.com/articles/informatica/infor410es
dc.rightsinfo:eu-repo/semantics/openAccesses
dc.rightsAtribución 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectLocationes
dc.subjectCompetitive modeles
dc.subjectHeuristic algorithmses
dc.titleA Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rulees
dc.typeinfo:eu-repo/semantics/articlees
dspace.entity.typePublicationes
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
INFORMATICA 2020.pdf
Size:
165.98 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.26 KB
Format:
Item-specific license agreed upon to submission
Description:
Collections