Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level analysis. In general, shortest path solution methods using optimization algorithms are divided into two categories: exact and approximate algorithms. In exact algorithms, achieving the optimal solution requires time, and consequently more cost. On the opposite side, there are some approximate algorithms that work in a short period of time. Metaheuristic algorithms are among approximate algorithms that are capable of finding optimal or nearoptimal solutions in a reasonable period of time. The method used in this study is to solve the shortest path problem with the combination of Genetic metaheuristic (GA) and Tabu Search (TS) algorithms. GA is inspired by genetic science and Darwin's theory of evolution; it is based on survival of the highest or natural selection. A common use of genetic algorithms is to be used as an optimization function. In GA, the genetic evolution of living things of life is simulated. Inspired by the evolutionary process of nature, these algorithms solve problems. GA forms a set of population (solutions), then it achieves an optimal set by acting some possess on the correct set. To solve a problem by genetic algorithms, it is necessary the problem is converted to the specific form required by GA. On the other hand, TS algorithm is not populationbased. It obtains an answer, then it tries to direct the answer to the optimal solution by applying a series of operators. This algorithm is highly similar to the Simulated Annealing algorithm. In this paper, for solving the shortest path problem, a series of geometric preprocessing on the network is done to generate a search area around the source and destination nodes. In the proposed algorithm, the cost function is defined as a complex number, which the real part shows the sum of the weight of the real edges, and the imaginary part denotes the number of virtual edges. The innovation of this research is about applying Tabu Search algorithm in mutations process of genetic algorithm. The proposed method overcomes the inappropriate response of the pure genetic algorithm in terms of the final weight of the path especially the large networks. In order to evaluate the efficiency of the proposed algorithm, the algorithm was implemented on a real directional network which is part of Tehran city road networks including 739 nodes and 1160 edges. The results show that in the proposed algorithm, the length of the path is as close as possible to the solution obtained from the definitive Dijkstra’s algorithm. This algorithm predicts approximately the final path length of 5% more than Dijkstra’s algorithm. But in terms of running speed, it is 5.12 times faster than the Dijkstra’s algorithm. In comparison with the pure genetic algorithm, the proposed algorithm is 9% shorter in average in terms of path length. And about the running time, the speed of the proposed algorithm is approximately equal to the pure genetic algorithm. Regarding to repeatability, the proposed algorithm also shows 25.36% of repeatability.
