A VNS-LP algorithm for the robust dynamic maximal covering location problem

A VNS-LP algorithm for the robust dynamic maximal covering location problem

0.00 Avg rating0 Votes
Article ID: iaor20174559
Volume: 39
Issue: 4
Start Page Number: 1011
End Page Number: 1033
Publication Date: Oct 2017
Journal: OR Spectrum
Authors:
Keywords: combinatorial optimization, heuristics, graphs, location, programming: integer, programming: dynamic, programming: linear
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.

Reviews

Required fields are marked *. Your email address will not be published.