Fast or Slow : Search in Discrete Locations with Two Search Modes

Clarkson, Jake and Glazebrook, Kevin David and Lin, Kyle (2020) Fast or Slow : Search in Discrete Locations with Two Search Modes. Operations Research, 68 (2). pp. 552-571. ISSN 0030-364X

Text (Two Speed Search)
TwoSpeedSearch_Resubmitted_Version_no_colour.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (485kB)

Abstract

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 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 both on 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.