home submit paper guide for authors contact us register search archive current issue journal info
   [Home ] [Archive]    
:: Volume 3, Issue 2 (3-2013) ::
2013, 3(2): 0-0 Back to browse issues page
An Approach for Solving Traveling Salesman Problem
R. N. Mondal , M. R. Hossain , S. K. Saha
Abstract:   (26841 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]   (7526 Downloads)    
Type of Study: Research | Subject: Special
Received: 2013/03/18
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA code


XML     Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

R. N. Mondal, M. R. Hossain, S. K. Saha. An Approach for Solving Traveling Salesman Problem. International Journal of Applied Operational Research. 2013; 3 (2)
URL: http://ijorlu.liau.ac.ir/article-1-225-en.html


Volume 3, Issue 2 (3-2013) Back to browse issues page
ژورنال بین المللی پژوهش عملیاتی International Journal of Applied Operational Research - An Open Access Journal
Persian site map - English site map - Created in 0.06 seconds with 31 queries by YEKTAWEB 3764