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

Bi‐objective missile rescheduling for a naval task group with dynamic disruptions

Author

Listed:
  • Ahmet Silav
  • Orhan Karasakal
  • Esra Karasakal

Abstract

This paper considers the rescheduling of surface‐to‐air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti‐ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no‐leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP‐hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented ϵ‐constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:66:y:2019:i:7:p:596-615
    DOI: 10.1002/nav.21867
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21867
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21867?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. Cha, Young-Ho & Kim, Yeong-Dae, 2010. "Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities," Omega, Elsevier, vol. 38(5), pages 383-392, October.
    2. Samuel Matlin, 1970. "A Review of the Literature on the Missile-Allocation Problem," Operations Research, INFORMS, vol. 18(2), pages 334-373, April.
    3. K. D. Glazebrook & C. Kirkbride & H. M. Mitchell & D. P. Gaver & P. A. Jacobs, 2007. "Index Policies for Shooting Problems," Operations Research, INFORMS, vol. 55(4), pages 769-781, August.
    4. K. C. Shumate & G. T. Howard, 1974. "A proportional defense model," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(1), pages 69-78, March.
    5. Orhan Karasakal & Levent Kandiller & Nur Evin Özdemirel, 2011. "A branch and bound algorithm for sector allocation of a naval task group," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 655-669, October.
    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. Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
    8. Gad Manor & Moshe Kress, 1997. "Optimality of the greedy shooting strategy in the presence of incomplete damage information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(7), pages 613-622, October.
    9. 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.
    10. Ravindra K. Ahuja & Arvind Kumar & Krishna C. Jha & James B. Orlin, 2007. "Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem," Operations Research, INFORMS, vol. 55(6), pages 1136-1146, December.
    11. Gerald G. Brown & Robert F. Dell & R. Kevin Wood, 1997. "Optimization and Persistence," Interfaces, INFORMS, vol. 27(5), pages 15-37, October.
    12. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    13. Alexandra M. Newman & Richard E. Rosenthal & Javier Salmerón & Gerald G. Brown & Wilson Price & Anton Rowe & Charles F. Fennemore & Robert L. Taft, 2011. "Optimizing assignment of Tomahawk cruise missile missions to firing units," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 281-294, April.
    14. Alan S. Manne, 1958. "A Target-Assignment Problem," Operations Research, INFORMS, vol. 6(3), pages 346-351, June.
    15. Ojeong Kwon & Kyungsik Lee & Donghan Kang & Sungsoo Park, 2007. "A branch‐and‐price algorithm for a targeting problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(7), pages 732-741, October.
    16. Gerald G. Brown & Kelly J. Cormican & Siriphong Lawphongpanich & Daniel B. Widdis, 1997. "Optimizing submarine berthing with a persistence incentive," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 301-318, June.
    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. 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.
    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. Lu, Yiping & Chen, Danny Z., 2021. "A new exact algorithm for the Weapon-Target Assignment problem," Omega, Elsevier, vol. 98(C).
    4. Anissa Frini & Adel Guitouni & Abderrezak Benaskeur, 2017. "Solving Dynamic Multi-Criteria Resource-Target Allocation Problem Under Uncertainty: A Comparison of Decomposition and Myopic Approaches," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 16(06), pages 1465-1496, November.
    5. 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.
    6. 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.
    7. Cha, Young-Ho & Kim, Yeong-Dae, 2010. "Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities," Omega, Elsevier, vol. 38(5), pages 383-392, October.
    8. 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.
    9. Michael R. Miller & Robert J. Alexander & Vincent A. Arbige & Robert F. Dell & Steven R. Kremer & Brian P. McClune & Jane E. Oppenlander & Joshua P. Tomlin, 2017. "Optimal Allocation of Students to Naval Nuclear-Power Training Units," Interfaces, INFORMS, vol. 47(4), pages 320-335, August.
    10. 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.
    11. Sebastian Ruther & Natashia Boland & Faramroze G. Engineer & Ian Evans, 2017. "Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems," Transportation Science, INFORMS, vol. 51(1), pages 177-195, February.
    12. Hughes, Michael S. & Lunday, Brian J., 2022. "The Weapon Target Assignment Problem: Rational Inference of Adversary Target Utility Valuations from Observed Solutions," Omega, Elsevier, vol. 107(C).
    13. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    14. Gerardo Gonzalez & Christopher Richards & Alexandra Newman, 2018. "Optimal Course Scheduling for United States Air Force Academy Cadets," Interfaces, INFORMS, vol. 48(3), pages 217-234, June.
    15. 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.
    16. Juan Li & Bin Xin & Panos M. Pardalos & Jie Chen, 2021. "Solving bi-objective uncertain stochastic resource allocation problems by the CVaR-based risk measure and decomposition-based multi-objective evolutionary algorithms," Annals of Operations Research, Springer, vol. 296(1), pages 639-666, January.
    17. Wei Yang & Itır Karaesmen & Pınar Keskinocak & Sridhar Tayur, 2008. "Aircraft and crew scheduling for fractional ownership programs," Annals of Operations Research, Springer, vol. 159(1), pages 415-431, March.
    18. Zhichao Zheng & Karthik Natarajan & Chung-Piaw Teo, 2016. "Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty," Operations Research, INFORMS, vol. 64(6), pages 1406-1421, December.
    19. Gerald G. Brown & Walter C. DeGrange & Wilson L. Price & Anton A. Rowe, 2017. "Scheduling combat logistics force replenishments at sea for the US Navy," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 677-693, December.
    20. Thierry Petit & Andrew C. Trapp, 2019. "Enriching Solutions to Combinatorial Problems via Solution Engineering," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 429-444, July.

    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:66:y:2019:i:7:p:596-615. 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.