Solving the Travelling Salesman Problem using Ant Colony Optimization

I was tinkering around with the Godot game engine, and decided to write this TSP solver using ACO over a weekend. Hope you enjoy the video!
The code can be found here : github.com/hsaikia/Travelling...

[@patrickstival6179]

Nice video. I should probably try to implement this

[@wolfinthesuit]

I hate those damn salesmen can't they solve they problems? I already have problems by my own!!

[@ibrahimaba8966]

😅😅 this is quite easy

[@CosmicLF]

You are amazing this helped me so much

[@mohsenabdelaziz9476]

thanks alot for ur great work

[@aenber]

Really good Video:) thank you 😊

[@greglouis5779]

What if my graph have n number of nodes, how can I modify the ACO to travel from a specific source to a specific destination without passing through all the n number of nodes but only the nodes to the destination and that's it?

[@learnbyexample24]

You just have to sample paths from the source S to the destination D, rather than all sources and destinations.

[@tamseel101]

I used your code but it only generated graph. What do u do to auto solve after run?

[@learnbyexample24]

You got to check the key binding for the 'optimize' action.

[@36nibs]

this doesnt account for alternative directions and axis since its an ant colony you should have 6 axis (up and down) of direction instead of 4 (compass directions)

[@learnbyexample24]

The graph is a planar embedding only, actual physical paths can be three dimensional sure.

[@cheezeworm]

tsp is not np-complete...