New Improved Heuristic Method for Solving Travelling Salesman Problem

  • Faez Hassan Ali Department of Mathematics, College of Science, Al-Mustansiryah University, Baghdad, Iraq
  • Sajad Majeed Jassim Department of Mathematics, College of Science, Al-Mustansiryah University, Baghdad, Iraq

Abstract

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.

Published
Dec 26, 2018
How to Cite
ALI, Faez Hassan; JASSIM, Sajad Majeed. New Improved Heuristic Method for Solving Travelling Salesman Problem. Iraqi Journal of Science, [S.l.], p. 2289-2300, dec. 2018. ISSN 2312-1637. Available at: <http://scbaghdad.edu.iq/eijs/index.php/eijs/article/view/555>. Date accessed: 23 oct. 2019.
Section
Mathematics