Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques
by Alaa Awad Alzulaibani
International Journal of Mathematics in Operational Research (IJMOR), Vol. 17, No. 1, 2020

Abstract: The aim of this paper is to study the stability of the optimal distribution for the searching effort to detect two related Markovian targets by using multiple cooperative searchers. This effort, at each fixed number of time intervals, is a random variable with a normal distribution. The optimal solution (which makes the discounted effort reward with fuzzy parameter maximum) is obtained from solving a fuzzy stochastic optimisation problem. Rather than presenting an algorithm that shows the stability of the optimal distribution of an effort, we study more interesting special cases of located spider landmines and unrestricted effort. Two illustrative examples of Markovian and randomly located spider landmines are discussed.

Online publication date: Mon, 17-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com