News for hackers. Stuff that matters.
Re:Ant Colony Optimization Visualization for the Travelling ... by jeremysalwen on Friday December 13, 2019 @04:37AM (#21780307)
Obviously finding good tours with a limited computational budget is an interesting problem[1]. So, no, it's not misleading, as this method is more efficient at finding good tours than brute-force (as claimed), and is even better than the NN heuristic.

[1] https://en.wikipedia.org/wiki/Travelling_salesman_problem#He...

Re:Ant Colony Optimization Visualization for the Travelling ... by 7thaccount on Friday December 13, 2019 @08:37AM (#21781368)
Branch-and-bound MIP isn't very computationally intensive. I run models with millions of variables and constraints on my laptop.

The commercial solvers (fast and best) are very expensive though. So you're kind of right in a eay.

Re:Ant Colony Optimization Visualization for the Travelling ... by toolslive on Friday December 13, 2019 @07:30AM (#21780977)
at least you should specify which brute force approach you're comparing it with.
Re:Ant Colony Optimization Visualization for the Travelling ... by thaumasiotes on Friday December 13, 2019 @08:39AM (#21781381)
What do you imagine the different brute force approaches are? I would assume the brute force approach is to calculate the cost of every possible route and choose the one that had the lowest cost.