|
An Approach for Solving Traveling Salesman Problem
|
R. N. Mondal   , M. R. Hossain , S. K. Saha |
|
|
|
Abstract: (32012 Views) |
| In this paper, we introduce a new approach for solving the traveling salesman problems
(TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed
method is based on the Hungarian algorithm, which has been used to solve an assignment problem for
reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems,
and illustrated it with analytical examples and by computer programming. The proposed method
builds on the initial solution of the traveling salesman problem (TSP) which is very simple, easy to
understand and apply.
Keywords: Traveling Salesman Problem, Hungarian Method, Optimal Solution, Computer Algorithm. |
|
| |
|
|
Full-Text [PDF 868 kb]
(11026 Downloads)
|
Type of Study: Research |
Subject:
Special
Received: 2013/03/18 | Published: 2013/03/15
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
