A Novel GPU-Based Approach to Exploit Time-Respectingness in Public Transport Networks for Efficient Computation of Earliest Arrival Time
In static temporal networks, the Earliest Arrival Time (EAT) problem is to calculate the earliest possible time of arrival at a set of vertices from a given source vertex. Applications of the EAT problem include designing efficient evacuation planning in dynamic scenarios, optimal journey planning i...
Main Authors: | Sunil Kumar Maurya, Anshu S. Anand |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9832895/ |
Similar Items
-
Accelerated Diffusion-Based Recommendation Algorithm on Tripartite Graphs with GPU Clusters
by: Jingpeng Wang, et al.
Published: (2016-03-01) -
Graph Processing Scheme Using GPU With Value-Driven Differential Scheduling
by: Sangho Song, et al.
Published: (2024-01-01) -
Acceleration of a Production-Level Unstructured Grid Finite Volume CFD Code on GPU
by: Jian Zhang, et al.
Published: (2023-05-01) -
The earliest Neolithic complex in Siberia: the Ust-Karenga 12 site and its significance for the Neolithisation process in Eurasia
by: Yaroslav V. Kuzmin, et al.
Published: (2007-12-01) -
The Earliest Smooth Release Time for a New Task Based on EDF Algorithm
by: Guangming Qian
Published: (2020-01-01)