Minimizing the expected search time of finding the hidden object by maximizing the discount effort reward search

Abstract

A new search technique is developed to locate the hidden target (object) in one of the Ndisjoint regions that are not identical. The lost object follows a bivariate distribution. Minimizing the search effort with discount reward has been applied instead of reducing the expected search time. Moreover, the minimum number of searchers is determined in order to minimize the total expected cost. Assuming the object's position has a Circular Normal distribution, the Kuhn-Tucker necessary conditions are implemented to get the optimum search plan.

Developing a detection model for a COVID‐19 infected person based on a probabilistic dynamical system

“…They presented the existence of the optimal search plan which detects this person in minimum time. Also, El Hadidy 8–15 showed the importance of this theory in many real life applications. They presented new models for discovering lost targets (randomly located or moving) with maximum probability and the lowest possible cost.…”

Detection of an appropriate pharmaceutical company to get a suitable vaccine against COVID‐19 with minimum cost under the quality control process

“…14,15 Many studies have presented different search techniques on the plan and space, such as El-Hadidy et al. [16][17][18][19][20][21][22][23][40][41] For more recent and interesting search plans, see El-Hadidy et al. [24][25][26] All these studies have aimed to detect the lost targets with minimum cost and maximum probability.…”

Quality control for a detected an appropriate queue from K‐independent M/M/C/N queueing models

“…This problem is similar to the previous one which was solved by El‐Hadidy et al 3–5 They gave the optimal distribution of an, effort which maximizes the probability of detecting the target. In recent years, the detection (searching) process for the lost targets (stationary or mobile or randomly moving targets) has been studied extensively in many variations, mostly by El‐Hadidy et al 6–22 The main aim of this studies is to detect the lost target with maximum probability and minimum cost (time).…”

“…process for the lost targets (stationary or mobile or randomly moving targets) has been studied extensively in many variations, mostly by El-Hadidy et al [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22] The main aim of this studies is to detect the lost target with maximum probability and minimum cost (time).…”