- I created an algorithm for the Travelling Salesman Problem and constructing simple (nonintersecting) polygons from a list of random points. Its consistently beating Ant Colony System and doing it faster, and can scale up to 1000 nodes. Sharing the tool here, and I welcome feedback https://gitlab.com/spederan/tsp-solver-tool 11 comments algorithms
Would you like to stay up to date with Computer science? Checkout Computer science
Weekly.
Related searches:
Search whole site: site:gitlab.com
Search title: Sped Eran / TSP-Solver tool · GitLab
See how to search.