IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v25y1977i5p864-870.html
   My bibliography  Save this article

Optimal Search of a Moving Target

Author

Listed:
  • Y. C. Kan

    (University of California, Berkeley, California)

Abstract

There are n boxes. A target is initially in box i with a given probability p ı , where p ı ≧ 0, ∑ p ı = 1. Then at discrete time t = 1, 2, …, it moves from box to box. If at time t the target is in box i , then it will be in box i with probability p ij at time t + 1, where p ij ≧ 0, ∑ j p ij = 1. A search of box i costs C ı ( c ı > 0) and finds the target with probability α ı if the target is in that box. A sequential search is made. The objective is either to maximize the probability of finding the target in a given number of searches or to minimize the expected searching cost before finding the target. Optimal strategies are characterized for special types of probability matrices [ p ij ] for the n -box model.

Suggested Citation

  • Y. C. Kan, 1977. "Optimal Search of a Moving Target," Operations Research, INFORMS, vol. 25(5), pages 864-870, October.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:864-870
    DOI: 10.1287/opre.25.5.864
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.5.864
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.5.864?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    2. János Flesch & Emin Karagözoǧlu & Andrés Perea, 2009. "Optimal search for a moving target with the option to wait," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 526-539, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:25:y:1977:i:5:p:864-870. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.