Premium
Multisource multisink optimal evacuation routing with dynamic network changes: A geometric algebra approach
Author(s) -
Yu Zhaoyuan,
Li Dongshuang,
Zhu Shuai,
Luo Wen,
Hu Yong,
Yuan Lingwang
Publication year - 2017
Publication title -
mathematical methods in the applied sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.719
H-Index - 65
eISSN - 1099-1476
pISSN - 0170-4214
DOI - 10.1002/mma.4465
Subject(s) - routing (electronic design automation) , greedy algorithm , mathematical optimization , path (computing) , adaptive routing , flow network , matrix (chemical analysis) , computer science , mathematics , algorithm , computer network , routing protocol , materials science , dynamic source routing , composite material , programming language
In this paper, we introduced geometric algebra to develop a new multisource multisink optimal evacuation route planning method. A dynamically updatable data structure and a matrix‐based greedy searching algorithm were developed to support the dynamic evacuation route searching for multiple evacuees. Unlike most existing methods, which iteratively search the optimal path for each evacuee, our method can search all the possible evacuation routes synchronously. The dynamic updating of the network topography, weights, and constraints during the route searching is direct and flexible, thus can support the evacuation in dynamic cases. The method is demonstrated and tested by an evacuation case in the city of Changzhou, China. The simulation experiments suggest that the method can well support the dynamic route searching in large scales with dynamic weight changes.