SupplyDemandSolver provides a simple Supply Demand matching algorithm. It supports supplier capacity, demand priorities for different suppliers as well as constraint categories to limit matching.
Get Started
$ dotnet add package SupplyDemandSolverReadme
SupplyDemand
A simple matching algorithm for supply and demand, written in C#.
Example use
Simple matching:
var supply = new List<Supply> {
new Supply { Id = 1, Capacity = 1 },
new Supply { Id = 2, Capacity = 2 },
new Supply { Id = 3, Capacity = 1 },
};
var demands = new List<Demand> {
new Demand() { Id = 10, Allocation = null, SupplyPreference = new int[] { 2, 1, 3 } },
new Demand() { Id = 11, Allocation = null, SupplyPreference = new int[] { 2, 1, 3 } },
new Demand() { Id = 12, Allocation = null, SupplyPreference = new int[] { 2, 1, 3 } },
new Demand() { Id = 13, Allocation = null, SupplyPreference = new int[] { 2, 1, 3 } },
};
var solver = new Solver(supply, demands);
Constraint matching:
Note: constraints are booleans. There can be up to 31 constraints.
var supply = new List<Supply> {
new Supply { Id = 0, Capacity = 1 },
new Supply { Id = 1, Capacity = 2 },
new Supply { Id = 2, Capacity = 1 },
new Supply { Id = 3, Capacity = 2, Categories = 8 },
};
var demands = new List<Demand> {
new Demand() { Id = 10, Allocation = null, SupplyPreference = new int[] { 1, 0, 2 } },
new Demand() { Id = 11, Allocation = null, SupplyPreference = new int[] { 1, 3, 2 } },
new Demand() { Id = 12, Allocation = null, SupplyPreference = new int[] { 1, 0, 2 } },
new Demand() { Id = 13, Allocation = null, SupplyPreference = new int[] { 1, 0, 2 } },
new Demand() { Id = 14, Allocation = null, SupplyPreference = new int[] { 1, 0, 2 } },
new Demand() { Id = 15, Allocation = null, SupplyPreference = new int[] { 1, 0, 2 } },
};
var solver = new Solver(supply, demands);