Skip to main content
SpringerLink
Log in

An improved online evacuation strategy from a convex region on grid networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This study considers an evacuation problem where an evacuee tries to escape to the boundary of a convex affected area on a grid network. The boundary is unknown to the evacuee and cannot be identified until reaching an arbitrary point of it. We propose an online evacuation strategy with a competitive ratio less than 17.5, which improves the previously best result of 19.5.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Baeza-Yates RA, Culberson JC, Rawlins GJE (1993) Searching in the plane. Inf Comput 106(2):234–252

    Article  MathSciNet  MATH  Google Scholar 

  • Berman P (1998) On-line searching and navigation. In: Fiat A, Woeginger GJ (eds) Online algorithms. Lecture notes in computer science, vol 1442. Springer, Berlin, pp 232–241

    Google Scholar 

  • Burgard W, Moors M, Fox D et al (2000) Collaborative multi-robot exploration. In: Proceedings of ICRA millennium conference. IEEE international conference on robotics and automation, vol 1, pp 476–481

  • Chen X, Zhan FB (2008) Agent-based modelling and simulation of urban evacuation: relative effectiveness of simultaneous and staged evacuation strategies. J Oper Res Soc 59:25–33

    Article  MATH  Google Scholar 

  • Fleischer R, Kamphans T, Klein R et al (2008) Competitive online approximation of the optimal search ratio. SIAM J Comput 38(3):881–898

    Article  MathSciNet  MATH  Google Scholar 

  • Hamacher HW, Tjandra SA (2002) Mathematical modeling of evacuation problems: a state of the art. Pedestrian and evacuation dynamics. Springerpp, Berlin, pp 227–266

    MATH  Google Scholar 

  • Jez A, Lopuszanski J (2009) On the two-dimensional cow search problem. Inf Process Lett 109:543–547

    Article  MathSciNet  MATH  Google Scholar 

  • Lim GJ, Rungta M, Baharnemati MR (2015) Reliability analysis of evacuation routes under capacity uncertainty of road links. IIE Trans 47(1):50–63

    Article  Google Scholar 

  • Lu QS, George B, Shekhar S (2005) Capacity constrained routing algorithms for evacuation planning: a summary of results. Lect Notes Comput Sci 3633:291–307

    Article  Google Scholar 

  • Manasse M, McGeoch LA, Sleator D (1988) Competitive algorithms for on-line problems. In: Proceedings of the 20th annual ACM symposium on theory of computing. ACM, New York, pp 322–333

  • Panaite P, Pelc A (1999) Exploring unknown undirected graphs. J Algorithms 33(2):281–295

    Article  MathSciNet  MATH  Google Scholar 

  • Qin L, Xu YF (2017) Fibonacci helps to evacuate from a convex region in a grid network. J Comb Optim 34(2):398–413

    Article  MathSciNet  MATH  Google Scholar 

  • Shekhar S, Yang K, Gunturi VMV et al (2012) Experiences with evacuation route planning algorithms. Int J Geogr Inf Sci 26(12):2253–2265

    Article  Google Scholar 

  • Sleator D, Tarjan R (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202–208

    Article  MathSciNet  Google Scholar 

  • Wei Q, Tan X, Jiang B, Wang L (2014) On-line strategies for evacuating from a convex region in the plane. In: Zhang Z, Wu L, Xu W, Du DZ (eds) Combinatorial optimization and applications. COCOA 2014. Lecture notes in computer science, vol 8881, pp 74–85

  • Xu YF, Qin L (2013) Strategies of groups evacuation from a convex region in the plane. FAW-AAIM 2013. Lect Notes Comput Sci 7924:250–260

    Article  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China under Grant No. 11771346.

Author information

Authors and Affiliations

  1. School of Finance and Economics, Xi’an Jiaotong University, Xi’an, 710049, China

    Guiqing Zhang

  2. School of Management, Xi’an Jiaotong University, Xi’an, 710049, China

    Yongxi Cheng & Lan Qin

  3. State Key Lab for Manufacturing Systems Engineering, Xi’an, 710049, China

    Yongxi Cheng & Lan Qin

Authors
  1. Guiqing Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yongxi Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lan Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongxi Cheng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, G., Cheng, Y. & Qin, L. An improved online evacuation strategy from a convex region on grid networks. J Comb Optim 36, 44–54 (2018). https://doi.org/10.1007/s10878-018-0284-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0284-8

Keywords

Search

Navigation