By Topic

One dimensional Self-Organizing Maps to optimize marine patrol activities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
V. Lobo ; Portuguese Naval Acad. & Fernando Bacao, ISEGI-UNL, Lisboa, Portugal

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 occurrences of illegal 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 obtains 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.

Published in:

Europe Oceans 2005  (Volume:1 )

Date of Conference:

20-23 June 2005