Search

Traveler Salesman Problem is one of the most important and application problems in the combination optimization district that transportation usage allocate the most important place to itself among practical. Since the success of problem solution represent its power of usage into the different science and engineering variety of methods are suggested for it's solution. In this paper, we find out the shortest tour by solving the Traveler Salesman Problem. That is concurrent for 104 Iran selected points and we use Harmony Search algorithm to solve it. In order to survay the applicability of results, we optimize them by changing algorithm's parameters . This comparison shows a remakable priority in answer qualification wich are result from Harmony Search algorithm by changing parameters. [ABSTRACT FROM AUTHOR]