A branch-and-price algorithm for a targeting problem

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. (c) 2007 Wiley Periodicals, Inc.
Publisher
JOHN WILEY SONS INC
Issue Date
2007-10
Language
ENG
Keywords

ASSIGNMENT PROBLEM; COLUMN GENERATION

Citation

NAVAL RESEARCH LOGISTICS, v.54, no.7, pp.732 - 741

ISSN
0894-069X
DOI
10.1002/nav.20247
URI
http://hdl.handle.net/10203/7550
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 449
  • Download : 2
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 9 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0