Mar 2025
Route optimisation in Python: the delivery route problem with simulated annealing
The method behind the collection-rounds work, written out in full: why a greedy route is almost never the good one, and how letting the solver accept a worse answer early is what gets it to a better one later. The animation at the top of this site is this algorithm, running.
Written up from the collection-rounds case study
Read it