With the growth and physical development of cities, intra-city travel has increased and a large amount of people's time is wasted in traffic every day. Therefore, today, up-to-date and new methods and algorithms are used for routing in the intra-city road network and routing. In this regard, the aim of the present study is to investigate the ability of the genetic algorithm in analyzing and routing intra-city traffic (case study: Zabol city). The present study is applied in terms of purpose and descriptive-analytical in terms of method, which was carried out using library-documentary and field studies. The research data, including primary data (questionnaire form), were collected from a group of elites and experts. To analyze the information, the genetic algorithm and the abstract hierarchical routing method were used. In this study, 4 urban points and 8 factors were examined. The results showed that in terms of execution time, the genetic algorithm solves the routing problem in this network much faster than the hierarchical analysis. Other results showed that in most of the routes, the path length of the proposed genetic method was shorter and better than the analytic hierarchy process. In general, the analytic hierarchy process is suitable for GIS applications where off-grid routing needs to be done with small computational resources and in a limited time, or when routes need to be calculated repeatedly in a specific area.