Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/647
Title: | A VNS-LP algorithm for the robust dynamic maximal covering location problem | Authors: | Mišković, Stefan | Affiliations: | Informatics and Computer Science | Keywords: | Dynamic maximal covering location problem;Linear programming;Robust optimization;Variable neighborhood search | Issue Date: | 1-Oct-2017 | Journal: | OR Spectrum | Abstract: | This study introduces a robust variant of the well-known dynamic maximal covering location problem (DMCLP) and proposes an integer linear programming formulation of the robust DMCLP. A hybrid approach for solving both deterministic and robust variant of the DMCLP is developed, which is based on hybridization of a Variable neighborhood search and a linear programming technique. The main idea is to split the problem into subproblems and to combine optimal solutions of the obtained subproblems in order to construct solution of the initial problem. The results of the proposed hybrid approach on instances of the deterministic DMCLP are presented and compared with the results of the state-of-the-art approach from the literature and with the results of commercial CPLEX solver. The presented computational analysis shows that the proposed hybrid algorithm outperforms other approaches for the DMCLP. In addition, the algorithm was tested on the instances of the robust variant of DMCLP, and obtained results are discussed in detail. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/647 | ISSN: | 01716468 | DOI: | 10.1007/s00291-017-0482-2 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
9
checked on Dec 20, 2024
Page view(s)
20
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.