Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations
| Autor: | Pascual Fernández, Julius Žilinskas, Blas Pelegrín, Algirdas Lančinskas |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization education.field_of_study Computer science Heuristic (computer science) Population Computational intelligence 02 engineering and technology Facility location problem Theoretical Computer Science 020901 industrial engineering & automation Ranking 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Geometry and Topology education Software |
| Zdroj: | Soft Computing. 24:17705-17713 |
| ISSN: | 1433-7479 1432-7643 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink