|
Published Articles >> Table of Contents >> Abstract
6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007)
pp. 394-399
A Hybrid Method for Solving Traveling Salesman Problem
Bager Zarei, Islamic Azad University, Iran
M. R. Meybodi, Amirkabir University, Iran
Mortaza Abbaszadeh, Islamic Azad University, Iran
Full Article Text:
DOI Bookmark:
http://doi.ieeecomputersociety.org/10.1109/ICIS.2007.24
Send link to a friend
| Abstract |
|
One of the important problems in graphs theory is
TSP. Both learning automata and genetic algorithms
are search tools which are used for solving many NPComplete
problems. In this paper a hybrid algorithm is
proposed to solve TSP. This algorithm uses both GA
and LA simultaneously to search in state space. It has
been shown that the speed of reaching to answer
increases remarkably using LA and GA simultaneously
in search process, and it also prevents algorithm from
being trapped in local minimums. Experimental results
show the superiority of hybrid algorithm over LA and
GA.
|
 Additional Information
|
Citation:
Bager Zarei, M. R. Meybodi, Mortaza Abbaszadeh,
"A Hybrid Method for Solving Traveling Salesman Problem,"
icis,
pp. 394-399,
6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007),
2007
|
|
