A Fast TSP Solver Using GA on JAVA - Gcd.org

More documents

Recommendations

Info

Netscape is a trademark of Netscape Communications Corporation.Figure 4: applet on WWWing new problems one after another and executing theapplet. Some of those problems are shown in Fig. 5.Some students added and removed a few towns intheir problems and watched the transformation of thesolution. Some tried to alter the parameters of the2opt<strong>GA</strong> and observe what would happen. Throughmany trials, they got the feeling of the diculty ofthe <strong>TSP</strong>, and gained a concrete understanding of theoptimization problems.A summary of comments from the students follows: Good Points{ It's easy and fun.{ I can see the progress of solving the problemsimultaneously.{ I had thought that web pages were only forreading, so I was surprised to see your pagefor solving the <strong>TSP</strong>.
Bad Points{ No grid. The coordinates of the mouse arenot displayed, so I cannot put towns accuratelyinto the places I want.{ I can't try pre-dened problems. I can't saveproblems. (Note: the current version of theapplet can read the <strong>TSP</strong> le that containsthe coordinates of towns.){ I want to see the convergence graph. I wishto check not only the elite but also the otherindividuals in the population. It would beconvenient if the CPU time consumed tosolve the problem was displayed.We also present the following sample problems inour WWW pages:and sample problems listed in Table 2 from the URL:http://www.hitachi.co.jp/Div/sdl/e-naiyo/e-seika22/Table 1: Class les to download.File nameCities.classCity.class<strong>GA</strong>.classGene.classSort.classSortable.class<strong>TSP</strong>.classTspRoute.classSize3k1k3k3k1k1k8k4k randomly located 100 towns double circle 192 towns (\C"-type) double circle 192 towns (\O"-type)Double circle problems were used as benchmarksby Yamamura et al.[6] The minimum solutions of theproblems are known and they are either \C"-type or\O"-type.Table 2: Sample problems.File name Problemgr96.data Africa-Subproblem of 666-city <strong>TSP</strong>gr202.data Europe-Subproblem of 666-city <strong>TSP</strong>test100.dat Randomly located 100 townsc192-4682.dat Double circle 192 towns (\C"-type)c192-4684.dat Double circle 192 towns (\O"-type)‘C’-type‘O’-typeinner / outer = 3/5 inner / outer = 4/5Figure 6: the minimum solutions of the double circleproblemsAs shown in Fig. 6, the type of solution that willyield the minimum, depends on the number of townsand the ratio of the radii of the inner and outer circles.3.2 Stand-alone ApplicationThe applet can also be used as a stand-alone application.First, download class les listed in Table 1\Africa-Subproblem of 666-city <strong>TSP</strong>" and \Europe-Subproblem of 666-city <strong>TSP</strong>" are contained in<strong>TSP</strong>LIB[5].\<strong>TSP</strong>.class" contains the main method, so executethat le as a JAVA application with arguments `lename'and `generation'. The rst argument, `lename',is the name of the <strong>TSP</strong> le that contains thelocation of towns of the <strong>TSP</strong> to be solved. The secondarguments, `generation', is the maximum generationto be evolved. Optional ags listed in Table 3 can beused.Each line in the <strong>TSP</strong> le represents the coordinatesof a town and consists of two elds separated by acomma. The rst eld means the X coordinate of thetown and the second eld means the Y coordinate.The cost between two towns is measured as the Euclideandistance between the coordinates of each town.If the <strong>TSP</strong> le contains the lineEDGE_WEIGHT_TYPE: GEOthe cost is dened by the geographical distance oftwo towns, i.e., the distance on the earth, instead of
Page 1 and 2: AFast TSP<
Page 3: gf b false.ggg while f a = true or

A Fast TSP Solver Using GA on JAVA - Gcd.org

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?