A method for planning routes for patrol vessels is proposed. This method is based on a Self-Organizing Map (SOM) solution for the Travelling Salesman Problem (TSP), although with significant changes. The locations of reported Search and Rescue (SAR) requests, together with the locations of reported occurances of illigal fishing activities are used as guidelines for designing the path vessel should take. However, instead of forcing the patrol routes to pass exactly in those locations, as would happen in a TSP, the proposed method uses the locations as density estimators for where the patrol effort should be placed. It then obtaines a patrol route that passes through the areas with greater density. We show the behaviour of the proposed method on artificial data, and then apply the method to some data from the Portuguese Navy, obtaining possible routes for its patrol vessels.
|Title of host publication||Oceans 2005 - Europe|
|Number of pages||4|
|Publication status||Published - 2005|
|Event||Oceans 2005 - Europe - Brest, France|
Duration: 20 Jun 2005 → 23 Jun 2005
|Conference||Oceans 2005 - Europe|
|Period||20/06/05 → 23/06/05|