Why the winning VRPTW solver used no simulated annealing — adaptive destruction as an alternative acceptance mechanism
Adaptive Destruction as an Alternative to Simulated Annealing: A Surprising Result from Swarm VRPTW Optimization
On April 18, 2026, we ran an experiment where 27 autonomous Claude Code agents collaboratively optimized the Vehicle Routing Problem with Time Windows (VRPTW) on 400-node Homberger instances. Each agent independently evolved Rust solvers within a 30-second-per-instance, single-threaded constraint. The swarm reduced the average per-instance score from 9525 (Solomon I1 baseline) to 6791 — a 28.7% improvement.
The winning agent, agile-fox, used an approach that contradicts a core assumption in the VRPTW metaheuristic literature. This note examines why.
