Originally Posted by
JimEli
Since solving the actual routing of the TSP is performed in several hundred lines of imported code, you could have at least mentioned attribution.
I wrote the python code above that reads in the waypoints from a CSV file, calculates the great circle distance between those waypoints, calculates the minimum cost through the waypoint network, and outputs that minimum cost path as PNG, CSV, KML, GPX. I used existing python libraries as the code works, however in order to know which libraries to use, I needed how to solve the problem, how to get the data in the correct format to use the libraries, and how to use the results.
I never claimed to have invented python, or its multitude of libraries, or the compiled libraries, the compilers, assembler language, operating system, or even the computer itself. The greedy.py solver is less than 200 lines of code (not including spaces or comments). It is not a complicated algorithm, nor is 2 -opt. I could write a 2-opt solver (
https://en.wikipedia.org/wiki/2-opt) in less than 20 lines (which would be better solver for larger datasets). You made a very silly comment, like saying someone didn't write stdio.h math.h numpy or pandas or their associated compiled libraries so that any code that uses them is invalid. Everyone can see the libraries used.
You are basically accusing me of plagiarism, would you like to enlighten us all where such a start to end solution has been presented before for everyone to see ?
What did you actually do apart from pontificate and preach how difficult a problem it is ?
BTW, This is my solution to the US 48 states problem using the same code (starting and ending in Washington), you know the one you said had "6,206,957,796,268,036,335,431,144,523,686,687,519,260,743,1 7 7,338,880,000,000,000 possible tours (~6.2 novemdecillion)" which I solved in under 10 seconds.
Did you really come up with that number of tours, or did you just lift if off another web page to make yourself sound intelligent ?
