关于「在线到达:贪心放置、利特尔伍德保留量与最短起订时长」,《摄影场馆的装箱、退改与折旧》给出的定量结论是什么?

结论:第二章说明平均分配负荷的放置规则最差,按利特尔伍德规则为高价订单保留 4 档可多赚 1581 元。

数据口径:书中参数为示意;全部计算由书中程序生成;本书不是个人化的税务、法律或投资建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(22 段程序)、原典与作者的假说。

English version

对照数据表

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

fare ratio 1600/2600 = 0.6154
hold yP(late>=y)expected revenue (late demand mean 5)
01.000020350
10.993320763
20.959621247
30.875321692
40.735021931
50.559521807
60.384021252
70.237820308
80.133419073
best hold 4 (Littlewood says 4), gain over 0: 1581 yuan
if late mean is really 3: hold 2, cost of holding 4 = 591
if late mean is really 7: hold 6, cost of holding 4 = 672
查看完整验算程序
# Chapter 2. p22: how many Saturday blocks to hold back (Littlewood).
# 12 half-day blocks (4 studios x 3 blocks of 4 hours).  Package clients
# book early at 1600 yuan a block, demand Poisson(11); late commercial
# clients pay 2600 a block, demand Poisson(5), and arrive after the
# package clients.  Holding back y blocks means selling at most 12 - y
# to packages.  Littlewood's rule: protect the y-th block while
# P(late demand >= y) > 1600 / 2600.  Exact expectation by enumeration.
# Prices and demand means are illustrative.
import math

CAP, PL, PH = 12, 1600, 2600

def pois(m, k):
    return math.exp(-m + k * math.log(m) - math.lgamma(k + 1)) if m else (
        1.0 if k == 0 else 0.0)

def revenue(y, ml, mh):
    out = []
    for dl in range(60):
        lo = min(dl, CAP - y)
        left = CAP - lo
        eh = math.fsum(pois(mh, dh) * min(dh, left) for dh in range(60))
        out.append(pois(ml, dl) * (PL * lo + PH * eh))
    return math.fsum(out)

def littlewood(mh):
    y = 0
    while math.fsum(pois(mh, k) for k in range(y + 1, 80)) > PL / PH:
        y += 1
    return y

print("fare ratio {}/{} = {:.4f}".format(PL, PH, PL / PH))
print("hold y  P(late>=y)  expected revenue (late demand mean 5)")
best = None
for y in range(0, 9):
    tail = math.fsum(pois(5, k) for k in range(y, 80))
    r = revenue(y, 11, 5)
    if best is None or r > best[1]:
        best = (y, r)
    print("{:6d}  {:10.4f}  {:10.0f}".format(y, tail, r))
print("best hold {} (Littlewood says {}), gain over 0: {:.0f} yuan".format(
    best[0], littlewood(5), best[1] - revenue(0, 11, 5)))
for mh in (3, 7):
    y = littlewood(mh)
    loss = revenue(y, 11, mh) - revenue(littlewood(5), 11, mh)
    print("if late mean is really {}: hold {}, cost of holding {} = {:.0f}"
          .format(mh, y, littlewood(5), loss))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《多规格实景空间时段一维装箱、动态退改期权阶梯与高损耗器材加速折旧运筹》第 2 章「在线到达:贪心放置、利特尔伍德保留量与最短起订时长」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026173,
  author    = {Fan, Yafu},
  title     = {One-Dimensional Time-Slot Packing for Multi-Format Studio Sets, Dynamic Cancellation-Option Ladders and Accelerated Depreciation of High-Wear Equipment},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论