Back to Search
Start Over
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations.
- Source :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications; Dec2020, Vol. 24 Issue 23, p17705-17713, 9p
- Publication Year :
- 2020
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14327643
- Volume :
- 24
- Issue :
- 23
- Database :
- Complementary Index
- Journal :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 146975882
- Full Text :
- https://doi.org/10.1007/s00500-020-05106-0