Routing of platforms in a maritime surface surveillance operation

被引:11
作者
Grob, MJHB [1 ]
机构
[1] TNO, Phys & Elect Lab, Grp Decis & Policy Making, Div Operat Res & Business Management, The Hague, Netherlands
关键词
military; routing; travelling salesman; simulation;
D O I
10.1016/j.ejor.2004.02.029
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Maritime surface surveillance is the process of obtaining and maintaining information about surface ships in a certain sea area. It is carried out by maritime platforms such as frigates, helicopters or maritime patrol aircraft. Surface surveillance plays a vital role in maritime operations like trade embargo operations, counterdrug operations and traditional warfare operations. The problem of finding optimal tactics for a single surveillance unit is a routing problem which can to some extent be considered as an extension of the on-line travelling salesman problem, but there are essential complications which call for a different approach. A mathematical formulation of the surveillance routing problem is given in this paper. The complications of this problem, in comparison to the on-line travelling salesman problem, are explained. This routing problem is part of the rather complicated process of maritime surface surveillance. SURPASS, an acronym of SURface Picture Assessment, is a computer model which simulates this process. The model SURPASS provides insight into both the means (i.e. platforms and sensors) needed for a surveillance operation and the effectiveness of various existing and newly developed rules for surveillance tactics. The structure of SURPASS is explained, including the way in which it solves the surveillance routing problem. A number of decision rules that can be used in the routing of the surveillance units are described. The effectiveness of these rules is analysed and evaluated. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:613 / 628
页数:16
相关论文
共 6 条
[1]  
AUSIELLO G, 1995, WORKSH ALG DAT STRUC, P206
[2]  
Lawler E, 1985, TRAVELING SALESMAN P
[3]  
ORourke K. P., 2001, Mil. Oper.Res., V6, P5
[4]  
PLU MA, 1995, DYNAMIC ROUTING ASPE
[5]  
ROTHE G, 1988, THESIS TU GRAZ
[6]  
[No title captured]