Reload

Whirlpool
Variation 1 of Hilbert curve	Variation 2 of Hilbert curve	Variation 1 of Approximating Polygon of Hilbert curve	Variation 2 of Approximating Polygon of Hilbert curve
TSP by using Hilbert curve		TSP by using Approximating Polygon of Hilbert curve
Hilbert Curve		Appoximating polygon of Hilbert Curve
-

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's heauristic algorithm by using Hilbert Curve approximating polygon(Open 15/Sep/2003 : The 0th Revision Thursday, 03-Jun-2010 22:17:40 JST)
Many cases are bad example. But sometimes we can get good examples.
Good example

References
Gerhart Reinelt, Springer-Verlag, Traveling Salesman - Comunicational Solutions for TSP Applications - Lecture Notes in Computer Science 840
E.L.Lawler, J.K.Lenstra, A.H.G.Rinnooy Kan, D.B.Shmoys’˜AWILEY, The Traveling Salesman Problem
H. Sagan, Space-Filling Curves, Springer-Verlag.
hiltsp.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