A Probabilistic Formulation of Problem of Optimal Search for a Lost Person

Petr Volf ()
Additional contact information
Petr Volf: Czech Academy of Sciences

SN Operations Research Forum, 2025, vol. 6, issue 2, 1-13

Abstract: Abstract This paper deals with a simple probabilistic description of some issues related to searching for a missing person. The questions solved are only a small part of a complex area of the search and rescue problems, but they nevertheless concern at least two interesting points of the application of mathematics in managerial decision-making. First, we propose the use of Bayes’ rule to recalculate the probability of a lost person’s location based on additional information. Next, the optimal ordering of searched areas is determined that minimizes the average (expected) search time. Finally, the proposed solutions will be illustrated with several artificial examples.

Keywords: Search and rescue; Lost person; Optimal search; Discrete probability; Bayes’ rule (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-025-00452-x 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:snopef:v:6:y:2025:i:2:d:10.1007_s43069-025-00452-x

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

DOI: 10.1007/s43069-025-00452-x

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().