Loading...

Introducing a Heuristic Approach to Solve Euclidean Traveling Salesman Problem and Evaluating the Accuracy

Mostafazadeh Davani, Yalda | 2018

362 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 53356 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Mahlouji, Hashem; Qasemi Tari, Farhad
  7. Abstract:
  8. The traveling salesman problem consists of a salesman and a set of cities in which the salesman has to visit each one of the cities only once, starting from an arbitrary city and returning to the same city. The challenge of the problem is that to find a trip to minimize the total length of the tour.The Travelling Salesman problem is a well-known and important combinatorial optimization problem. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NP-complete problems. Due to its computational complexity, recent researches suggest that meta-heuristic approaches can be the best solution approach for the general form of this problem.This thesis explored an extension of this problem, symmetric Euclidean, and proposed a novel hybrid algorithm to solve the sub-problem by composing inter-node convex polygons. The solution to this sub-problem exploits particle swarm optimization (PSO) that benefits from the genetic algorithm (GA) to conduct a more accurate search.A computational experiment was conducted in which the efficiency of the proposed solution algorithm was compared with a GA and a hybrid PSO-LS. The result indicated that the proposed algorithm considerably improved the runtime and accuracy of generating final paths, compared to both challenging algorithms. That is; the proposed algorithm provided smaller average runtime with better average objective function values comparing to all challenging algorithms
  9. Keywords:
  10. Genetic Algorithm ; Heuristic Algorithm ; Traveling Salesman Problem ; Particles Swarm Optimization (PSO) ; Divide & Conquer Attack

 Digital Object List

 Bookmark

No TOC