In this paper we introduce a search approach for shortest path algorithm in a parallel distributed architecture which is designed to handle the time-dependency for multimodal transportation network. Our proposed algorithm relies on its effective target-oriented approach of reducing the search space while the distributed parallel processing focuses on reducing the computational time. The optimality of the algorithm is principally based on computing a virtual path which is basically an Euclidean distance from the source to the destination aiming at a restriction of the search space. After the presentation of the distributed algorithm, a profiling of the algorithm is given to evaluate its computing performance.