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

Anti‐ship missile defense for a naval task group

Author

Listed:
  • Orhan Karasakal
  • Nur Evin Özdemirel
  • Levent Kandiller

Abstract

In this study, we present a new formulation for the air defense problem of warships in a naval task group and propose a solution method. We define the missile allocation problem (MAP) as the optimal allocation of a set of surface‐to‐air missiles (SAMs) of a naval task group to a set of attacking air targets. MAP is a new treatment of an emerging problem fostered by the rapid increase in the capabilities of anti‐ship missiles (ASMs), the different levels of air defense capabilities of the warships against the ASM threat, and new technology that enables a fully coordinated and collective defense. In addition to allocating SAMs to ASMs, MAP also schedules launching of SAM rounds according to shoot‐look‐shoot engagement policy or its variations, considering multiple SAM systems and ASM types. MAP can be used for air defense planning under a given scenario. As thorough scenario analysis would require repetitive use of MAP, we propose efficient heuristic procedures for solving the problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011

Suggested Citation

  • Orhan Karasakal & Nur Evin Özdemirel & Levent Kandiller, 2011. "Anti‐ship missile defense for a naval task group," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 304-321, April.
    • Handle: RePEc:wly:navres:v:58:y:2011:i:3:p:304-321
    DOI: 10.1002/nav.20457
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20457
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20457?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. Dhaifalla K. Al‐Mutairi & Richard M. Soland, 2005. "Attrition through a partially coordinated area defense," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 74-81, February.
    2. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Samuel Matlin, 1970. "A Review of the Literature on the Missile-Allocation Problem," Operations Research, INFORMS, vol. 18(2), pages 334-373, April.
    4. Martin P. F. M. van Dongen & Joost Kos, 1995. "The analysis of ship air defense: The simulation model SEAROADS," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(2), pages 291-309, March.
    5. Rui Almeida & Donald P. Gaver & Patricia A. Jacobs, 1995. "Simple probability models for assessing the value of information in defense against missile attack," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(4), pages 535-547, June.
    6. Stefan A. Burr & James E. Falk & Alan F. Karr, 1985. "Integer Prim-Read Solutions to a Class of Target Defense Problems," Operations Research, INFORMS, vol. 33(4), pages 726-745, August.
    7. Bao U. Nguyen & Peter A. Smith & Du Nguyen, 1997. "An engagement model to optimize defense against a multiple attack assuming perfect kill assessment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(7), pages 687-697, October.
    8. Richard M. Soland, 1987. "Optimal Terminal Defense Tactics When Several Sequential Engagements are Possible," Operations Research, INFORMS, vol. 35(4), pages 537-542, August.
    9. Eitan Wacholder, 1989. "A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 1(4), pages 232-246, November.
    10. Hanif D. Sherali & Youngho Lee & Donald D. Boyer, 1995. "Scheduling target illuminators in naval battle‐group anti‐air warfare," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 737-755, August.
    11. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Ojeong Kwon & Donghan Kang & Kyungsik Lee & Sungsoo Park, 1999. "Lagrangian relaxation approach to the targeting problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 640-653, September.
    13. Thomas W. Lucas & John E. McGunnigle, 2003. "When is model complexity too much? Illustrating the benefits of simple models with Hughes' salvo equations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(3), pages 197-217, April.
    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. Ahmet Silav & Esra Karasakal & Orhan Karasakal, 2022. "Bi-objective dynamic weapon-target assignment problem with stability measure," Annals of Operations Research, Springer, vol. 311(2), pages 1229-1247, April.

    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. Davis, Michael T. & Robbins, Matthew J. & Lunday, Brian J., 2017. "Approximate dynamic programming for missile defense interceptor fire control," European Journal of Operational Research, Elsevier, vol. 259(3), pages 873-886.
    2. Alexander G. Kline & Darryl K. Ahner & Brian J. Lunday, 2019. "Real-time heuristic algorithms for the static weapon target assignment problem," Journal of Heuristics, Springer, vol. 25(3), pages 377-397, June.
    3. Michael J. Armstrong, 2014. "Modeling Short-Range Ballistic Missile Defense and Israel's Iron Dome System," Operations Research, INFORMS, vol. 62(5), pages 1028-1039, October.
    4. Alexandre Colaers Andersen & Konstantin Pavlikov & Túlio A. M. Toffolo, 2022. "Weapon-target assignment problem: exact and approximate solution algorithms," Annals of Operations Research, Springer, vol. 312(2), pages 581-606, May.
    5. Ahmet Silav & Orhan Karasakal & Esra Karasakal, 2019. "Bi‐objective missile rescheduling for a naval task group with dynamic disruptions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 596-615, October.
    6. Alexander G. Kline & Darryl K. Ahner & Brian J. Lunday, 2020. "A heuristic and metaheuristic approach to the static weapon target assignment problem," Journal of Global Optimization, Springer, vol. 78(4), pages 791-812, December.
    7. Chan Y. Han & Brian J. Lunday & Matthew J. Robbins, 2016. "A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 405-416, August.
    8. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    9. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    10. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    11. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    12. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    13. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    14. repec:dgr:rugsom:99a17 is not listed on IDEAS
    15. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    16. Gülpınar, Nalan & Çanakoğlu, Ethem & Branke, Juergen, 2018. "Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 291-303.
    17. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
    18. Shengminjie Chen & Donglei Du & Wenguo Yang & Suixiang Gao, 2024. "Maximizing stochastic set function under a matroid constraint from decomposition," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-21, August.
    19. Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang, 2022. "Maximizing a monotone non-submodular function under a knapsack constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1125-1148, July.
    20. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
    21. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.

    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:58:y:2011:i:3:p:304-321. 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.