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?
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)
I hate those damn salesmen can't they solve they problems? I already have problems by my own!!
😅😅 this is quite easy
Nice video. I should probably try to implement this
You are amazing this helped me so much
thanks alot for ur great work
Really good Video:) thank you 😊
I used your code but it only generated graph. What do u do to auto solve after run?
You got to check the key binding for the 'optimize' action.
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?
You just have to sample paths from the source S to the destination D, rather than all sources and destinations.
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)
The graph is a planar embedding only, actual physical paths can be three dimensional sure.
tsp is not np-complete...