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)\), the rescuers can not communicate with the others; (2) with complete communication \((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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adhari H, Dreibholz T, Becke M (2011) Evaluation of concurrent multipath transfer over dissimilar paths. In: Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA) pp 708–714
Akgun V, Erkut E, Batta R (2000) On finding dissimilar paths. Eur J Oper Res 121(2):232–246
Catanzaro D, Labbe M, Salazar-Neumann M (2011) Reduction approaches for robust shortest path problems. Comput Oper Res 38(11):1610–1619
Cho S, Geon K, Jeong Y, Ahn C-H, Lee SI, Lee H (2006) Real time traffic information service using terrestrial digital multimedia broadcasting system. IEEE Trans Broadcast 52(4):550–556
Dell’Olmo P, Gentili M, Scozzari A (2007) On finding dissimilar pareto-optimal paths. Eur J Oper Res 162(1):70–82
Eppstein D (1998) Finding the \(k\) shortest paths. SIAM J Comput 28(2):652–673
Gao S, Huang H (2012) Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks. Transp Res Part C 21(1):196–213
Hall RW (1986) The fastest path through a network with random time-dependent travel time. Transp Sci 20(3):182–188
Katoh N, Ibaraki T, Mine H (1982) An efficient algorithm for K shortest simple paths. Networks 12(4):411–427
Kim S, Lewis ME, White CC (2005) Optimal vehicle routing with real-time traffic information. IEEE Trans Intell Transp Syst 6(2):178–188
Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4):347–355
Montemanni R, Gambardella LM (2004) An exact algorithm for the robust shortest path problem with interval data. Comput Oper Res 31(10):1667–1680
Thomas BW, White Iii CC (2007) The dynamic shortest path problem with anticipation. Eur J Oper Res 176(2):836–854
Xu Y, Hu M, Su B (2009) The Canadian traveller problem and its competitive analysis. J Comb Optim 18(2):195–205
Yen JY (1971) Finding the K shortest loopless paths in a network. Manag Sci 17:712–716
Zhang H, Xu Y, Qin L (2013) The k-Canadian travelers problem with communication. J Comb Optim 26(2):251–265
Zielinski P (2004) The computational complexity of the relative robust shortest path problem with interval data. Eur J Oper Res 158(3):570–576
Acknowledgments
The authors would like to acknowledge the financial support of Grants (Nos. 71071123 and 60921003) from NSF of China and of Program for Changjiang Scholars and Innovative Research Team in University (IRT1173) from China Education Ministry.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xu, Y., Zhang, H. How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis. J Comb Optim 30, 1062–1076 (2015). https://doi.org/10.1007/s10878-013-9681-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9681-1