How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis

Yinfeng Xu () and Huili Zhang ()
Additional contact information
Yinfeng Xu: Xi’an Jiaotong University
Huili Zhang: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 16, 1062-1076

Abstract: Abstract Disasters often bring great uncertainty to the urban traffic network. Considering a special urban network and the rescuers’ communication, this paper focuses on the real-time rescue routing problem from a source node to an emergency spot. There are some uncertain edge blockages, which cannot be observed in advance. Our goal is to make all the rescuers arrive at the emergency spot as quickly as possible. We study the problem in two scenarios: (1) without communication $$(S_1)$$ ( S 1 ) , the rescuers can not communicate with the others; (2) with complete communication $$(S_2)$$ ( S 2 ) , the rescuers can share their information about the tracks and the detected edge blockages instantaneously. These two scenarios are both analyzed on the grid network and the general network, respectively. The results of worst case analysis indicate that the consideration of both the grid network and the rescuers’ communication can significantly improve the rescue efficiency.

Keywords: Routing; Shortest path; Rescuers’ communication; Grid network; Worst-case analysis (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9681-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9681-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9681-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().