What does Optimal Transport for Luxury Stock Transfers conclude, in numbers, about “Client-Migration Matrices: Measuring Real Movement by the Least Movement Required”?
Answer: Chapter 5 applies optimal transport to client migration: in an illustrative matrix, gross movement is 13.43 times what the net change requires, so goods follow net flows and people follow gross flows.
Scope of the numbers: Chapter 5 applies optimal transport to client migration: in an illustrative matrix, gross movement is 13.43 times what the net change requires, so goods follow net flows and people follow gross flows. Chapter 7 examines equitable transport in the Treatise on the Balanced Standard of the Shiji (lateral transfers save 0.721 of freight in an illustrative model) and Monge's cuttings and fillings.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 13.43
clients 2040 year1 [450, 620, 270, 360, 180, 160]
year2 [426, 626, 276, 372, 184, 156]
observed movers 376 (0.1843); least movers for these margins 28 (0.0137)
gross movement is 13.43 times what the net change requires
distance-weighted: observed 46308, optimal transport 4670, ratio 9.92
least-movement flows: BJ>SH 6, BJ>HZ 6, BJ>SZ 8, BJ>CD 4, WH>SZ 4Show the full program
# Chapter 5. p52: an observed client-migration matrix against the least
# movement its own margins require.
# Rows: region where a VIP client was served in year 1; columns: region
# where the same client bought in year 2 (illustrative CRM counts, 2,040
# clients). Minimal movement with 0/1 cost equals TV times N; with a
# distance cost (unit_cost of p11, as a proxy for handover distance) it
# is the optimal transport cost between the two margins, solved by MODI.
import math
# 十一城经纬度(取整到 0.1 度);单位搬运费 = 30 + 0.1 * 公里,取整(示意:
# 含保价快递与门店交接,非任何承运商报价)
CITY = {"BJ": (116.4, 39.9), "TJ": (117.2, 39.1), "SH": (121.5, 31.2),
"HZ": (120.2, 30.3), "NJ": (118.8, 32.1), "GZ": (113.3, 23.1),
"SZ": (114.1, 22.5), "CD": (104.1, 30.7), "CQ": (106.5, 29.6),
"WH": (114.3, 30.6), "XA": (108.9, 34.3)}
def km(a, b):
(x1, y1), (x2, y2) = CITY[a], CITY[b]
dx = (x1 - x2) * 111.0 * math.cos(math.radians((y1 + y2) / 2.0))
return math.hypot(dx, (y1 - y2) * 111.0)
def unit_cost(a, b):
return 30 + round(0.1 * km(a, b))
def northwest(s, d):
# 西北角初解:阶梯形走 m + n - 1 步,保证基是一棵生成树
s, d = list(s), list(d)
m, n = len(s), len(d)
x = [[0] * n for _ in range(m)]
basis = []
i = j = 0
while True:
q = min(s[i], d[j])
x[i][j] = q
basis.append((i, j))
s[i] -= q
d[j] -= q
if i == m - 1 and j == n - 1:
break
if s[i] == 0 and i < m - 1:
i += 1
else:
j += 1
return x, basis
def potentials(c, basis, m, n):
# 位势:基格上 u_i + v_j = c_ij,取 u_0 = 0
u = [None] * m
v = [None] * n
u[0] = 0
while None in u or None in v:
for i, j in basis:
if u[i] is not None and v[j] is None:
v[j] = c[i][j] - u[i]
elif v[j] is not None and u[i] is None:
u[i] = c[i][j] - v[j]
return u, v
def tree_path(basis, i, j):
# 基树中从列 j 走回行 i 的格子序列(闭回路去掉入基格)
adj = {}
for a, b in basis:
adj.setdefault(("r", a), []).append(("c", b))
adj.setdefault(("c", b), []).append(("r", a))
prev = {("r", i): None}
todo = [("r", i)]
while todo:
node = todo.pop()
for nb in adj.get(node, []):
if nb not in prev:
prev[nb] = node
todo.append(nb)
path, node = [], ("c", j)
while prev[node] is not None:
p = prev[node]
cell = (p[1], node[1]) if p[0] == "r" else (node[1], p[1])
path.append(cell)
node = p
return path
def modi(c, s, d, x=None, basis=None, trace=None):
# 位势法(MODI):检验数 r_ij = c_ij - u_i - v_j 全部非负即最优
m, n = len(s), len(d)
if x is None:
x, basis = northwest(s, d)
x = [row[:] for row in x]
basis = list(basis)
steps = 0
while True:
u, v = potentials(c, basis, m, n)
best, cell = 0, None
for i in range(m):
for j in range(n):
r = c[i][j] - u[i] - v[j]
if r < best:
best, cell = r, (i, j)
if cell is None:
return x, basis, u, v, steps
i, j = cell
path = tree_path(basis, i, j)
minus, plus = path[0::2], path[1::2]
theta = min(x[a][b] for a, b in minus)
out = [e for e in minus if x[e[0]][e[1]] == theta][0]
x[i][j] += theta
for a, b in minus:
x[a][b] -= theta
for a, b in plus:
x[a][b] += theta
basis.remove(out)
basis.append(cell)
steps += 1
if trace is not None:
trace.append((cell, best, theta, out))
def total(c, x):
return math.fsum(c[i][j] * x[i][j]
for i in range(len(x)) for j in range(len(x[0])))
R = ["BJ", "SH", "HZ", "SZ", "CD", "WH"]
M = [[380, 22, 6, 18, 8, 16],
[14, 520, 48, 20, 6, 12],
[4, 40, 210, 6, 2, 8],
[10, 26, 4, 300, 10, 10],
[6, 4, 2, 12, 150, 6],
[12, 14, 6, 16, 8, 104]]
N = int(math.fsum(math.fsum(r) for r in M))
y1 = [int(math.fsum(r)) for r in M]
y2 = [int(math.fsum(M[i][j] for i in range(6))) for j in range(6)]
moved = N - int(math.fsum(M[i][i] for i in range(6)))
net = int(math.fsum(max(0, a - b) for a, b in zip(y1, y2)))
print("clients %d year1 %s" % (N, y1))
print(" year2 %s" % y2)
print("observed movers %d (%.4f); least movers for these margins %d (%.4f)"
% (moved, moved / N, net, net / N))
print("gross movement is %.2f times what the net change requires"
% (moved / net))
C = [[unit_cost(a, b) if a != b else 0 for b in R] for a in R]
obs = math.fsum(C[i][j] * M[i][j] for i in range(6) for j in range(6))
x, basis, u, v, _ = modi(C, y1, y2)
opt = total(C, x)
print("distance-weighted: observed %d, optimal transport %d, ratio %.2f"
% (int(obs), int(opt), obs / opt))
print("least-movement flows: " + ", ".join(
"%s>%s %d" % (R[i], R[j], x[i][j])
for i in range(6) for j in range(6) if i != j and x[i][j]))Single source and citation
Fan, Y. (2026). Optimal Transport and Kantorovich Duality: Minimum-Cost Rebalancing of Luxury Stock across Regions and Client-Migration Matrices (Version 1.0.0), Chapter 5: Client-Migration Matrices: Measuring Real Movement by the Least Movement Required. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-233 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026233,
author = {Fan, Yafu},
title = {Optimal Transport and Kantorovich Duality: Minimum-Cost Rebalancing of Luxury Stock across Regions and Client-Migration Matrices},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Price of Serving the Emptiest Shelf First: Greedy Transfers against the Transportation Optimum
- Chapter 2 · The Potential Method: Northwest-Corner Starts, Closed Loops and an Exact MODI Solution
- Chapter 3 · Kantorovich Duality: Potentials Are the Shadow Prices of Stores
- Chapter 4 · Entropic Regularisation and Sinkhorn: Faster, but Blurred
- Chapter 6 · Whole Units, Fees per Shipment and Moving Rates: From a Linear Optimum to an Executable Transfer Sheet
- Chapter 7 · East and West in the Sources: Sang Hongyang's Equitable Transport and Monge's Cuttings and Fillings
- Chapter 8 · Closing the Loop: The Weekly Transfer Sheet, the Shadow Price Table and Human Release