A route planning method based on genetic algorithm

Through a route planning method based on genetic algorithm, combined with global meteorological data and ship parameters, multi-objective optimization is carried out, which solves the problem of poor route planning results in the existing technology, and achieves safe, feasible, cost-effective route planning.

CN118153791BActive Publication Date: 2024-11-08TIANJIN YUNYAO AEROSPACE TECH CO LTD
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202410579686.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-05-11
Publication Date
2024-11-08
Estimated Expiration
2044-05-11

AI Technical Summary

Technical Problem

The existing route planning algorithms are difficult to meet both ship safety and economic needs when optimizing routes. Especially when considering multiple meteorological factors, it is difficult to find the global optimal solution and the planning effect is not ideal.

Method used

Using a route planning method based on genetic algorithm, the navigation objective function is constructed by collecting global meteorological forecast data, and the genetic algorithm is used to search the optimal route that meets the ship's departure time and planned arrival time. Combining the speed, heading, ship parameters and environmental information, it is carried out. Multi-objective optimization to generate optimal routes.

Benefits of technology

It has achieved the optimal route with smooth navigation trajectory for ocean-going ships while ensuring safety and economy, meeting the goals of fixed arrival time and low fuel consumption, and improving the safety and economic benefits of the route.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118153791B_ABST
    Figure CN118153791B_ABST
Patent Text Reader

Abstract

The present invention provides a route planning method based on genetic algorithm, comprising the following steps: S1, collecting global weather forecast data; S2, constructing a navigation objective function according to the speed and heading, and establishing a navigable area according to the global weather forecast data; S3, searching for the optimal route that meets the departure time and the planned arrival time of the ship through the genetic algorithm. Beneficial effects of the present invention: By utilizing global weather forecast data and genetic algorithms, safe and feasible routes are planned for ocean-going ships. Compared with the current single-objective optimization that cannot meet the current ocean-going navigation of ships, the two objective functions of fixed arrival time and fuel consumption are given through a multi-objective optimization scheme. The ship's yaw angle is considered in the optimization target, and the ship's navigation trajectory is smoother and closer to the actual application of the ship.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of route planning, and in particular relates to a route planning method based on a genetic algorithm. Background Art

[0002] Shipping is an important mode of transportation in the international trade cross-border transportation network. It connects countries around the world and promotes the further integration and development of culture and economy. Meteorological navigation can enable ships to avoid bad weather areas and reduce the damage to the hull caused by wind and waves, thereby significantly reducing accidents caused by weather and sea conditions and ensuring the safety of ships and crew. Through meteorological navigation, ships can take advantage of favorable environments, shorten voyage time, save fuel costs, and reduce costs, thereby improving the economic efficiency of operations. Ship route optimization only requires full consideration of environmental information, the ship's own performance, technical conditions, navigation costs and voyage plans, and also needs to consider the impact of meteorological factors such as wind, waves, ocean currents, and swells on the actual navigation of the ship. How to design a route that meets the optimization needs and is reasonable and feasible under the premise of ensuring safety is the key issue in the current ship route optimization.

[0003] Currently, the commonly used path planning algorithms mainly include the improved isochrone method, dynamic programming method and graph search algorithm. The isochrone method includes the modified isochrone method and the three-dimensional isochrone method. This method has good interpretability, but the optimization effect is not obvious; the dynamic programming method includes the improved dynamic programming method and the three-dimensional dynamic programming method. This method has good dynamic performance, but it is not easy to find the global optimal solution. The graph search algorithm includes the Dijkstra algorithm, but it has high requirements on the heuristic function and requires some idealized conditions to affect the solution accuracy, resulting in unreasonable route planning. Summary of the invention

[0004] In view of this, the present invention aims to propose a route planning method based on genetic algorithm, in order to solve at least one of the above-mentioned technical problems.

[0005] To achieve the above object, the technical solution of the present invention is achieved as follows:

[0006] The first aspect of the present invention provides a route planning method based on a genetic algorithm, characterized in that it comprises the following steps:

[0007] S1. Collect global weather forecast data;

