@MASTERSTHESIS\{IMM1998-0507,
    author       = "M. Hindsberger",
    title        = "The target-radar allocation problem",
    year         = "1998",
    keywords     = "Metaheuristics, allocation, tabu search, simulated annealing, local seach, military",
    school       = "",
    address      = "",
    type         = "",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/507-full.html",
    abstract     = "This report covers metaheuristic algorithms: Local Search, Simulated An-
nealing, and Tabu Search used for allocation targeting radars to enemy
targets for the {HAWK} air-defense system. If implemented as a final part of
the system such an allocation plan should be found within 3 seconds, which
is a less timespan than metaheuristics usually are used within. The methods
were compared to each other as well as an existing problem specific
heuristic.

On this problem the implemented Tabu Search algorithm performed best
and was with respect to the maximization of the objective function value
superior to the existing algorithm. But the existing algorithm generally
engaged the targets at longer ranges, a wanted property that was not 
modelled well enough by the objective function. Improvements on this point
are possible in several ways and will be discussed.",
    isbn_issn    = "IMM-EKS-1998-9"
}