<![CDATA[Travelling Salesman Problem (TSP) is a traveling salesman optimization problems in visiting the city and every town just skipped right one. Tsp problem can be applied to various activities are to optimize, in the completion of TSP there are several methods that can be used, including the algorithms evolve. To increase diversity and raise the quality of the solution, the method used is the replacement strategy. This study analyzes the replacement method of steady state and generational strategy. Replacement strategy steady state will be trapped local optimum because of the new individual created only one new member to be tested for inclusion in the population further, while the replacement strategy generational diversity will increase as generational this procedure replaces all individuals in a generation is replaced at once by a number of individuals The new results of crossover and mutation. In this study, the test data used is datatsp lib as much as 5 dataset, and raised as much as 128 generations, the testing of each data set 10 times of testing, resulting from this test is the average minimum distance and diversity, after testing then get a conclusion that by using the merger method of replacement strategy generational steady state and the shortest distance to get a solution that is more optimal.]]>
Copyrights © 2017
