Abstract

The long term prediction of maritime vessels' destinations and arrival times is essential for making an effective logistics planning. As ships are influenced by various factors over a long period of time, the solution cannot be achieved by analyzing sailing patterns of each entity separately. Instead, an approach is required, that can extract maritime patterns for the area in question and represent it in a form suitable for querying all possible routes any vessel in that region can take. To tackle this problem we use a genetic algorithm (GA) to cluster vessel position data obtained from the publicly available Automatic Identification System (AIS). The resulting clusters are treated as route waypoints (WP), and by connecting them we get nodes and edges of a directed graph depicting maritime patterns. Since standard clustering algorithms have difficulties in handling data with varying density, and genetic algorithms are slow when handling large data volumes, in this paper we investigate how to enhance the genetic algorithm to allow fast and accurate waypoint identification. We also include a quad tree structure to preprocess data and reduce the input for the GA. When the route graph is created, we add post processing to remove inconsistencies caused by noise in the AIS data. Finally, we validate the results produced by the GA by comparing resulting patterns with known inland water routes for two Dutch provinces.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call