关于「迂回铺垫:先修路再赶路的盈亏平衡」,《非最短路径与推演深度》给出的定量结论是什么?

结论:第二章把先修路再赶路写成工期模型,示意参数下最优铺垫占总工期 20.6%,省 39.2%,盈亏平衡铺垫为 59.94。

数据口径:书中参数为示意,全部计算由书中程序生成。 本书不是投资意见,也不是任何具体经营决策意见,不承诺任何收益。

English version

对照数据表

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

W100 units, r0 = 1.0, max lift a = 1.5, tau = 10
direct push100.00 time units
d rate T(d) vs_direct
01.000 100.00 +0.00
51.590 67.89 -32.11
101.948 61.33 -38.67
152.165 61.18 -38.82
202.297 63.54 -36.46
302.425 71.23 -28.77
402.473 80.44 -19.56
602.496 100.06 +0.06
802.499 120.01 +20.01
best tooling d*12.52; T* = 60.80; saving 39.2%
share of T* spent on tooling20.6%
break-even tooling (T = direct): d59.94
smallest job for which any tooling pays: W > 6.67
查看完整验算程序
# Chapter 2. p21: build the road first - detour time and its break-even
# Model (illustrative): a job needs W units of work. Pushing directly at
# rate r0 takes W / r0. A detour first spends d units of time on tooling,
# which lifts the rate to r(d) = r0 (1 + a (1 - exp(-d / tau))): the
# lift saturates at (1 + a). Total time T(d) = d + W / r(d). We find the
# best d, the largest d that still breaks even, and the smallest job for
# which any tooling pays: dT/dd < 0 at d = 0 iff W a / (r0 tau) > 1.
import math

W, R0, A, TAU = 100.0, 1.0, 1.5, 10.0


def rate(d):
    return R0 * (1 + A * (1 - math.exp(-d / TAU)))


def total(d):
    return d + W / rate(d)


def argmin(f, lo, hi):
    gr = (math.sqrt(5) - 1) / 2
    for _ in range(200):
        a = hi - gr * (hi - lo)
        b = lo + gr * (hi - lo)
        if f(a) < f(b):
            hi = b
        else:
            lo = a
    return 0.5 * (lo + hi)


direct = W / R0
print("W = {:.0f} units, r0 = {:.1f}, max lift a = {:.1f}, tau = {:.0f}"
      .format(W, R0, A, TAU))
print("direct push: {:.2f} time units".format(direct))
print("  d     rate    T(d)    vs_direct")
for d in (0, 5, 10, 15, 20, 30, 40, 60, 80):
    print(" {:3d}  {:6.3f}  {:7.2f}  {:+7.2f}".format(
        d, rate(d), total(d), total(d) - direct))
ds = argmin(total, 0.0, W)
ts = total(ds)
print("best tooling d* = {:.2f}; T* = {:.2f}; saving {:.1%}".format(
    ds, ts, 1 - ts / direct))
print("share of T* spent on tooling: {:.1%}".format(ds / ts))
lo, hi = ds, W
for _ in range(200):
    mid = 0.5 * (lo + hi)
    if total(mid) < direct:
        lo = mid
    else:
        hi = mid
print("break-even tooling (T = direct): d = {:.2f}".format(lo))
print("smallest job for which any tooling pays: W > {:.2f}".format(
    R0 * TAU / A))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《非最短路径最优解、二阶连锁效应全息推演与周密思考复利母典》第 2 章「迂回铺垫:先修路再赶路的盈亏平衡」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-384 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026384,
  author    = {Fan, Yafu},
  title     = {When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论