关于「位势法:西北角初解、闭回路与 MODI 精确求解」,《最优传输与奢品调货》给出的定量结论是什么?

结论:第二章从西北角的 2564 元出发,经六次换基走到 1281 元的最优,并说明伏格尔法有 0.777 的快照起点即最优。

数据口径:书中的门店、城市坐标、运价、库存、毛利与概率均为示意;全部计算由书中程序生成;本书是非个人化经营建议,书中小工具给出的每一条调拨都须由经营者人工放行。 第三章把位势读成地点价格:计入缺货毛利损失后,示意网络的最优总成本是 7322 元,「缺货店优先补」是 11003 元;每家店多一件货的影子价格都挤在边际缺货店的 1320 元附近,缺一件损失最大的店只值 1253 元,而影子价格是局部斜率,同一家店多 8 件只值 5709 元。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.777, 1281, 2564

network Astartpivotsfinal
northwest256461281
least-cost130811281
vogel128101281
1500 snapshotsstart gapexact sharemean pivots
northwest0.23220.0393.15
least-cost0.02060.3751.23
vogel0.00400.7770.36
查看完整验算程序
# Chapter 2. p22: does the starting plan matter? Northwest corner,
# least-cost cell and Vogel's approximation as MODI starting bases.
# Each start crosses out exactly one row or column per allocation, so it
# yields m + n - 1 basic cells (a spanning tree), as MODI requires.
# Network A from p21, then 1,500 random snapshots as in p12 (fixed seed).
import math
import random

# 十一城经纬度(取整到 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])))

def crossing(c, s, d, pick):
    # 通用初解:每次按 pick 规则选格,装满后划去一行或一列(只划一条)
    m, n = len(s), len(d)
    s, d = list(s), list(d)
    rows, cols = set(range(m)), set(range(n))
    x = [[0] * n for _ in range(m)]
    basis = []
    while rows and cols:
        i, j = pick(c, s, d, sorted(rows), sorted(cols))
        q = min(s[i], d[j])
        x[i][j] = q
        basis.append((i, j))
        s[i] -= q
        d[j] -= q
        if len(rows) == 1 and len(cols) == 1:
            break
        if s[i] == 0 and len(rows) > 1:
            rows.discard(i)
        else:
            cols.discard(j)
    return x, basis


def pick_least(c, s, d, rows, cols):
    return min(((c[i][j], i, j) for i in rows for j in cols))[1:]


def penalty(vals):
    vals = sorted(vals)
    return vals[1] - vals[0] if len(vals) > 1 else vals[0]


def pick_vogel(c, s, d, rows, cols):
    # 伏格尔法:罚数 = 该行(列)最小与次小运价之差,罚数最大的线上取最便宜格
    cand = []
    for i in rows:
        cand.append((penalty([c[i][j] for j in cols]), 0, i))
    for j in cols:
        cand.append((penalty([c[i][j] for i in rows]), 1, j))
    _, kind, k = max(cand, key=lambda t: (t[0], -t[1], -t[2]))
    if kind == 0:
        return k, min(cols, key=lambda j: (c[k][j], j))
    return min(rows, key=lambda i: (c[i][k], i)), k


def starts(c, s, d):
    out = {"northwest": northwest(s, d),
           "least-cost": crossing(c, s, d, pick_least),
           "vogel": crossing(c, s, d, pick_vogel)}
    res = {}
    for key, (x0, b0) in out.items():
        x, _, _, _, steps = modi(c, s, d, x0, b0)
        res[key] = (total(c, x0), steps, total(c, x))
    return res


SUP, S = ["SH", "SZ", "TJ", "CD"], [6, 5, 5, 2]
DEM, D = ["BJ", "CQ", "HZ", "WH", "GZ"], [3, 3, 5, 5, 2]
C = [[unit_cost(a, b) for b in DEM] for a in SUP]
print("network A          start  pivots  final")
for key, (c0, st, cf) in starts(C, S, D).items():
    print("%-15s %8d %7d %6d" % (key, int(c0), st, int(cf)))

rng = random.Random(20261114)
names = sorted(CITY)
N = 1500
acc = {k: ([], []) for k in ("northwest", "least-cost", "vogel")}
for _ in range(N):
    sup = rng.sample(names, rng.randint(3, 4))
    dem = rng.sample([k for k in names if k not in sup], rng.randint(3, 5))
    s = [rng.randint(1, 6) for _ in sup]
    tot = int(math.fsum(s))
    while tot < len(dem):
        s[0] += 1
        tot += 1
    cuts = sorted(rng.sample(range(1, tot), len(dem) - 1))
    d = [b - a for a, b in zip([0] + cuts, cuts + [tot])]
    c = [[unit_cost(a, b) for b in dem] for a in sup]
    for key, (c0, st, cf) in starts(c, s, d).items():
        acc[key][0].append(c0 / cf - 1.0)
        acc[key][1].append(st)
print("%d snapshots    start gap  exact share  mean pivots" % N)
for key, (g, st) in acc.items():
    print("%-15s %10.4f %12.3f %12.2f"
          % (key, math.fsum(g) / N, len([v for v in g if v < 1e-12]) / N,
             math.fsum(st) / N))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《最优传输康托罗维奇对偶、跨区域奢品调货最小搬运代价与客群迁移矩阵母典》第 2 章「位势法:西北角初解、闭回路与 MODI 精确求解」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论