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:

• Pulp.Solver

Input ports

1. Type: Table
   Input demand data

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

Output ports

1. Type: Table
   MCLP result table

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