Advertisement

Computational Management Science

, Volume 11, Issue 4, pp 459–473 | Cite as

An orienteering model for the search and rescue problem

  • Adel Guitouni
  • Hatem Masri
Original Paper

Abstract

In this paper, we propose a new model for the search and rescue problem. We focus on the case of a single airborne search asset through a connected space and continuous time with a maximum travel time \(T\). The intent is to maximize the detection of a cooperative target (search and rescue). The proposed model is based on the assumption of existing a priori information (e.g., result of information fusion process) to establish a spatial distribution of probability of containment in possible geographic locations. The possibility area is defined using a cut threshold on the probability of containment and the search path as well as the allocation of the level of effort to each region in the search space is obtained based on an orienteering model. We illustrate the application of the proposed model on an empirical example.

Keywords

Search and rescue problem Orienteering problem 

References

  1. Abi-Zeid I, Frost JR (2005) SARPlan: a decision support system for Canadian search and rescue operations. Eur J Oper Res 162(3):630–653CrossRefGoogle Scholar
  2. Dambreville F, Le Cadre JP (2002) Detection of a Markovian-target with optimization of the search efforts under generalized linear constraints. Naval Res Logist 49(2):117–142CrossRefGoogle Scholar
  3. Dell RF, Eagle JN, Alves Martins GH, Garnier Santos A (1996) Using multiple searchers in constrained-path moving target search problem. Naval Res Logist 43(4):463–480CrossRefGoogle Scholar
  4. Desrochers M, Laporte G (1991) Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints. Oper Res Lett 10(1):27–36CrossRefGoogle Scholar
  5. Doré PE, Martin A, Abi-Zeid I, Maupin P, Jousselme AL (2009) Theory of belief functions for information combination and update in search and rescue operations. In: The proceedings of the 12th international conference on information fusion Seattle, Washington, pp 514–521Google Scholar
  6. Eagle JN (1984) The optimal search for a moving target when the search path is constrained. Oper Res 32(5):1107–1115CrossRefGoogle Scholar
  7. Eagle JN, Yee JR (1990) An Optimal Branch, an optimal branch bound procedure for the constrained path moving target search problem. Oper Res 38(1):110–114CrossRefGoogle Scholar
  8. Erdogan G, Laporte G (2013) The orienteering problem with variable profits. Networks 61:104–116CrossRefGoogle Scholar
  9. Frost J (1998) The theory of search: a simplified explanation. Report by Soza & Company Ltd and Office of Search and Rescue US Coast GuardGoogle Scholar
  10. Hohzaki R, Iida K (1997) Optimal strategy of route and look for the path constrained search problem with reward criterion. Eur J Oper Res 100(1):236–249CrossRefGoogle Scholar
  11. Hong SP, Cho SJ, Park MJ (2009) A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. Eur J Oper Res 193(2):351–364CrossRefGoogle Scholar
  12. IAMSAR (1999) International Aeronautical and Maritime Search And Rescue Manual. ICAO/IMO publicationsGoogle Scholar
  13. Jacobson SH, McLay LA (2006) Optimal search strategies using simultaneous generalized hill climbing algorithms. Math Comput Model 43(9–10):1061–1073CrossRefGoogle Scholar
  14. Janez F (2007) Optimization method for sensor planning. Aerosp Sci Technol 11(4):310–316CrossRefGoogle Scholar
  15. Kao D, Dungan J, Pang A (2001) Visualizing 2D probability distributions from EOS satellite image-derived data sets: a case study. In: Proceedings of the conference on visualization ’01 San Diego. California San Diego, USA, pp 457–460Google Scholar
  16. Kara I, Laporte G, Tolga B (2004) A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur J Oper Res 158(3):793–795CrossRefGoogle Scholar
  17. Kierstead DP, Del Balzo DR (2003) A genetic algorithm applied to planning search paths in complicated environments. Mil Oper Res 8(2):45–59CrossRefGoogle Scholar
  18. Koopman BO (1980) Search and screening: general principles with historical applications. Pergamon Press, NYGoogle Scholar
  19. Miller C, Tucker A, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329CrossRefGoogle Scholar
  20. Sherali HD, Driscoll PJ (2002) On tightening the relaxations of Miller–Tucker–Zemlin formulations for asymmetric traveling salesman problem. Oper Res 50(4):656–669CrossRefGoogle Scholar
  21. Stewart TJ (1979) Search for a moving target when searcher motion is restricted. Comput Oper Res 6(3): 129–140CrossRefGoogle Scholar
  22. Stone LD (1975) Theory of optimal search. Academic Press, LondonGoogle Scholar
  23. Trummel JR, Weisinger JR (1986) The complexity of the optimal searcher path problem. Oper Res 34(2):324–327CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Command and Control Decision Support Systems SectionDefence R&D CanadaQuebecCanada
  2. 2.College of Business AdministrationUniversity of BahrainSakhirKingdom of Bahrain

Personalised recommendations