[0008] S2. Construct a navigation objective function based on speed and heading, and establish a navigable area based on global weather forecast data;

[0009] S3. Search for the optimal route that meets the ship's departure time and planned arrival time through a genetic algorithm.

[0010] Further, the S3 comprises the following steps:

[0011] Multiple alternative routes are obtained based on the great circle route or classic route at the starting and ending positions of the route, and the maximum and minimum sailing speeds of the ship itself are used as the speed search interval;

[0012] S31, encoding the coordinates and speed information of the waypoints on all the alternative routes, wherein the coordinates and speed information of a waypoint from the starting point to the end point of each alternative route are used as a gene, the starting point to the end point on the alternative route are used as a chromosome, and the multiple alternative routes are used as an initial population;

[0013] S32, calculating the navigation objective function value of each alternative route according to global weather forecast data, ship parameters, environmental information and navigation objective function, and assigning fitness to each alternative route according to the objective function value;

[0014] S33, calculating the congestion distance of each alternative route according to the navigation objective function and the corresponding boundary solution;

[0015] S34, screening the alternative routes according to the congestion distance, and performing crossover and mutation operations on the screened alternative routes to form a screening population;

[0016] S35. Repeat steps S32 to S34 using the screened population until a backup route that satisfies the fixed arrival time of the route and whose fuel consumption is in a convergent state is calculated as the optimal route.

[0017] Furthermore, in S31, the map is rasterized to generate a raster map with an accuracy of 0.5°×0.5°, and the coordinates of the waypoints on the alternative routes and the speed information are encoded in a real number encoding manner.

[0018] Furthermore, in S32, the navigation objective function value of each chromosome is calculated according to the navigation objective function, all backup routes are sorted in descending order according to the navigation objective function value, and then fitness values ​​are assigned to all backup routes according to the sorting position, and the fitness values ​​of the individuals in the front are low.

[0019] Furthermore, in S34, the individuals to be copied to the offspring population are determined according to the fitness of the individuals in the population. The greater the fitness of the individuals, the greater the probability of being copied to the offspring population. The tournament selection method is used for selection. The specific steps are as follows:

[0020] S341, randomly selecting a plurality of backup routes from the population;

[0021] S342, selecting a backup route according to the fitness value and congestion of the backup route, wherein the greater the fitness value and congestion, the greater the probability of being selected;

[0022] S343. Based on the Sigmoid function, the number of iterations is increased to perform crossover and mutation operations to form a screening population.

[0023] Furthermore, in S2:

[0024] According to the waypoints of the route, the speed ranges of each section before the waypoints, and the sailing direction of the ship, a navigation objective function of the fixed arrival time of the ship route and the fuel consumption of the ship is constructed;

[0025] Establish navigable areas based on prohibited areas of the route;

[0026] Constraints are established based on the maximum speed information of the ship itself.

[0027] Furthermore, in S1, global weather forecast data is collected and the accuracy of the global weather forecast data is unified, and the global weather forecast data includes data on wind, significant wave height, swell, and ocean current.

[0028] A second aspect of the present invention provides an electronic device, comprising a processor and a memory communicatively connected to the processor and used to store instructions executable by the processor, wherein the processor is used to execute the method described in the first aspect above.

[0029] The third aspect of the present invention provides a server, comprising at least one processor, and a memory communicatively connected to the processor, the memory storing instructions executable by the at least one processor, the instructions being executed by the processor so that the at least one processor executes the method described in the first aspect.

[0030] A fourth aspect of the present invention provides a computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method described in the first aspect.

[0031] Compared with the prior art, the route planning method based on genetic algorithm described in the present invention has the following beneficial effects:

[0032] The route planning method based on genetic algorithm described in the present invention plans safe and feasible routes for ocean-going ships by utilizing global weather forecast data and genetic algorithms. Compared with the current single-objective optimization that cannot meet the current ocean-going navigation of ships, a multi-objective optimization scheme is used to provide two objective functions, namely fixed arrival time and fuel consumption. The ship's yaw angle is considered in the optimization objective, and the ship's navigation trajectory is smoother and closer to the actual application of the ship. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] The accompanying drawings constituting a part of the present invention are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the accompanying drawings:

