LSCP Solver

The LSCP model, location set covering problem (LSCP), aims to cover all demand points within a threshold distance.

The input table should contain the two types of columns: distance matrix to candidate facilities, and optionally a column for distance to closest required facilities.

The LSCP 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.

Distance column for nearest required facility

The Column indicating distance to the closest required facility.

Threshold

Desired threshold distance or cost.

Input Ports

Icon

Table including OD Matrix for candidate facilities 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.

Installation

To use this node in KNIME, install the extension Geospatial Analytics Extension for KNIME from the below update site following our NodePit Product and Node Installation Guide:

v5.2

A zipped version of the software site can be downloaded here.

Plugin provider: SDL, Harvard, Cambridge US
Plugin version: 1.3.0.202412051033
On NodePit since: 2023-12-06
Last update: 2024-12-18
KNIME versions: From v5.2 to v5.2

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.

Try NodePit Runner!