Automatic version  Traveling Salesman problem (end point coincides with start point)  end point differs from start point  start point is given and end point is arbitrary  start point and end point are given 
Traveling Salesman problem by incremental method   by using Hilbert Curve 
by using Approximating polygon of Hilbert Curve 
TSP with a lot of time 
TSP with a lot of time version 2 
TSP with a lot of time version 3; using Delaunay triangulation 
TSP with a lot of time version 4; using Delaunay triangulation part 2 
TSP with a lot of time version 5; using incremental method and Delaunay triangulation 
TSP with a lot of time, a variation; using second order Delaunay triangulation 
TSP with a lot of time, a variation 2; using third order Delaunay triangulation 
TSP with a lot of time version 8; more effort but not enough 
Longestic traveling route  Longeric traveling route 
Shortestic traveling route  Shorteric traveling route 
Traveling route to some points 
Perpendicular bisectors for TSP  Extended perpendicular bisectors for TSP 
Click version  Traveling Salesman problem (end point coincides with start point)  end point differs from start point  start point is given and end point is arbitrary  start point and end point are given 
TSP with a lot of time 
TSP with a lot of time version 2 
TSP with a lot of time version 3; using Delaunay 
TSP with a lot of time version 4; using Delaunay part 2 
TSP with a lot of time version 5; using incremental method and Delaunay triangulation 
TSP with a lot of time, a variation; using second order Delaunay triangulation 
TSP with a lot of time, a variation 2; using third order Delaunay triangulation 
TSP with a lot of time version 8; more effort but not enough 
Differences of the Optimal path of Traveling Salesman Problem and Optimal path from Delaunay triangulation 
