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 · 中文版

Illustrative model calculation, not a live quote