IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v33y2016i03ns0217595916500196.html
   My bibliography  Save this article

On Maximum Discounted Effort Reward Search Problem

Author

Listed:
  • Mohamed Abd Allah El-Hadidy

    (Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt)

Abstract

In this paper, we formulate a new search model for detecting two related targets that randomly located in a finite set of different cells or randomly moved through those cells. We assume that the search effort at each fixed number of time intervals is a random variable with a normal distribution. Rather than minimizing the expected effort of detecting two related targets, the proposed mathematical model allows us to include the search effort as a function with fuzzy parameter (discounted parameter). Another feature of this paper is considering a fuzzy extension of a stochastic optimization problem, which is interesting. We present an algorithm that gives the optimal distribution of an effort which makes the discounted effort reward of finding the targets is maximum. Two numerical examples are illustrated to show the effectiveness of this model by setting some parameters to represent some situations, such as detecting the enemy ships, fighters and the landmines in the war.

Suggested Citation

  • Mohamed Abd Allah El-Hadidy, 2016. "On Maximum Discounted Effort Reward Search Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-30, June.
    • Handle: RePEc:wsi:apjorx:v:33:y:2016:i:03:n:s0217595916500196
    DOI: 10.1142/S0217595916500196
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595916500196
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595916500196?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
    ---><---

    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. James N. Eagle & James R. Yee, 1990. "An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem," Operations Research, INFORMS, vol. 38(1), pages 110-114, February.
    2. Kurano, Masami & Yasuda, Masami & Nakagami, Jun-ichi & Yoshida, Yuji, 1996. "Markov-type fuzzy decision processes with a discounted reward on a closed interval," European Journal of Operational Research, Elsevier, vol. 92(3), pages 649-662, August.
    3. Sharlin, Ariela, 1987. "Optimal search for one of many objects hidden in two boxes," European Journal of Operational Research, Elsevier, vol. 32(2), pages 251-259, November.
    4. Abd-Elmoneim Anwar Mohamed & Mohamed Abd Allah El-Hadidy, 2013. "Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker," Journal of Optimization, Hindawi, vol. 2013, pages 1-13, July.
    5. Nah-Oak Song & Demosthenis Teneketzis, 2004. "Discrete search with multiple sensors," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 60(1), pages 1-13, September.
    Full references (including those not matched with items on IDEAS)

    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. Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
    2. Popova, Elmira & Wu, Hsien-Chung, 1999. "Renewal reward processes with fuzzy rewards and their applications to T-age replacement policies," European Journal of Operational Research, Elsevier, vol. 117(3), pages 606-617, September.
    3. Lawrence D. Stone & Alan R. Washburn, 1991. "Introduction special issue on search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 465-468, August.
    4. Joseph B. Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    5. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    6. Bourque, François-Alex, 2019. "Solving the moving target search problem using indistinguishable searchers," European Journal of Operational Research, Elsevier, vol. 275(1), pages 45-52.
    7. Alan R. Washburn, 1998. "Branch and bound methods for a search problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 243-257, April.
    8. Joseph Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    9. Yoshida, Yuji, 2003. "A discrete-time model of American put option in an uncertain environment," European Journal of Operational Research, Elsevier, vol. 151(1), pages 153-166, November.
    10. 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.
    11. Lyn C. Thomas & James N. Eagle, 1995. "Criteria and approximate methods for path‐constrained moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 27-38, February.
    12. J F J Vermeulen & M van den Brink, 2005. "The search for an alerted moving target," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 514-525, May.
    13. Johannes O. Royset & Hiroyuki Sato, 2010. "Route optimization for multiple searchers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 701-717, December.
    14. Yolmeh, Abdolmajid & Baykal-Gürsoy, Melike, 2021. "Weighted network search games with multiple hidden objects and multiple search teams," European Journal of Operational Research, Elsevier, vol. 289(1), pages 338-349.
    15. Moshe Kress & Kyle Lin & Roberto Szechtman, 2008. "Optimal discrete search with imperfect specificity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 539-549, December.
    16. Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
    17. Hohzaki, Ryusuke & Iida, Koji, 2000. "A search game when a search path is given," European Journal of Operational Research, Elsevier, vol. 124(1), pages 114-124, July.
    18. Hohzaki, Ryusuke & Iida, Koji, 1997. "Optimal strategy of route and look for the path constrained search problem with reward criterion," European Journal of Operational Research, Elsevier, vol. 100(1), pages 236-249, July.
    19. Adel Guitouni & Hatem Masri, 2014. "An orienteering model for the search and rescue problem," Computational Management Science, Springer, vol. 11(4), pages 459-473, October.
    20. Morin, Michael & Abi-Zeid, Irène & Quimper, Claude-Guy, 2023. "Ant colony optimization for path planning in search and rescue operations," European Journal of Operational Research, Elsevier, vol. 305(1), pages 53-63.

    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:wsi:apjorx:v:33:y:2016:i:03:n:s0217595916500196. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.