Maritime Ship Route Optimization Using Hybrid Graph Algorithms
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional maritime route optimization algorithms fail to consider MetOcean conditions and ship performance, resulting in locally optimal routes that do not account for variables like fuel consumption, emissions, and weather, limiting their effectiveness in achieving global optimality.
Innovation Solution
A hybrid routing optimization approach that uses a three-dimensional graph to vary arrival times and speeds, combining Dijkstra's algorithm with a genetic algorithm to search for globally optimal routes that minimize fuel consumption, emissions, and ensure safe passage, while considering ship performance and weather conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional maritime route optimization algorithms (isochrone algorithm, dynamic programming algorithm) are used, then the route can be determined with fixed control variables, but the result is only a locally optimal route that does not achieve global optimality
Solution Approach 1:
The patent applies dynamics by making the arrival time at each waypoint a variable parameter rather than a fixed value. The algorithm dynamically adjusts arrival times within a feasible time window to explore different route options and achieve globally optimal solutions that balance multiple objectives such as fuel consumption, time, and weather conditions.
Solution Approach 2:
The patent introduces a time dimension to the traditional spatial route optimization problem. By creating a three-dimensional search space that includes spatial coordinates (latitude, longitude) and time, the algorithm can explore routes that vary not only in geographical path but also in timing, allowing for globally optimal solutions that conventional two-dimensional algorithms cannot achieve.
2Ease of manufacture
If the arrival time at waypoints is fixed in the optimization algorithm, then the computation is simpler, but the route cannot adapt to varying weather conditions and ship performance requirements
Solution Approach 1:
The algorithm dynamically determines arrival times at each waypoint based on real-time conditions including weather forecasts, ocean currents, wind patterns, and ship performance characteristics. This dynamic approach allows the route to adapt to varying conditions while maintaining computational feasibility through structured search methods.
Solution Approach 2:
The patent changes the parameter of arrival time from a fixed value to a variable within a feasible time window. This parameter change enables the algorithm to explore multiple route options with different timing characteristics, allowing adaptation to weather conditions, ship performance, and operational requirements while maintaining algorithmic tractability.
3Measurement precision
If a three-dimensional graph with variable arrival times is used, then the searching space is increased to find globally optimal routes, but the computational complexity increases
Solution Approach 1:
The algorithm performs preliminary actions by pre-defining a feasible time window for arrival at each waypoint before executing the main optimization search. This preliminary constraint definition reduces the effective search space while maintaining the ability to find globally optimal solutions, balancing computational complexity with optimization thoroughness.
Solution Approach 2:
The patent segments the route optimization problem into discrete waypoints with associated time windows. By dividing the continuous search space into manageable segments (waypoints with feasible arrival time ranges), the algorithm can systematically explore the three-dimensional search space without being overwhelmed by computational complexity, using structured search methods to find globally optimal routes.
Data Source
AI summary
An apparatus for determining an optimal route of a maritime ship includes a database configured to store a service speed of the maritime ship. The apparatus further includes a processor configured to generate a plurality of state nodes, to determine a plurality of time sets, to append the plurality of time sets to the plurality of state nodes to obtain a plurality of appended state nodes, to generate a plurality of edges based on the plurality of appended state nodes, to generate a graph based on the plurality of appended state nodes and the plurality of edges, to apply a preliminarily generated optimal route algorithm on the graph to obtain a preliminarily defined route path, and to apply a genetic algorithm based on the preliminarily defined route path to obtain the optimal route of the maritime ship.