The Maximal Accessibility Equality Problem (MAEP), originally introduced by Jin et al., addresses capacity adjustments for minimizing inequality in accessibility. It takes into account the match ratio between supply and demand, along with intricate spatial interactions.
The optimization objective of MAEP aims to minimize inequality in facility accessibility, with a focus on reducing variance across geographic areas. This problem can be formulated as either a Nonlinear Programming (NLP) or a Quadratic Programming (QP) task.
The top input table contains three types of columns: demand size (e.g., population), distance columns to the existing facilities (n) and new facilities (k). The bottom input table contains two columns: the ID and the capacity columns for existing facilities.
The result table comprises three columns: Facility IDs and their assigned capacities under two scenarios, denoted by the 'All' and 'Fixed' columns: Global Optimization: New capacity is allocated to both existing and new facilities by adding the specified new capacity to the total capacity of existing facilities. Local Optimization: New capacity is exclusively assigned to new facilities based on the specified new capacity, with no impact on the capacities of existing facilities.
To solve the MAEP problem, this node utilizes the cvxopt package.
The column for demand size (e.g., population).
Distance columns representing the distances to the existing facilities.
The columns representing the distance matrix between demand lcoation to candidate facilities.
The column for facility IDs.
The column representing the capacities of existing supply facilities.
The model representing distance decay effect.
It works for the parameters for the chosen corresponding models.
Total capacity assigned to all new facilities.
Each row in this table represents a demand location (m). It consists of three types of columns: demand size (e.g., population), distance columns to the existing facilities (n) and new facilities (k).
This table provides information regarding the supply capacity of each existing facility. The values in the Facility ID column must exactly match the column names for facilities in the demand table.
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.
A zipped version of the software site can be downloaded here.
Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.Try NodePit Runner!
Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to firstname.lastname@example.org, follow @NodePit on Twitter or botsin.space/@nodepit on Mastodon.
Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.