عنوان مقاله [English]
نویسنده [English]چکیده [English]
Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms. Multiple application of this problem in both theoretical and operational field is remarkable to researches. Mate heuristic Optimization algorithm by ant colony is a kind of successful methods which has been used to solve discrete combinational optimization problems recent years. An algorithm based on ant colony optimization is presented in this paper to solve fuzzy traveling salesman problem. Presented algorithm has been programmed and run at C++ environment and results of each run were compared with coded results of Branch and Bound algorithm by Lingo 8.0. Suggested algorithm has resulted successfully in small scale and in the case of large scale has resulted to feasible solution at short time.