2023/09/01 by Steven J. Lamontagne, Margarida Carvalho, Lamontagne, Steven +3 · 1 citation
Business, Management and Accounting · Engineering · #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC) #Urban and Freight Transport Logistics #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.2309.00702
openalex publication_date 2023/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The maximum covering location problem (MCLP) is a key problem in facility location, with many applications and variants. One such variant is the dynamic (or multi-period) MCLP, which considers the installation of facilities across multiple time periods. To the best of our knowledge, no exact solution method has been proposed to tackle large-scale instances of this problem. To that end, in this work, we expand upon the current state-of-the-art branch-and-Benders-cut solution method in the static case, by exploring several acceleration techniques. Additionally, we propose a specialised local branching scheme, that uses a novel distance metric in its definition of subproblems and features a new method for efficient and exact solving of the subproblems. These methods are then compared through extensive computational experiments, highlighting the strengths of the proposed methodologies.