This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007)
A Hybrid Method for Solving Traveling Salesman Problem
Melbourne, Australia
July 11-July 13
ISBN: 0-7695-2841-4
ASCII Text
x 
 
Bager Zarei, M. R. Meybodi, Mortaza Abbaszadeh, "A Hybrid Method for Solving Traveling Salesman Problem," Computer and Information Science, ACIS International Conference on, pp. 394-399, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICIS.2007.24,
author = {Bager Zarei and M. R. Meybodi and Mortaza Abbaszadeh},
title = {A Hybrid Method for Solving Traveling Salesman Problem},
journal ={Computer and Information Science, ACIS International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2841-4},
pages = {394-399},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICIS.2007.24},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Science, ACIS International Conference on
TI - A Hybrid Method for Solving Traveling Salesman Problem
SN - 0-7695-2841-4
SP394
EP399
A1 - Bager Zarei,
A1 - M. R. Meybodi,
A1 - Mortaza Abbaszadeh,
PY - 2007
KW - null
VL - 0
JA - Computer and Information Science, ACIS International Conference on
ER -
 
Bager Zarei, Islamic Azad University, Iran
M. R. Meybodi, Amirkabir University, Iran
Mortaza Abbaszadeh, Islamic Azad University, Iran
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.
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
Usage of this product signifies your acceptance of the Terms of Use.