Supply Chain LabSite SelectionLab Home
Home / Site Selection
Network & Optimisation

Pick candidates. Open the best sites.

Drop demand points and candidate sites, then the p-median model selects which candidates to open to minimise total weighted distance - instantly, in your browser.

Labels
✋Click the map to add a demand point

Points

0 points
1

Result

p-median · live map
Add demand points and press Solve to compute the optimal location.

About this tool

Site Selection

The concept

The p-median problem: open p of the candidate sites so that the total demand-weighted distance to the nearest open site is as small as possible.

How it works

Every demand point is served by its nearest open site; the solver compares the combinations of p candidates (straight line or real roads) and keeps the cheapest one.

Winning strategy

Put candidates near demand clusters, then raise p one step at a time: the largest drop in weighted distance shows where the next site pays off.

minimise sum_i w_i x d(i, nearest open site)
Site selectionp-medianWeighted distanceSensitivity