Abstract

Emergency rescue is an important measure to save people's lives and reduce the loss. Choosing an effective rescue route has a great effect on the rescue process. In the previous research, the planning rescue routes were usually chosen in advance and little attention was paid to the unexpected accident happened in the road network during the rescue process. Under the condition of unexpected accident, whether to change route and which route to choose are crucial for the rescue work. In this paper, we concentrate on this problem and use a modified Dijistra algorithm to obtain the time-shortest rescue route in a road network. Moreover we give a simple example to prove the function of the modified algorithm. Ultimately it is hoped that the modified algorithm will give emergency services a good guidance during rescue work

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call