Temporal shortest paths: Parallel computing implementations

We explore two types of parallel computing implementations for three algori thms for computing temporal shortest paths on transportation networks. One implementation is done on a distributed network of SUN SPARC workstations u sing PVM and the other on a shared memory computing platform, a SUN SPARC s erver equipped with eight processors, using threads. Computational results obtained by using three networks originating from practice are presented. T he shared memory computing platform is preferred for this application. (C) 2001 Elsevier Science B.V. All rights reserved.