[0034] Figure 1 The figure is a flow chart of a route planning method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0035] It should be noted that, in the absence of conflict, the embodiments of the present invention and the features in the embodiments may be combined with each other.

[0036] The present invention will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0037] Embodiment 1:

[0038] like Figure 1 As shown, a route planning method based on genetic algorithm is characterized by comprising the following steps:

[0039] S1. Collect global weather forecast data;

[0040] S1 collects global weather forecast data and unifies the accuracy of global weather forecast data. The global weather forecast data includes data on wind, significant wave height, swell, and ocean currents.

[0041] S2. Construct a navigation objective function based on speed and heading, and establish a navigable area based on global weather forecast data;

[0042] In S2:

[0043] According to the waypoints of the route, the speed ranges of each section before the waypoints, and the sailing direction of the ship, a navigation objective function of the fixed arrival time of the ship route and the fuel consumption of the ship is constructed;

[0044] Establish navigable areas based on prohibited areas of the route;

[0045] The navigable area Ωa(t) can be expressed as the difference between the static feasible area Ωj and the dynamic weather feasible area Ωw(t) as follows:

[0046] ;

[0047] The constraint condition is established based on the maximum speed information of the ship itself. The formula is as follows:

[0048] , where V i For speed limit.

[0049] S3. Based on the great circle route or classic route of the starting and ending points of the route, multiple alternative routes are obtained, and the maximum and minimum sailing speeds of the ship itself are used as the speed search interval. The optimal route that meets the departure time and planned arrival time of the ship is searched through a genetic algorithm.

[0050] S3 includes the following steps:

[0051] S31, encoding the coordinates and speed information of the waypoints on all the alternative routes, wherein the coordinates and speed information of a waypoint from the starting point to the end point of each alternative route are used as a gene, the starting point to the end point on the alternative route are used as a chromosome, and the multiple alternative routes are used as an initial population;

[0052] In S31, the map is rasterized to generate a 0.5°×0.5° precision raster map, and the waypoint coordinates and speed information on the alternative route are encoded in real number encoding. Compared with traditional binary encoding, by encoding the coordinates and speed of the route in real numbers, the optimization situation after encoding is clearer, and the algorithm can converge faster to obtain the optimal solution.

[0053] Starting point coordinates (lat s ,lon s ) and the end point coordinates (lat e ,lon e ) Calculate the distance Dis and initial heading Azi of the great circle route according to the following formula:

[0054] ;

[0055] ;

[0056] S32, calculating the navigation objective function value of each alternative route according to global weather forecast data, ship parameters, environmental information and navigation objective function, and assigning fitness to each alternative route according to the objective function value;

[0057] The objective function model of fixed ship arrival time is:

[0058] ;

[0059] The objective function model of ship minimum fuel consumption is:

[0060] ;

[0061] Where Feta(t) is the target value of the fixed arrival time function, FQ(t) is the target value of the minimum fuel consumption function, Talarm is the dangerous sailing time, Dturn is the deviation of the ship's sailing direction, Ts is the departure time of the ship, Te is the expected arrival time of the ship, and Q is the fuel consumption of the ship on the entire route.

[0062] ;

[0063] The total fuel consumption of the ship is obtained by summing up the fuel consumption of each section. The fuel consumption of each section is q(v i ) is calculated by the corresponding relationship between the ship speed and the formula, and the cubic fitting function is used to perform curve fitting.

[0064] The dangerous navigation time is obtained by cumulatively adding up the time in the dangerous navigation area and the time in the dangerous navigation speed on the route. During the calculation, it is checked whether each route segment passes through non-navigable areas such as land, shallow waters, and warning areas. The navigation time of the ship in areas exceeding its own wind and wave resistance level is also recorded in the dangerous navigation area time. When a ship is sailing at sea, due to design reasons, there is a maximum navigable speed and a minimum navigable speed range. The navigation time beyond this range is recorded in the dangerous navigation time.

