This website uses Cookies. Click Accept to agree to our website's cookie use as described in our Privacy Policy. Click Preferences to customize your cookie settings.
I found an optimization algorithm for TSP which beats christofides algorithm and it runs in N^2 time.
Also I solved rl11849.tsp instances which is from TSBLIB, and the cost of the tour got 1071737.956 and total time taken 1097.6395 seconds.
The important thing is not used any external hardware which is completely run on Lenovo laptop and the cost of that laptop is Rs.35000.
The code is completely working in python.
If the same implemented on C, it may run within 100-200 seconds max even for 11849 instances.
It is deterministic algorithm, which means any number of times you run the code will get same cost of the tour for the problem.
The algorithm uses a mathematical formula which I created, based on that it will run once get the tour and it passed to 2 opt. Almost I have checked more than 70+ TSBLIB instances and it beats christofides algorithm, also this algorithm will work for both STSP and ATSP as well.
I'm willing to showcase my algorithm to the team members. So, request you to send a feedback.
LinkedIn
Twitter
