An exact solution framework for the multiple gradual cover location problem

09/11/2019
by   Eduardo Álvarez-Miranda, et al.
0

Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many other industrial and public sectors. In many applications, it is likely that customers are not dichotomously covered by facilities, but gradually covered according to, e.g., the distance to the open facilities. Moreover, customers are not served by a single facility, but by a collection of them, which jointly serve them. In this paper we study the recently introduced multiple gradual cover location problem (MGCLP). The MGCLP addresses both of the issues described above. We provide four different mixed-integer programming formulations for the MGCLP, all of them exploiting the submodularity of the objective function and developed a branch-and-cut framework based one these formulations. The framework is further enhanced by starting and primal heuristics and initialization procedures. The computational results show that our approach allows to effectively address different sets of instances. We provide optimal solution values for 13 instances from literature, where the optimal solution was not known, and additionally provide improved solution values for seven instances. Many of these instances can be solved within a minute. We also analyze the dependence of the solution-structure on instance-characteristics.

READ FULL TEXT
research
11/23/2022

Exact solution approaches for the discrete α-neighbor p-center problem

The discrete α-neighbor p-center problem (d-α-pCP) is an emerging varian...
research
10/08/2019

A note on computational approaches for the antibandwidth problem

In this note, we consider the antibandwidth problem, also known as dual ...
research
02/18/2021

Maximum weighted induced forests and trees: New formulations and a computational comparative review

Given a graph G=(V,E) with a weight w_v associated with each vertex v∈ V...
research
03/13/2018

Mathematical models and search algorithms for the capacitated p-center problem

The capacitated p-center problem requires to select p facilities from a ...
research
05/31/2021

Exact solution of network flow models with strong relaxations

We address the solution of Mixed Integer Linear Programming (MILP) model...
research
03/01/2022

Continuous Covering on Networks: Strong Mixed Integer Programming Formulations

Covering problems are well-studied in the domain of Operations Research,...
research
02/28/2021

The Maintenance Scheduling and Location Choice Problem for Railway Rolling Stock

Due to increasing railway use, the capacity at railway yards and mainten...

Please sign up or login with your details

Forgot password? Click here to reset