International Journal of Applied Operational Research
ژورنال بین المللی پژوهش عملیاتی
International Journal of Applied Operational Research - An Open Access Journal
Basic Sciences
http://ijorlu.lahijan.iau.ir
1
admin
2251-6867
2251-9432
8
7
14
8888
13
en
jalali
1391
12
1
gregorian
2013
3
1
3
2
online
1
fulltext
en
An Approach for Solving Traveling Salesman Problem
تخصصي
Special
پژوهشي
Research
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.
0
0
http://ijorlu.lahijan.iau.ir/browse.php?a_code=A-10-1-50&slc_lang=en&sid=1
R. N. Mondal
rnmondal71@yahoo.com
1003194753284600225
1003194753284600225
Yes
M. R. Hossain
1003194753284600226
1003194753284600226
No
S. K. Saha
1003194753284600227
1003194753284600227
No