%A Ali, Faez Hassan
%A Jassim, Sajad Majeed
%D 2018
%T New Improved Heuristic Method for Solving Travelling Salesman Problem
%B 2018
%9
%! New Improved Heuristic Method for Solving Travelling Salesman Problem
%K
%X In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM). The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5? n ?500, where n is the number of visited cities.
%U http://scbaghdad.edu.iq/eijs/index.php/eijs/article/view?path=
%J Iraqi Journal of Science
%0 Journal Article
%& 2289
%P 12
%@ 2312-1637
%8 2018-12-26
%7 2018-12-26