Abstract
The route search problem is applied to various engineering fields. Many researchers study this problem. In this paper, we propose a new hybrid routing algorithm which combines Tabu search with Ant Colony Optimization. The proposed hybrid technique enables to find the shortest route including the blind alley. Experiments prove the effectiveness in comparison with conventional routing algorithm such as Dijkstra algorithm.
Author supplied keywords
Cite
CITATION STYLE
Yoshikawa, M., & Otani, K. (2010). Ant Colony Optimization routing algorithm with Tabu search. In Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010 (pp. 2104–2107).
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.