Day: August 25, 2026
-
Solving Traveling Salesman: 2-Opt, 3-Opt & Tabu Search
Yes, local search finds near-optimal tours. Pure nearest-neighbor heuristics get trapped in costly local minima. See the 2-opt, 3-opt &…
Malcolm Low | Practical AI, Computing & Quantum Research
Singapore-based practical guides, tutorials and experiments in AI, computing, modelling, simulation, optimisation and quantum computing, with research notes and hands-on workflows.
Yes, local search finds near-optimal tours. Pure nearest-neighbor heuristics get trapped in costly local minima. See the 2-opt, 3-opt &…