Abstract
The Weapon-Target Assignment (WTA) problem aims to assign a set of weapons to a number of assets (targets), such that the expected value of survived targets is minimized. The WTA problem is a nonlinear combinatorial optimization problem known to be NP-hard. This paper applies several existing techniques to linearize the WTA problem. One linearization technique (Camm et al. in Oper Res 50(6):946–955, 2002) approximates the nonlinear terms of the WTA problem via convex piecewise linear functions and provides heuristic solutions to the WTA problem. Such approximation problems are, though, relatively easy to solve from the computational point of view even for large-scale problem instances. Another approach proposed by O’Hanley et al. (Eur J Oper Res 230(1):63–75, 2013) linearizes the WTA problem exactly at the expense of incorporating a significant number of additional variables and constraints, which makes many large-scale problem instances intractable. Motivated by the results of computational experiments with these existing solution approaches, a specialized new exact solution approach is developed, which is called branch-and-adjust. The proposed solution approach involves the compact piecewise linear convex under-approximation of the WTA objective function and solves the WTA problem exactly. The algorithm builds on top of any existing branch-and-cut or branch-and-bound algorithm and can be implemented using the tools provided by state-of-the-art mixed integer linear programming solvers. Numerical experiments demonstrate that the proposed specialized algorithm is capable of handling very large scale problem instances with up to 1500 weapons and 1000 targets, obtaining solutions with optimality gaps of up to \(2.0\%\) within 2 h of computational runtime.
Similar content being viewed by others
Notes
For more information concerning the callback functions, the reader is directed to IBM and ILOG (2020).
Source code available at https://github.com/tuliotoffolo/wta.
References
Ahuja, R. K., Kumar, A., Jha, K. C., & Orlin, J. B. (2007). Exact and heuristic algorithms for the weapon-target assignment problem. Operations Research, 55(6), 1136–1146.
Camm, J. D., Norman, S. K., Polasky, S., & Solow, A. R. (2002). Nature reserve site selection to maximize expected species covered. Operations Research, 50(6), 946–955.
Cetin, E., & Esen, S. T. (2006). A weapon-target assignment approach to media allocation. Applied Mathematics and Computation, 175(2), 1266–1275.
Chang, S.-c., James, R. M., & Shaw, J. J. (1987). Assignment algorithm for kinetic energy weapons in boost phase defence. In 26th IEEE conference on decision and control (Vol. 26, pp. 1678–1683), IEEE.
Day, R. H. (1966). Allocating weapons to target complexes by means of nonlinear programming. Operations Research, 14(6), 992–1013.
denBroeder Jr, G., Ellison, R., & Emerling, L. (1959). On optimum target assignments. Operations Research, 7(3), 322–326.
Eckler, A. R., & Burr, S. A. (1972). Mathematical models of target coverage and missile allocation. Technical report, Military Operations Research Society Alexandria, VA.
Esen, Ö., Çetin, E., & Esen, S. T. (2008). A mathematical immunochemoradiotherapy model: A multiobjective approach. Nonlinear Analysis: Real World Applications, 9(2), 511–517.
Glover, F. (1975). Improved linear integer programming formulations of nonlinear integer problems. Management Science, 22(4), 455–460.
IBM, ILOG. (2020). CPLEX optimization studio user manual.
Kline, A., Ahner, D., & Hill, R. (2019). The weapon-target assignment problem. Computers& Operations Research, 105, 226–236.
Lu, Y., & Chen, D. Z. (2021). A new exact algorithm for the weapon-target assignment problem. Omega, 98, 102138.
Manne, A. S. (1958). A target-assignment problem. Operations Research, 6(3), 346–351.
Matlin, S. (1970). A review of the literature on the missile-allocation problem. Operations Research, 18(2), 334–373.
Metler, W. A., Preston, F. L., & Hofmann, J. (1990). A suite of weapon assignment algorithms for a SDI mid-course battle manager. Technical report, Naval Research Lab Washington, DC.
Murphey, R. A., (2000). Target-based weapon target assignment problems. In Nonlinear assignment problems (pp. 39–53), Springer.
O’Hanley, J. R., Scaparra, M. P., & García, S. (2013). Probability chains: A general linearization technique for modeling reliability in facility location and related problems. European Journal of Operational Research, 230(1), 63–75.
Sonuc, E., Sen, B., & Bayir, S. (2017). A parallel simulated annealing algorithm for weapon-target assignment problem. International Journal of Advanced Computer Science and Applications, 8(4), 87–92.
Wacholder, E. (1989). A neural network-based optimization algorithm for the static weapon-target assignment problem. ORSA Journal on Computing, 1(4), 232–246.
Author information
Authors and Affiliations
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Andersen, A.C., Pavlikov, K. & Toffolo, T.A.M. Weapon-target assignment problem: exact and approximate solution algorithms. Ann Oper Res 312, 581–606 (2022). https://doi.org/10.1007/s10479-022-04525-6
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-022-04525-6