Two-Opt Travelling-Salesman Search and Vehicle Routing with Time Windows: Shortest Shopping Loops in Tokyo, Osaka and Seoul under Counter Opening Hours: chapter answers
Buyers who shop in Tokyo, Osaka and Seoul for stores and private clients most often plan their routes nearest first. This book refutes two beliefs behind that habit: that a nearest-first route cannot be much longer than the shortest loop, and that a day's count of items depends mainly on how short the walk is. Using nearest neighbour, pairwise exchange (2-opt), segment moves (Or-opt) and Held-Karp dynamic programming for the travelling-salesman problem, it measures the gap in distance; using vehicle routing with time windows, it measures how opening times, limited-release slots and queues aff…
DOI pending · monograph page goes live after publication · 5DL-B-298 · 中文版
- Chapter 1 · The Price of Nearest First: How Much Longer than the Shortest Loop
Chapter 1 checks and corrects the project blueprint: the literature's "about a quarter above" for nearest neighbour is an excess over the Held-Karp lower bound on large instances; at ten stops nearest neighbour is only… - Chapter 2 · Croes's Pairwise Exchange: Reversing a Stretch, Crossings and Local Optima
Pairwise exchange removes two legs, adds two, walks the stretch between them in reverse, and accepts the change whenever the total falls. On the illustrative Tokyo day, five exchanges cut 25.51 km down to 20.99 km, with… - Chapter 3 · Segment Moves and One-Way Streets: the Or-opt Neighbourhood and Asymmetric Travel
Segment moves lift one to three consecutive counters as a block and put them elsewhere, supplying the kind of improvement pairwise exchange cannot make. On the illustrative Osaka day, pairwise exchange stops at 23.41 km… - Chapter 4 · Held-Karp Dynamic Programming: Exact Solutions, State Counts and "Above the Bound"
Held-Karp dynamic programming remembers only "where I have been and where I stand", reducing the factorial of brute force to the order of $n^2 2n$. For the nine-stop loop of the illustrative Seoul day, the dynamic progr… - Chapter 5 · The Counters' Clocks: Time-Window Feasibility and the Day with the Most Items
Chapter 5 is the turning point: on an illustrative Tokyo day the shortest loop of 20.99 km collects only 12 items, while the plan with the most items walks 0.32 km more and collects all 15; over random days, switching f… - Chapter 6 · Two Buyers and Random Queues: Vehicle Routing with Time Windows and Planning Slack
Chapter 6 deals with two buyers sharing the work and with slack for random queues: planning on average times completes the list on 0.740 of days, and a fifth of slack raises that to 0.915. - Chapter 7 · Classical Sources East and West: Ding Wei's "One Move, Three Jobs" and Euler's Seven Bridges
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. - Chapter 8 · Closing the Loop: the Shopping Route Planner and a Pre-Registered Test Plan
Chapter 8 gives the buyer-day procedure, the Shopping Route Planner and a pre-registered test plan: the distance test needs about 37 buyer days and the clock test about 55 days per group. Marked boxes separate published…
Illustrative model calculation, not a live quote