Solve the P-Median Problem with a Math Heuristic.
Using a Wrapper to call CoinMP.
The problem of locating P "facilities" relative to a set of "customers" such that the sum of the shortest demand weighted distance between "customers" and "facilities" is minimized.
Solving this problem, is non-trivial. To see this, consider that the number of possible solutions to any given instance of a P-Median problem is:
where N is the number of "customers" and P is the number of facilities to be located.
As an example, for N = 20, and P = 5, the resulting number of possibilities is 15,504.
For N = 50, and P = 10, a problem that is not large by most standards, the resulting number of possibilities is 10E10!
This method use a Matheuristics approach.
Generate multiple feasible solutions.
from the generated solutions it will resolve a Set Cover Problem.
- Parallel
- Library it is implemented as a WebService and WCF Service too.
- Desktop with Splash Screen
- Batch Processing
- PMedLib: Main Library For solving P-Median problem with Math-Heuristic.
- PMedianForm_SpalshScreen: GUI for the Lib.
- PMedLibWCFService: WCF Service for the Lib.
- PMedLibWebService: Web Service for the Lib.
- CoinMP.dll included.