Article

A branch‐and‐price algorithm for a targeting problem

Naval Research Logistics (Impact Factor: 0.69). 09/2007; 54(7):732 - 741. DOI: 10.1002/nav.20247

ABSTRACT In this paper, we consider a new weapon-target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch-and-price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy-style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007

0 Bookmarks
 · 
148 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Effect-based weapon-target pairing assigns weapons to targets for the given desired effects on such targets. The most obvious and natural effects on targets are represented by the percentages of damage of these targets. In this paper, we focus on the generation of input for effect-based weapon-target pairing optimization. One way to generate such input is based on the Joint Munition Effectiveness Manual (JMEM). JMEM allows the evaluation of the weapons. It is a database that contains many tables, and each table contains many different data fields. Because of the sheer size of JMEM, the optimization of weapon-target pairing based on JMEM is currently focused mainly on one target at a time. In other words, the optimization of weapon-target pairing for many targets and weapons is not directly supported by JMEM, although all the necessary data is there. In this paper, we derive an input based on the given JMEM and desired effect(s), which should be useful in the follow-on effect-based weapon-target pairing optimization that is not limited to a single weapon or target. In particular, effect-based weapon-target pairing will rely on the scanning of the attack guidance table that we derive from JMEM to determine a preferred set of weapon combinations for engaging a given set of targets.
    IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans 01/2012; 42(1):276-280. · 2.18 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a novel optimization algorithm for assigning weapons to targets based on desired kill probabilities. For the given weapons, targets, and desired kill probabilities, our optimization algorithm assigns weapons to targets that satisfy the desired kill probabilities and minimize the overkill. The minimization of overkill assures that any proper subset of the weapons assigned to a target results in a kill probability that is less than the desired kill probability on such a target. Computational results for up to 120 weapons and 120 targets indicate that the performance of this algorithm yields an average improvement in quality of solutions of 26.8% over the greedy algorithms, whereas execution times remained on the order of milliseconds.
    IEEE transactions on cybernetics. 12/2013; 43(6):1835-1844.
  • Source

Full-text (2 Sources)

Download
4 Downloads
Available from
Aug 20, 2014