This is research is aimed at elaborating a new methodology of shortest path finding by utilizing the methods of taxonomy and genetic algorithms. Combination of the two is developed and called Genetic Tasonoiny Evaluator (<;TI:) which is espected to be an alternative tool to solve shortest path tinding problcins n,ithiii the traiisportation networks While keeping the propertics of transportation networks Taxonomy Ilecoiistructor (TR) traiistbniis the network representation into tasoiioiiiic structure, \vhich is hierarchically shaped, based 011 problem to bc solved I n the process '1'11 also creates classilication of nodes i n the network. This classiticatioii provides facilities to isolate the problein to the core, and the criteria that can be inserted in the Genetic Algorithin (GA). A package prograin for GTE is then developed in C-Language and perfonnawe of model is analyzed upon a medium scale of Sious-l:alls City Net\vork. hi conclusion, it is found that to achieve fairly quick coiivergeiicc ofG?'I: computation several optimal paraiiictcrs of GA should be Jetcniuned prior to searching for the shortest paths. And since G has only been applied to limited case, it is suggested that the findings could be a threshold for further researches.