A Tabu Search Heuristic for Resource Management in Naval Warfare

  • Authors:
  • Dale E. Blodgett;Michel Gendreau;Franç/ois Guertin;Jean-Yves Potvin;René/ Sé/guin

  • Affiliations:
  • Lockheed Martin Canada, 6111 Royalmount Avenue, Montré/al, Qué/bec, Canada H4P 1K6;Dé/partement d'informatique et de recherche opé/rationnelle, Université/ de Montré/al, C.P. 6128, succursale Centre-ville, Montré/al, Qué/bec, Canada H3C 3J7&semi/ Centre d ...;Centre de recherche sur les transports, Université/ de Montré/al, C.P. 6128, succursale Centre-ville, Montré/al, Qué/bec, Canada H3C 3J7;Dé/partement d'informatique et de recherche opé/rationnelle, Université/ de Montré/al, C.P. 6128, succursale Centre-ville, Montré/al, Qué/bec, Canada H3C 3J7&semi/ Centre d ...;Qwest Advanced Technologies, 4001 Discovery Drive, Boulder, CO 80303, USA

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Effective utilization of scarce resources, in particular weapon resources, is a prominent issue in naval anti-air warfare. In this paper, defence plans are constructed to guide the allocation and scheduling of different types of defence weapons against anti-ship missiles, subject to various physical and operational constraints. To reduce the frequency of replanning, decision trees are considered to explicitly account, in a probabilistic manner, for all possible outcomes of a particular action. A construction heuristic is first developed to generate an initial tree. A tabu search heuristic then improves this tree through the removal or addition of defence actions, followed by update operations aimed at maintaining the consistency. Numerical results obtained on scenarios with an increasing number of threats show that substantial improvements, in terms of survivability of the ship, can be obtained in reasonable computation times using tabu search.