Por favor, use este identificador para citar o enlazar este ítem: https://doi.org/10.1007/s00500-020-05106-0

Título: Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations
Fecha de publicación: 2020
Editorial: SPRINGER
Cita bibliográfica: Soft Computing 24 (2020) 17705–17713
ISSN: 1432-7642
1433-7479
Materias relacionadas: CDU::5 - Ciencias puras y naturales::51 - Matemáticas
Palabras clave: Asymmetric facility location
Binary choice rule
Combinatorial optimization
Random search
Population-based heuristic algorithms
Resumen: 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.
Autor/es principal/es: Lancinskas, Algirdas
Zilinskas, Julius
Fernández Hernández, Pascual
Pelegrín Pelegrín, Blas
Facultad/Departamentos/Servicios: Facultades, Departamentos, Servicios y Escuelas::Departamentos de la UMU::Estadística e Investigación Operativa
Versión del editor: https://link.springer.com/article/10.1007/s00500-020-05106-0
URI: http://hdl.handle.net/10201/137839
DOI: https://doi.org/10.1007/s00500-020-05106-0
Tipo de documento: info:eu-repo/semantics/article
Número páginas / Extensión: 10
Derechos: info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Descripción: ©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
Aparece en las colecciones:Artículos: Estadística e Investigación Operativa

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
paper_SoftComp.pdf278,1 kBAdobe PDFVista previa
Visualizar/Abrir


Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons