Skip to main content
SpringerLink
Log in

On-Line Strategies for Evacuating from a Convex Region in the Plane

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8881))

Abstract

This paper considers the problem faced by a group of evacuees who must leave from an affected area as quickly as possible. We seek the strategies that achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 19.64-competitive strategy. It can be considered as the planar generalization of the doubling strategy. Also, we give a 21-competitive strategy in the grid network.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen, X., Zhan, F.B.: Agent-based simulation of evacuation strategies under different road network structures. J. Oper. Res. Soc. 59, 25–33 (2008)

    Article  MATH  Google Scholar 

  2. Lu, Q., George, B., Shekhar, S.: Capacity constrained routing algorithms for evacuation planning: a summary of results. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 291–307. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  4. Berman, P.: On-line searching and navigation. In: Fiat, A. (ed.) Online Algorithms 1996. LNCS, vol. 1442, pp. 232–241. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Burgard, W., Moors, M., Fox, D., Simmons, R., Thrum, S.: Collaborative multirobot exploration. In: Proceedings 2000 ICRA. Millennium Conference, IEEE International Conference on Robotics and Automation. Symposia Proceedings, vol. 1, pp. 476–481 (2000)

    Google Scholar 

  6. Xu, Y., Qin, L.: Strategies of groups evacuation from a convex region in the plane. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 250–260. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Wei, Q., Wang, L.J., Jiang, B.: Tactics for evacuating from an affected area. Proceedings 2013 ICCCI. IJMLC 3(5), 435–439 (2013)

    Google Scholar 

  8. BaezaYates, R.A., Culberson, J.C., Rawlins, G.J.: Searching in the plane. Inf. Comput. 106(2), 234–252 (1993)

    Article  MathSciNet  Google Scholar 

  9. Xu, Y.F., et al.: The canadian traveler problem and its competitive analysis. J. Comb. Optim. 18(2), 17–28 (2009)

    Article  Google Scholar 

  10. Du, H., Xu, Y.F.: An approximation algorithm for k-center problem on a convex polygon. J. Comb. Optim. 27(3), 504–518 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  11. Concalves, J.F., Resende, M.G.C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. 22(2), 180–201 (2010)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by National Natural Science Foundation of China (No. 61173034) and the General Project of Liaoning Province Science and Research (No. L2012487).

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Dalian Maritime University, Linghai Road 1, Dalian, China

    Qi Wei, Xuehou Tan, Bo Jiang & Lijuan Wang

  2. School of Information Science and Technology, Dalian Institute of Science and Technology, Bingang Road 999-26, Dalian, China

    Qi Wei & Lijuan Wang

  3. School of Information Science and Technology, Tokai University, 4-1-1 Kitakaname, Hiratsuka, 259-1292, Japan

    Xuehou Tan

Authors
  1. Qi Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xuehou Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bo Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lijuan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qi Wei .

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, Jinhua, Zhejiang, China

    Zhao Zhang

  2. University of Texas, Tyler, Texas, USA

    Lidong Wu

  3. University of Texas, Dallas, Texas, USA

    Wen Xu

  4. University of Texas, Dallas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

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. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12691-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12690-6

  • Online ISBN: 978-3-319-12691-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation