I thought I share my method for getting a good enough solution to the traveling salesman problem. The problem is that you need to connect all the lines so that you can make the trip with the least amount of traveled distance. I created a graph in octave using a 100 random points. Then as a fun exercise I tried to connect all the lines.
Its a kind of a fun exercise. You don’t need a 100 points. Start with something smaller. With a computer program you could possible see how good a solution you can make.
Don’t try to solve it all at ones. As in many problems you need to divide it into smaller parts or groups.