🐜 3D Ant Colony Optimization — ACO in Volumetric Space
The same pheromone-stigmergy ACO algorithm as the 2D original — α/β weighted probabilistic tour construction, evaporation, elitist reinforcement — now solving the Travelling Salesman Problem over cities placed in true (x,y,z) space. Orbit the camera to see the pheromone field from any angle.
This is the 3D companion to the Ant Colony Optimization Simulator. It runs the identical algorithm — probabilistic tour construction weighted by pheromone (τ) raised to α and the distance heuristic (η=1/d) raised to β, pheromone evaporation by factor (1−ρ) each iteration, and elitist reinforcement of the global-best tour — but cities sit at real (x,y,z) coordinates inside a volumetric cage and edge distances are true 3D Euclidean distances, rendered live with Three.js/WebGL.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install