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

Path optimization for the resource‐constrained searcher

Author

Listed:
  • Hiroyuki Sato
  • Johannes O. Royset

Abstract

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010

Suggested Citation

  • Hiroyuki Sato & Johannes O. Royset, 2010. "Path optimization for the resource‐constrained searcher," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(5), pages 422-440, August.
    • Handle: RePEc:wly:navres:v:57:y:2010:i:5:p:422-440
    DOI: 10.1002/nav.20411
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20411
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20411?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
    ---><---

    References listed on IDEAS

    as
    1. Dean D. Dewolfe & James G. Stevens & R. Kevin Wood, 1993. "Setting military reenlistment bonuses," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(2), pages 143-160, March.
    2. Lau, Haye & Huang, Shoudong & Dissanayake, Gamini, 2008. "Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times," European Journal of Operational Research, Elsevier, vol. 190(2), pages 383-397, October.
    3. Alan R. Washburn, 1983. "Search for a Moving Target: The FAB Algorithm," Operations Research, INFORMS, vol. 31(4), pages 739-751, August.
    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. 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.
    2. Baycik, N. Orkun & Sharkey, Thomas C. & Rainwater, Chase E., 2020. "A Markov Decision Process approach for balancing intelligence and interdiction operations in city-level drug trafficking enforcement," Socio-Economic Planning Sciences, Elsevier, vol. 69(C).
    3. 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.
    4. 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.
    5. 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.
    6. 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.

    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. Kress, M. & Royset, J.O. & Rozen, N., 2012. "The eye and the fist: Optimizing search and interdiction," European Journal of Operational Research, Elsevier, vol. 220(2), pages 550-558.
    2. 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.
    3. Frédéric Dambreville & Jean‐Pierre Le Cadre, 2002. "Detection of a Markovian target with optimization of the search efforts under generalized linear constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(2), pages 117-142, March.
    4. Hohzaki, Ryusuke & Iida, Koji, 2001. "Optimal ambushing search for a moving target," European Journal of Operational Research, Elsevier, vol. 133(1), pages 120-129, August.
    5. Manon Raap & Silja Meyer-Nieberg & Stefan Pickl & Martin Zsifkovits, 2017. "Aerial Vehicle Search-Path Optimization: A Novel Method for Emergency Operations," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 965-983, March.
    6. Baycik, N. Orkun & Sharkey, Thomas C. & Rainwater, Chase E., 2020. "A Markov Decision Process approach for balancing intelligence and interdiction operations in city-level drug trafficking enforcement," Socio-Economic Planning Sciences, Elsevier, vol. 69(C).
    7. 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.
    8. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    9. 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.
    10. 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.
    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. Velarde, Luis Guillermo C. & Migon, Helio S. & Alcoforado, David A., 2008. "Hierarchical Bayesian models applied to air surveillance radars," European Journal of Operational Research, Elsevier, vol. 184(3), pages 1155-1162, February.
    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. 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.
    15. Frédéric Dambreville & Jean‐Pierre Le Cadre, 2007. "Constrained minimax optimization of continuous search efforts for the detection of a stationary target," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 589-601, September.
    16. 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.
    17. 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.

    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:57:y:2010:i:5:p:422-440. 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: 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.