Abstract
In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead-times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real-time constraints of the radar system. In this paper, we present new tight 0-1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques.
Original language | English (US) |
---|---|
Pages (from-to) | 72-94 |
Number of pages | 23 |
Journal | Naval Research Logistics |
Volume | 51 |
Issue number | 1 |
DOIs | |
State | Published - Feb 2004 |
Externally published | Yes |
Keywords
- 0-1 integer programming
- Lagrangian relaxation
- Pulse interleaving
- Radar tracking
ASJC Scopus subject areas
- Modeling and Simulation
- Ocean Engineering
- Management Science and Operations Research