[0065] In S32, the navigation objective function value of each chromosome is calculated according to the navigation objective function, and all backup routes are sorted in descending order according to the navigation objective function value. P is used to represent the objective function value, P=[P1...Pi...Pn], n represents the population size, and then fitness values ​​are assigned to all backup routes according to the sorting position, and the fitness values ​​of individuals in the front are low.

[0066] Fitness i The formula is as follows:

[0067] , where pos i represents the position of the i-th backup route;

[0068] S33, calculating the congestion distance of each alternative route according to the navigation objective function and the corresponding boundary solution;

[0069] In order to obtain a density estimate near a specific solution in the population, the average distance between the solution and the points on both sides can be calculated along the corresponding target. This value is the perimeter of the rectangle formed by the two nearest adjacent points, which is called the crowding distance. The crowding distance needs to be calculated based on the objective function value and the maximum and minimum solutions (boundary solutions) of the corresponding function. After sorting each individual according to the objective function value, the boundary point is assigned a value of ∞ so that it is always selected; the crowding degree CD of the i-th chromosome in the m-th objective function is im The specific calculation formula is:

[0070] ;

[0071] Where Lm represents the mth objective function, Xmax represents the maximum value of all individuals under the mth objective function, and Xmin represents the minimum value of all individuals under the mth objective function.

[0072] S34, screening the alternative routes according to the congestion distance, and performing crossover and mutation operations on the screened alternative routes to form a screening population;

[0073] In S34, the individuals that need to be copied to the offspring population are determined according to the size of the individual fitness in the population. The greater the fitness of the individual, the greater the probability of being copied to the offspring population. The tournament selection method is used for selection. The tournament selection method is not easy to fall into the local optimal solution and is easy to parallelize. The specific steps are as follows:

[0074] S341, first determine the backup route N selected each time; randomly select multiple backup routes N from the population (each individual has the same probability of being selected);

[0075] S342, selecting a backup route according to the fitness value and congestion of the backup route. The larger the fitness value and congestion, the greater the probability of being selected. According to the fitness value and congestion of each individual, the best individual is selected to enter the next generation population;

[0076] Repeat steps S341-S342 until the newly obtained population size reaches the original population size.

[0077] S343. Based on the Sigmoid function, the number of iterations is increased to perform crossover and mutation operations to form a screening population.

[0078] Crossover probability P c and mutation probability P m The formula is as follows:

[0079]

[0080]

[0081] in is the maximum value of the current population, is the average value of the current population, is the value of the individual with the larger fitness function value in the two crossover objects, is the value of the individual to be mutated, , are the maximum and minimum values ​​of the crossover probability, respectively. , are the maximum and minimum values ​​of the mutation probability, respectively. g is the current iteration number, and G is the iteration number of the algorithm.

[0082] S35. Repeat steps S32 to S34 using the screened population until a backup route that satisfies the fixed arrival time of the route and whose fuel consumption is in a convergent state is calculated as the optimal route.

[0083] Through the genetic algorithm, the fuel consumption will converge after continuous iterations, and the backup route with the convergent fuel consumption will be used as the optimal route.

[0084] By utilizing global weather forecast data and genetic algorithms, safe and feasible routes are planned for ocean-going ships. Compared with the current single-objective optimization that cannot meet the current needs of ocean-going ships, a multi-objective optimization solution is used to give two objective functions, fixed arrival time and fuel consumption. The ship's yaw angle is considered in the optimization objectives to make the ship's navigation trajectory smoother and closer to the actual application of the ship.

[0085] The present invention can be combined with electronic chart equipment or ship weather navigation system to be applied to ship weather navigation, and the route planning can be carried out by combining the ship's own data, environmental data, ship navigation requirements and the latest weather forecast data, so as to provide ships with safe and feasible route speed solutions, reduce the situation of ships encountering strong winds and waves, and improve the safety level and economic benefits of the route. In addition, the present invention can timely adjust the route recommendation solution in combination with the latest navigation requirements and weather forecast comparison calculation results, which has more practical application value.

