Sentence examples for maximal covering formulation from inspiring English sources

In 2010 [9] used GIS methods with a maximal covering formulation to determine optimal police patrol areas.

Using an enhanced formulation of the maximal covering location problem along with a new criticality index analysis metric (derived from the severity, frequency and dwell time of the critical medical assets) the optimal placement of the limited number of RFID readers is determined.

In this section, a formulation for a cooperative maximal covering location allocation problem is developed.

To this aim, we propose a novel multiperiod maximal covering location approach designed to maximize the overall coverage on the whole discretized time horizon.

In this paper, we proposed new formulations for single and multiple allocation hub maximal covering problems.

In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed.

The maximal covering location problem (MCLP) aims to select the location of a fixed number of facilities to maximize covered nodes.

We focus on merging gradual covering with cooperative covering in the maximal covering location problem with discrete location space.

In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP).

Hub covering problems, as location-allocation problems, consist of two sub problems namely hub set covering problem (HSCP) and hub maximal covering problem (HMCP).

Maximal covering location, set covering, and p-center problems with cooperative covering in discrete and network space were considered by Berman et al. (2011).