IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v38y1991i4p555-565.html
   My bibliography  Save this article

Linear search with bounded resources

Author

Listed:
  • R. D. Foley
  • T. P. Hill
  • M. C. Spruill

Abstract

A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F.

Suggested Citation

  • R. D. Foley & T. P. Hill & M. C. Spruill, 1991. "Linear search with bounded resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 555-565, August.
    • Handle: RePEc:wly:navres:v:38:y:1991:i:4:p:555-565
    DOI: 10.1002/1520-6750(199108)38:43.0.CO;2-8
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199108)38:43.0.CO;2-8
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199108)38:43.0.CO;2-8?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. V. J. Baston & A. Y. Garnaev, 1996. "A fast infiltration game on n arcs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 481-489, June.
    2. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    3. Steve Alpern & Anatole Beck, 1999. "Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting," Operations Research, INFORMS, vol. 47(6), pages 849-861, December.

    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:wly:navres:v:38:y:1991:i:4:p:555-565. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.