Fast replanning incremental shortest path algorithm for dynamic transportation networks

Hartley, J. ORCID: 0000-0003-0727-9588 and Alhoula, W. ORCID: 0000-0001-7567-3523, 2019. Fast replanning incremental shortest path algorithm for dynamic transportation networks. In: K. Arai, R. Bhatia and S. Kapoor, eds., Intelligent computing. Proceedings of the Computing Conference 2019. Advances in intelligent systems and computing (997). Cham: Springer, pp. 22-43. ISBN 9783030228705

Full text not available from this repository.
Item Type: Chapter in book
Creators: Hartley, J. and Alhoula, W.
Publisher: Springer
Place of Publication: Cham
Date: June 2019
Number: 997
ISSN: 2194-5357
Identifiers:
NumberType
10.1007/978-3-030-22871-2_3DOI
Divisions: Schools > School of Science and Technology
Depositing User: Linda Sullivan
Date Added: 29 Aug 2019 08:51
Last Modified: 27 May 2020 15:30
URI: http://irep.ntu.ac.uk/id/eprint/37511

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year