Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker

Abd-Elmoneim Anwar Mohamed and Mohamed Abd Allah El-Hadidy

Journal of Optimization, 2013, vol. 2013, 1-13

Abstract:

This paper formulates a search model that gives the optimal search plan for the problem of finding a discrete random walk target in minimum time. The target moves through one of n -disjoint real lines in : we have n -searchers starting the searching process for the target from any point rather than the origin. We find the conditions that make the expected value of the fi rst meeting time between one of the searchers and the target fi nite. Furthermore, we show the existence of the optimal search plan that minimizes the expected value of the fi rst meeting time and fi nd it. The effectiveness of this model is illustrated using numerical example.

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/7179/2013/706176.pdf (application/pdf)
http://downloads.hindawi.com/journals/7179/2013/706176.xml (text/xml)

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:hin:jjopti:706176

DOI: 10.1155/2013/706176

Access Statistics for this article

More articles in Journal of Optimization from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().