On minimum expected search time for a multiplicative random search problem
Mohamed Abd Allah El‐Hadidy, Mohamed Abd El-Hady Kassem · International Journal of Operational Research · 2017
In this paper, we obtain the minimum expected search time for a multiplicative random search problem from a viewpoint of computational optimisation. The target is drifting in one of m-disjoint bounded regions. Each region has a one searcher. We get a probabilistic multi-objective nonlinear fractional programming problem and we focus on a new method for solving it to obtain the minimum expected search time for detecting the target. An illustrative example has been given to demonstrate the applicability of this method.