What does Buyer Shopping Routes and Time Windows conclude, in numbers, about “Classical Sources East and West: Ding Wei's "One Move, Three Jobs" and Euler's Seven Bridges”?
Answer: Chapter 7 examines Shen Kuo's account of Ding Wei's "one move, three jobs" (an illustrative account saves 0.826) and Euler's seven bridges.
Scope of the numbers: Chapter 7 examines Shen Kuo's account of Ding Wei's "one move, three jobs" (an illustrative account saves 0.826) and Euler's seven bridges. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.
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: 0.826
| job separate combined saved | |
| earth | 2000 100 1900 |
| goods | 3000 600 2400 |
| rubble | 1200 80 1120 |
| canal opening (fixed) | 300 |
| total | 6200 1080 share saved 0.826 |
| combined still cheaper while water cost factor < 1.907 | |
| buyer: ten out-and-back trips 52.38 km vs one loop 20.99 km | |
| loop share of the star walk | 0.401 |
Show the full program
# Chapter 7. p71: "one move, three jobs" (Ding Wei, as told by Shen Kuo).
# Model: an illustrative cost account in cart-li (loads times li). The
# palace needs earth for bricks, timber and stone brought in, and rubble
# taken away. Separate plan: earth from a far pit, goods hauled overland
# from the river, rubble carted to a far dump. Combined plan: dig the
# street (earth on site), flood the trench and float the goods to the
# gate, then fill the trench with rubble. Every number is a stated
# assumption, not a historical record. Second part: the same idea on a
# buyer's day, ten out-and-back trips against one loop (p11 district).
import math
EARTH, GOODS, RUBBLE = 100, 100, 80 # 车次(示意)
FAR_PIT, OVERLAND, FAR_DUMP = 20, 30, 15 # 里(示意)
NEAR, WATER_FACTOR, CANAL_FIXED = 1, 0.2, 300
sep = [EARTH * FAR_PIT, GOODS * OVERLAND, RUBBLE * FAR_DUMP]
comb = [EARTH * NEAR, GOODS * OVERLAND * WATER_FACTOR, RUBBLE * NEAR]
print("job separate combined saved")
for name, a, b in zip(("earth", "goods", "rubble"), sep, comb):
print("%-8s %10.0f %9.0f %7.0f" % (name, a, b, a - b))
tot_s, tot_c = math.fsum(sep), math.fsum(comb) + CANAL_FIXED
print("canal opening (fixed) %5.0f" % CANAL_FIXED)
print("total %10.0f %9.0f share saved %.3f" % (
tot_s, tot_c, 1 - tot_c / tot_s))
# 盈亏平衡:水运系数多高时合并方案不再省
be = (tot_s - comb[0] - comb[2] - CANAL_FIXED) / (GOODS * OVERLAND)
print("combined still cheaper while water cost factor < %.3f" % be)
PTS = [(0.0, 0.0), (3.6, 2.7), (-3.5, -2.5), (2.7, 1.4), (1.4, -1.2),
(0.8, 0.6), (0.6, -2.0), (-0.6, -0.6), (1.8, 3.0), (3.6, 0.3),
(-0.4, -1.4)]
star = math.fsum(2 * math.hypot(x, y) for x, y in PTS[1:])
print("buyer: ten out-and-back trips %.2f km vs one loop 20.99 km" % star)
print("loop share of the star walk: %.3f" % (20.99 / star))Single source and citation
Fan, Y. (2026). Two-Opt Travelling-Salesman Search and Vehicle Routing with Time Windows: Shortest Shopping Loops in Tokyo, Osaka and Seoul under Counter Opening Hours (Version 1.0.0), Chapter 7: Classical Sources East and West: Ding Wei's "One Move, Three Jobs" and Euler's Seven Bridges. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-298 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026298,
author = {Fan, Yafu},
title = {Two-Opt Travelling-Salesman Search and Vehicle Routing with Time Windows: Shortest Shopping Loops in Tokyo, Osaka and Seoul under Counter Opening Hours},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Price of Nearest First: How Much Longer than the Shortest Loop
- Chapter 2 · Croes's Pairwise Exchange: Reversing a Stretch, Crossings and Local Optima
- Chapter 3 · Segment Moves and One-Way Streets: the Or-opt Neighbourhood and Asymmetric Travel
- Chapter 4 · Held-Karp Dynamic Programming: Exact Solutions, State Counts and "Above the Bound"
- Chapter 5 · The Counters' Clocks: Time-Window Feasibility and the Day with the Most Items
- Chapter 6 · Two Buyers and Random Queues: Vehicle Routing with Time Windows and Planning Slack
- Chapter 8 · Closing the Loop: the Shopping Route Planner and a Pre-Registered Test Plan