Traveling Salesman solver in Assembly Language demo
Loading...
3,214
Loading...
Uploader Comments (omadeon)
see all
All Comments (8)
-
GA is not a good method for TSP. Local search algorithms are much better (faster and better solution)
-
@omadeon Ok thanks. I put up a video of the program up on my channel. I'll try and find a good way of optimising it.
-
isnt prolog really slow? wouldn't it be better if compared to C code?
Loading...
Awesome music. What is it?
mazterarius 11 months ago
@mazterarius I am glad you like it. It's "Rebirth of the Dolphins", my own composition.
omadeon 11 months ago 3
That is very fast
I tried writing a program to solve that problem, it is very slow and doesn't really find good solutions if the number of points exceeds 20.
Any advice?
ElessarSemaj 1 year ago
@ElessarSemaj Well, look for genetic algorithms (GA) and also... "Concorde" (which I still haven't tested it enough, to see IF it is faster, compared to the program on THIS video... but doubt it -hehe) Simple google search will give you the answers.
omadeon 1 year ago
@XniX23
You are right, VERY generally speaking...
Firstly, I do intend to compare the algorithm to pure 'C', secondly I was waiting for the creators of LPA Win-Prolog to send me a better version of t their compiler, that can create executable files (the one I had was a demo version that didn't). LPA Prolog is QUITE FAST when compiling executables. So, there is work to be done, now, since I did receive their full compiler!
omadeon 2 years ago