A Hybrid Method for Solving Traveling Salesman Problem

@article{Zarei2007AHM,
  title={A Hybrid Method for Solving Traveling Salesman Problem},
  author={Bager Zarei and Mohammad Reza Meybodi and Mortaza Abbaszadeh Meinagh},
  journal={6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007)},
  year={2007},
  pages={394-399}
}
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 NP-complete 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… CONTINUE READING
8 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Experimental Analysis of Heuristics for the ATSP”, in The Traveling Salesman Problem and its Variations

  • D. S. Johnson, G. Gutin, L. A. McGeoch, A. Yeo, W. Zhang, A. Zverovich
  • 2002

Experimental Analysis of Heuristics for the STSP”, in The Traveling Salesman Problem and its Variations

  • D. S. Johnson, L. A. McGeoch
  • 2002

H.,"Solving Graph Isomorphism Using Learning Automata

  • Meybodi, R M., Beigy
  • Dept. Of Computer Engineering,
  • 2001

Optimization of Topology of neural Networks Using Learning Automata

  • H. Beigy, M. R. Meybodi
  • Proc. Of 3th Annual Int. Computer Society of Iran…
  • 1999

Similar Papers

Loading similar papers…