Journal
OPERATIONS RESEARCH
Volume 68, Issue 2, Pages 552-571Publisher
INFORMS
DOI: 10.1287/opre.2019.1870
Keywords
Bayesian updating; Gittins index; optimal search; speed-accuracy trade-off; stochastic coupling; threshold-type policy
Funding
- Engineering and Physical Sciences Research Council STOR-i Centre for Doctoral Training [EP/L015692/1]
Ask authors/readers for more resources
An object is hidden in one of several discrete locations according to some known probability distribution, and the goal is to discover the object in the minimum expected time by successive searches of individual locations. If there is only one way to search each location, this search problem is solved using Gittins indices. Motivated by modern search technology, we extend earlier work to allow two modes-fast and slow-to search each location. The fast mode takes less time, but the slow mode is more likely to find the object. An optimal policy is difficult to obtain in general, because it requires an optimal sequence of search modes for each location in addition to a set of sequence-dependent Gittins indices for choosing between locations. Our analysis begins by-for each mode-identifying a sufficient condition for a location to use only that search mode in an optimal policy. For locations meeting neither sufficient condition, an optimal choice of search mode is extremely complicated, depending on both the probability distribution of the object's hiding location and the search parameters of the other locations. We propose several heuristic policies motivated by our analysis and demonstrate their near-optimal performance in an extensive numerical study.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available