Abstract: Optimal routing in communication networks is a
major issue to be solved. In this paper, the application of Tabu Search
(TS) in the optimum routing problem where the aim is to minimize
the computational time and improvement of quality of the solution in
the communication have been addressed. The goal is to minimize the
average delays in the communication. The effectiveness of Tabu
Search method is shown by the results of simulation to solve the
shortest path problem. Through this approach computational cost can
be reduced.