Por favor, use este identificador para citar o enlazar este ítem:
https://doi.org/10.1007/s00500-020-05106-0
Twittear
Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.contributor.author | Lancinskas, Algirdas | - |
| dc.contributor.author | Zilinskas, Julius | - |
| dc.contributor.author | Fernández Hernández, Pascual | - |
| dc.contributor.author | Pelegrín Pelegrín, Blas | - |
| dc.date.accessioned | 2024-01-28T07:53:07Z | - |
| dc.date.available | 2024-01-28T07:53:07Z | - |
| dc.date.issued | 2020 | - |
| dc.identifier.citation | Soft Computing 24 (2020) 17705–17713 | es |
| dc.identifier.issn | 1432-7642 | - |
| dc.identifier.issn | 1433-7479 | - |
| dc.identifier.uri | http://hdl.handle.net/10201/137839 | - |
| dc.description | ©2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ This document is the Accepted, version of a Published Work that appeared in final form in Soft Computing. To access the final edited and published work see https://doi.org/10.1007/s00500-020-05106-0 | es |
| dc.description.abstract | We address a discrete competitive facility location problem with an asymmetric objective function and a binary customer choice rule. Both an integer linear programming formulation and a heuristic optimization algorithm based on ranking of candidate locations are designed to solve the problem. The proposed population-based heuristic algorithm is specially adapted for the discrete facility location problems by using their features such as geographical distances and the maximal possible utility of candidate locations, which can be evaluated in advance. The performance of the proposed algorithm was experimentally investigated by solving different instances of the model with real data of municipalities in Spain. | es |
| dc.format | application/pdf | es |
| dc.format.extent | 10 | es |
| dc.language | eng | es |
| dc.publisher | SPRINGER | es |
| dc.relation | This research is funded by the European Social Fund under the No. 09.3.3-LMT-K-712 “Development of Competences of Scientists, other Researchers and Students through Practical Research Activities” measure. This research is funded by the Ministry of Economy and Competitiveness of Spain under the research Project MTM2015-70260-P, and by the Fundación Séneca (The Agency of Science and Technology of the Region of Murcia) under the research Project 19241/PI/14. | es |
| dc.rights | info:eu-repo/semantics/openAccess | es |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | Asymmetric facility location | es |
| dc.subject | Binary choice rule | es |
| dc.subject | Combinatorial optimization | es |
| dc.subject | Random search | es |
| dc.subject | Population-based heuristic algorithms | es |
| dc.subject.other | CDU::5 - Ciencias puras y naturales::51 - Matemáticas | es |
| dc.title | Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations | es |
| dc.type | info:eu-repo/semantics/article | es |
| dc.relation.publisherversion | https://link.springer.com/article/10.1007/s00500-020-05106-0 | es |
| dc.identifier.doi | https://doi.org/10.1007/s00500-020-05106-0 | - |
| dc.contributor.department | Departamento de Estadística e Investigación Operativa | - |
| Aparece en las colecciones: | Artículos | |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| paper_SoftComp.pdf | 278,1 kB | Adobe PDF |  Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons
