MCLP Solver

The MCLP model, maximum covering location problem (MCLP), aims to Locate p facilities, and demand is covered if it is within a specified distance (time) of a facility.

The input table should contain the three types of columns: demand size (e.g., population), distance matrix to candidate facilities, and optionally a column for distance to closest required facilities.

The MCLP problem will be solved by PuLP package.

The node is based on the package PuLP and here are related tools and references:

Options

Distance columns for candidate facilities

The columns representing the distance matrix between demand lcoation to candidate facilities.

Demand size column

The column for demand size (e.g., population).

Distance column for nearest required facility

The Column indicating distance to the closest required facility.

Optimum p number

The optimum number of facilities.

Threshold

Desired threshold distance or cost.

Input Ports

Icon

Table including a demand column and an optional distance column to the closest required facilities.

Output Ports

Icon

Candidate column names and chosen status (1/0).

Popular Predecessors

  • No recommendations found

Popular Successors

  • No recommendations found

Views

This node has no views

Workflows

  • No workflows found

Links

Developers

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.