The administration of transportation frameworks has ended up progressively imperative in numerous genuine applications such as area based administrations, production network administration, movement control, et cetera. These applications normally include questions over spatial street systems with powerfully changing and confused activity conditions. In this paper, we model such a system by a probabilistic time-dependent graph (PTGraph), whose edges are connected with unverifiable postponement capacities. We propose a valuable inquiry in the PT- Graph, in particular an Trip planner query (TPQ), which recovers excursion arranges that cross a set of inquiry focuses in PT- Graph, having the base voyaging time with high certainty. To handle the proficiency issue, we display the pruning systems time interim pruning and probabilistic pruning to viably discount bogus alerts of trek arrangements. Besides, we outline a pre computation method in view of the expense model and develop a list structure over the pre computed information to empower the pruning by means of the file. We coordinate our proposed pruning techniques into a productive question system to answer TPQs. Through far reaching tests, we exhibit the proficiency and adequacy of our TPQ question noting methodology