IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v191y2008i2p347-359.html
   My bibliography  Save this article

Search for an immobile entity on a network

Author

Listed:
  • Jotshi, Arun
  • Batta, Rajan

Abstract

We consider the problem of searching for a single, uniformly distributed immobile entity on an undirected network. This problem differs from edge-covering problems, e.g., the Chinese Postman Problem (CPP), since the objective here is not to find the minimum length tour that covers all the edges at least once, but instead to minimize the expected time to find the entity. We introduce a heuristic algorithm to deal with the search process given that the entity is equally likely to be at any point on the network. Computational results are presented.

Suggested Citation

  • Jotshi, Arun & Batta, Rajan, 2008. "Search for an immobile entity on a network," European Journal of Operational Research, Elsevier, vol. 191(2), pages 347-359, December.
    • Handle: RePEc:eee:ejores:v:191:y:2008:i:2:p:347-359
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00903-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Reijnierse, J H & Potters, J A M, 1993. "Search Games with Immobile Hider," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 385-394.
    2. Shmuel Gal, 2001. "On the optimality of a simple strategy for searching graphs," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 533-542.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    2. Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022. "A competitive search game with a moving target," European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
    3. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    4. Garrec, Tristan & Scarsini, Marco, 2020. "Search for an immobile hider on a stochastic network," European Journal of Operational Research, Elsevier, vol. 283(2), pages 783-794.
    5. Jotshi, Arun & Gong, Qiang & Batta, Rajan, 2009. "Dispatching and routing of emergency vehicles in disaster mitigation using data fusion," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 1-24, March.
    6. Ron Teller & Moshe Zofi & Moshe Kaspi, 2019. "Minimizing the average searching time for an object within a graph," Computational Optimization and Applications, Springer, vol. 74(2), pages 517-545, November.
    7. Galindo, Gina & Batta, Rajan, 2013. "Review of recent developments in OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 230(2), pages 201-211.
    8. Baykal-Gürsoy, Melike & Duan, Zhe & Poor, H. Vincent & Garnaev, Andrey, 2014. "Infrastructure security games," European Journal of Operational Research, Elsevier, vol. 239(2), pages 469-478.
    9. Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    2. Lidbetter, Thomas, 2017. "On the approximation ratio of the Random Chinese Postman Tour for network search," European Journal of Operational Research, Elsevier, vol. 263(3), pages 782-788.
    3. Garrec, Tristan & Scarsini, Marco, 2020. "Search for an immobile hider on a stochastic network," European Journal of Operational Research, Elsevier, vol. 283(2), pages 783-794.
    4. Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
    5. Lidbetter, Thomas, 2013. "Search games with multiple hidden objects," LSE Research Online Documents on Economics 55103, London School of Economics and Political Science, LSE Library.
    6. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.
    7. Francis Bloch & Bhaskar Dutta & Marcin Dziubi´nski, 2024. "Strategic hiding and exploration in networks," Working Papers 112, Ashoka University, Department of Economics.
    8. Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.
    9. Steve Alpern & Shmuel Gal, 2002. "Searching for an Agent Who May OR May Not Want to be Found," Operations Research, INFORMS, vol. 50(2), pages 311-323, April.
    10. Steve Alpern & Vic Baston & Shmuel Gal, 2008. "Network search games with immobile hider, without a designated searcher starting point," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 281-302, June.
    11. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    12. Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022. "A competitive search game with a moving target," European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
    13. Steve Alpern & Thomas Lidbetter, 2019. "Approximate solutions for expanding search games on general networks," Annals of Operations Research, Springer, vol. 275(2), pages 259-279, April.
    14. Steve Alpern, 2017. "Hide-and-Seek Games on a Network, Using Combinatorial Search Paths," Operations Research, INFORMS, vol. 65(5), pages 1207-1214, October.
    15. Steve Alpern, 2011. "A New Approach to Gal’s Theory of Search Games on Weakly Eulerian Networks," Dynamic Games and Applications, Springer, vol. 1(2), pages 209-219, June.
    16. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.

    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:eee:ejores:v:191:y:2008:i:2:p:347-359. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.