Abstract
Security Forces are often faced with the arduous task of conducting a search for active terrorists or insurgents. The decision maker is faced with the difficult task of deploying limited effort for search in various sectors. The paper presents a stochastic model which assigns target presence probabilities, optimises search effort and then revises the target presence probability based on likely movement of the insurgents and the search effort expended. The search effort is reassigned in an iterative process till the insurgents are captured/eliminated. The paper also discusses the factors that would affect target presence probabilities and suggests how this data could be used for making such searches more efficient and effective.
Similar content being viewed by others
References
Koopman B O, The Theory of Search Parts I, II and III, Operations Research 4, 1956.
Washburn A R, On Search For a Moving Target, Naval Research Logistics Quarterly 27, 1980, pp 315–322.
Stone L D, Theory of Optimal Search, Academic Press New York, 1975.
Brown S S, Optimal Search for a Moving Target in Discrete Time and Space, Operations Research 28, 1980, pp 1275–1289.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Khanna, R. Counter insurgency operations a mathematical modelling approach. OPSEARCH 41, 35–51 (2004). https://doi.org/10.1007/BF03398832
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398832