Reload

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

Screensaver

Traveling salesman problem with a lot of time version 3; using Delaunay triangulation(Click version)(Open 31/July/2010 : The 1st Revision Sunday, 01-Aug-2010 14:19:26 JST)

In this page, we can find the shortest route passing through the points you clicked.
Please click black screen. When you click more than 4 points, the screen shows the shortest route to pass through the points. But if the points are a lot (about more than 10), it takes a lot of time to obtain the solution, sorry.

In this version 2, I delete some combinations for quick computation. The condition of combinations are that two line segments cross each other.

In this version 3, further, comparing the shortest paths from Delaunay triangulation. In some cases, two paths have difference.
tspdelacli.java

---

If you have a message, don't hesitate to send it by using
E-mail:Mail Form
or
BBS

---

Use of Takashi Ohyama's website
English Home of Takashi Ohyama
Japanese Home of Takashi Ohyama