A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment

Heywood, P., Maddock, S. orcid.org/0000-0003-3179-0263, Bradley, R. et al. (7 more authors) (2019) A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment. Transportation Research Part C: Emerging Technologies, 104. pp. 332-347. ISSN 0968-090X

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/BY/4.0/).
Keywords: Macroscopic road network simulation; Assignment; Data-parallel; Shortest path; Algorithms
Dates:
  • Accepted: 16 May 2019
  • Published (online): 25 May 2019
  • Published: July 2019
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 21 Aug 2019 13:53
Last Modified: 21 Aug 2019 13:53
Status: Published
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.trc.2019.05.020
Related URLs:

Share / Export

Statistics