[0086] Embodiment 2:

[0087] An electronic device includes a processor and a memory connected to the processor for storing instructions executable by the processor, wherein the processor is used to execute the method of the first embodiment.

[0088] Embodiment three:

[0089] A server includes at least one processor and a memory connected to the processor in communication, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor so that the at least one processor executes the method of the first embodiment.

[0090] Embodiment 4:

[0091] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method of embodiment 1 is implemented.

[0092] Those of ordinary skill in the art will appreciate that the units and method steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0093] In the several embodiments provided in the present application, it should be understood that the disclosed methods and systems can be implemented in other ways. For example, the division of the units described above is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. The above-mentioned units may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of the present invention.

[0094] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein by equivalents. These modifications or replacements do not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present invention, and they should all be included in the scope of the claims and specification of the present invention.

[0095] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A route planning method based on genetic algorithm, combining the latest navigation needs and weather forecast comparison calculation results to timely adjust the route recommendation plan, characterized in that: For multi-objective optimization, the navigation objective function of the fixed arrival time and the ship's navigation fuel consumption is considered in the optimization process, and the ship's yaw angle is taken into account, including the following steps: S1. Collect global weather forecast data; S2. Construct a navigation objective function based on speed and heading, and establish a navigable area based on global weather forecast data; based on the waypoints of the route, the speed range of each section before the waypoints, and the navigation direction of the ship; Establish navigable areas based on prohibited areas of the route; Establish constraint conditions based on the maximum navigable speed information of the ship itself; S3, obtaining multiple alternative routes based on the great circle route or classic route at the starting and ending positions of the route, using the maximum and minimum sailing speeds of the ship itself as the speed search interval, and searching for the optimal route that meets the departure time and planned arrival time of the ship through a genetic algorithm; The specific steps of S3 include: S31, encoding the coordinates and speed information of the waypoints on all the alternative routes, wherein the coordinates and speed information of a waypoint from the starting point to the end point of each alternative route are used as a gene, the starting point to the end point on the alternative route are used as a chromosome, and the multiple alternative routes are used as an initial population; S32, calculating the navigation objective function value of each alternative route according to global weather forecast data, ship parameters, environmental information and navigation objective function, and assigning fitness to each alternative route according to the objective function value; S33, calculating the congestion distance of each alternative route according to the navigation objective function and the corresponding boundary solution; In step S31, the map is rasterized to generate a 0.5°×0.5° precision raster map, and the waypoint coordinates and speed information on the alternative route are encoded in a real number encoding manner. Compared with the traditional binary encoding, the real number encoding of the coordinates and speed of the route makes the optimization situation clearer after encoding, and the algorithm can converge faster to obtain the optimal solution; Starting point coordinates (lat s ,lon s ) and the end point coordinates (lat e ,lon e ) Calculate the distance Dis and initial heading Azi of the great circle route according to the following formula: Dis=2r*arcsin(sqrt(sin 2 ((years e -years s ) / 2)+cos(lat s )*something(years e )*son 2 ((lon e -lon s ) / 2))); Azi=arctan(cos(lat e )*sin(lon e -can s ) / (cos(lat s )*sin(lat e )-sin(lat s )*cos(lat e )*cos(lon e -can s ))); S32, calculating the navigation objective function value of each alternative route according to global weather forecast data, ship parameters, environmental information and navigation objective function, and assigning fitness to each alternative route according to the objective function value; The objective function model of fixed ship arrival time is: The objective function model of ship minimum fuel consumption is: Where Feta(t) is the target value of the fixed arrival time function, FQ(t) is the target value of the minimum fuel consumption function, Talarm is the dangerous sailing time, Dturn is the deviation of the ship's sailing direction, Ts is the departure time of the ship, Te is the expected arrival time of the ship, and Q is the fuel consumption of the ship on the entire route; The total fuel consumption of the ship is obtained by summing up the fuel consumption of each section. The fuel consumption of each section is q(v i ) is calculated by the corresponding relationship between the ship speed and the formula, and the cubic fitting function is used to perform curve fitting; The dangerous navigation time is obtained by accumulating the time in the dangerous navigation area and the time at the dangerous navigation speed on the route. During the calculation, it is checked whether each route section passes through non-navigable areas such as land, shoal waters, and warning areas. The navigation time of the ship in the area exceeding its own wind and wave resistance level is also recorded in the dangerous navigation area time; when a ship is sailing at sea, due to design reasons, there is a maximum navigable speed and a minimum navigable speed range, and the navigation time beyond this range is recorded in the dangerous navigation time; In S32, the navigation objective function value of each chromosome is calculated according to the navigation objective function, and all backup routes are sorted in descending order according to the navigation objective function value, and P is used to represent the objective function value, P = [P1...Pi...Pn], n represents the population size, and then fitness values ​​are assigned to all backup routes according to the sorting position, and the fitness value of the individuals in the front is low; Fitness i The formula is as follows: Among them, pos i represents the position of the i-th backup route; S33, calculating the congestion distance of each alternative route according to the navigation objective function and the corresponding boundary solution; In order to obtain a density estimate near a specific solution in the population, the average distance between the solution and the points on both sides can be calculated along the corresponding target. This value is the perimeter of the rectangle formed by the two nearest adjacent points, which is called the crowding distance. The crowding distance needs to be calculated based on the objective function value and the maximum and minimum solutions of the corresponding function. After sorting each individual according to the objective function value, the boundary point is assigned to ∞ so that it is always selected. The crowding degree CD of the i-th chromosome in the m-th objective function is im The specific calculation formula is: Where Lm represents the mth objective function, Xmax represents the maximum value of all individuals under the mth objective function, and Xmin represents the minimum value of all individuals under the mth objective function; S34, screening the alternative routes according to the congestion distance, and performing crossover and mutation operations on the screened alternative routes to form a screening population; In S34, the individuals that need to be copied to the offspring population are determined according to the size of the individual fitness in the population. The greater the fitness of the individual, the greater the probability of being copied to the offspring population. The tournament selection method is used for selection. The tournament selection method is not easy to fall into the local optimal solution and is easy to parallelize. The specific steps are as follows: S341, first determine the backup route N selected each time; randomly select multiple backup routes N from the population, and the probability of each individual being selected is the same; S342, selecting a backup route according to the fitness value and congestion of the backup route. The larger the fitness value and congestion, the greater the probability of being selected. According to the fitness value and congestion of each individual, the best individual is selected to enter the next generation population; Repeat steps S341-S342 until the newly obtained population size reaches the original population size; S343, based on the Sigmoid function, the number of iterations is increased to perform crossover and mutation operations to form a screening population; Crossover probability P c and mutation probability P m The formula is as follows: where f max is the maximum value of the current population, f avg is the average value of the current population, f' is the value of the individual with the larger fitness function value in the two crossover objects, f is the value of the individual to be mutated, P cmax , P cmin are the maximum and minimum values ​​of the crossover probability, P mmax , P mmin分别为 The maximum and minimum values ​​of the mutation probability, g is the current iteration number, and G is the number of iterations of the algorithm; S35. Repeat steps S32 to S34 using the screened population until a backup route that satisfies the fixed arrival time of the route and whose fuel consumption is in a convergent state is calculated as the optimal route.

2. The route planning method based on genetic algorithm according to claim 1, characterized in that: In S1, global weather forecast data is collected and the accuracy of the global weather forecast data is unified. The global weather forecast data includes data on wind, significant wave height, swell, and ocean current.

3. An electronic device, comprising a processor and a memory connected to the processor for storing instructions executable by the processor, characterized in that: The processor is used to execute the method described in any one of claims 1-2.

4. A server, characterized in that: It includes at least one processor and a memory communicatively connected to the processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor so that the at least one processor executes the method according to any one of claims 1-2.

5. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 2 is implemented.

Citation Information

Cited By

  • Ocean airway dynamic planning method based on climate-meteorological data collaboration

    CN121526473A

  • A method for dynamic planning of ocean route based on climate-meteorological data cooperation

    CN121526473B