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
Keywords: Travelling Salesman Problem, Minimizing Distance Method, Branch and Bound Method, Tree Type Heuristic Method, Greedy Method

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
2018-12-26
How to Cite
AliF. H., & JassimS. M. (2018). New Improved Heuristic Method for Solving Travelling Salesman Problem. Iraqi Journal of Science, 59(4C), 2289-2300. Retrieved from http://scbaghdad.edu.iq/eijs/index.php/eijs/article/view/555
Section
Mathematics