Deakin University
Browse

File(s) under permanent embargo

Dynamic multi-source Dijkstra's algorithm for vehicle routing

conference contribution
posted on 1996-01-01, 00:00 authored by Peter EklundPeter Eklund, S Kirkby, S Pollitt
This paper discusses the implementation of Dijkstra's classic double bucket algorithm for path finding in connected networks. The work reports on a modification of the algorithm embracing both static and dynamic heuristic components and multiple source nodes. The modified algorithm is applied in a 3D Spatial Information System (SIS) for routing emergency service vehicles. The algorithm has been implemented as a suite of modules and integrated into a commercial SIS software environment. Genuine 3D spatial data is used to test the algorithm on the problem of vehicle routing and rerouting under simulated earthquake conditions in the Japanese city of Okayama. Coverage graphs were also produced giving contour lines joining points with identical travel times.

History

Pagination

329-333

Location

Adelaide, South Australia

Start date

1996-11-18

End date

1996-11-20

Language

eng

Publication classification

E1.1 Full written paper - refereed

Editor/Contributor(s)

Narasimhan VL, Jain LC

Title of proceedings

ANZIIS 96 : Proceedings of the Australian New Zealand Conference on Intelligent Information Systems

Event

Australian New Zealand Conference on Intelligent Information Systems. (1996 : Adelaide, South Australia)

Publisher

IEEE

Place of publication

Piscataway, N. J.

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC