optional · interactive figures
capstone
Explore: one route, four insertions
The recurrence behind every VRPTW method, on a clock: time windows, start times, and the one-comparison test for inserting a customer.
optional: nothing in the lab depends on it back to the slides
These figures support the slides; they don't replace them, and the unit is complete
without them. Each one is computed from the unit's own data or reference solution, so
what you see agrees with the numbers on the slides.
Inside a figure, the arrow keys and drags belong to the figure; click outside it (or
press Esc) to use them for the slides again.
capstone · explore
A route on the clock, and where 4 fits
Try: step through the base route, the four insertion positions for customer 4, and the optimum. Static versions: the recurrence , constant-time insertion .
What it shows. The four-customer instance of the capstone deck, as a map and as a time axis: the
green bars are time windows, the dark blocks are service, and the dashed ticks on the first view are latest
starts. Start times come from the reference schedule and latest_starts, insertion
costs from insertion_delta, recorded by slides/viz/traces/ucapstone.py. For an
infeasible insertion schedule only returns None, so the times shown there continue the recurrence
without checking deadlines, to point at the customer that runs late.
Base route: starts 30, 80, 120; latest starts 50, 100, 200; back at 170.
Inserting 4 first or between 1 and 2 makes customer 1 or 2 start after its window: infeasible.
Between 2 and 3: extra distance 60, customer 3 starts at 190 of a window closing at 200. That route is the optimum, distance 200.
At the end: feasible but 80 extra.