Reload
Whirlpool
Variation 1 of Hilbert curveVariation 2 of Hilbert curveVariation 1 of Approximating Polygon of Hilbert curveVariation 2 of Approximating Polygon of Hilbert curve
TSP by using Hilbert curveTSP by using Approximating Polygon of Hilbert curve
Hilbert CurveAppoximating polygon of Hilbert Curve
-
Automatic versionTraveling Salesman problem
(end point coincides with start point)
end point differs from start pointstart point is given and end point is arbitrarystart point and end point are given
Traveling Salesman problem by incremental methodby 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 routeLongeric traveling route
Shortestic traveling routeShorteric traveling route
Traveling route to some points
Perpendicular bisectors for TSPExtended perpendicular bisectors for TSP
Click versionTraveling Salesman problem
(end point coincides with start point)
end point differs from start pointstart point is given and end point is arbitrarystart 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(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.
hilbtsp.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