A method and system for comprehensive planning of ship transportation based on genetic algorithm

Through the comprehensive planning method of ship transportation based on genetic algorithms, unified loading planning and route planning have been solved, and the problem of failure to effectively reduce transportation costs in the existing technology has been achieved, and the unified full-cycle planning and economic benefits have been improved.

CN119273193BActive Publication Date: 2025-03-14THE 28TH RES INST OF CHINA ELECTRONICS TECH GROUP CORP
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411815191.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-12-11
Publication Date
2025-03-14
Estimated Expiration
2044-12-11

AI Technical Summary

Technical Problem

The existing technology fails to unify the loading planning of ship transportation and the transportation route planning, resulting in the inability to effectively reduce transportation costs and improve economic benefits.

Method used

Using a genetic algorithm-based method, a comprehensive planning model for ship transportation is constructed, combined with loading planning and route planning, objective functions and constraints are set, and the solution is obtained through genetic algorithm to obtain the optimal solution.

Benefits of technology

It has achieved the unification of the full-cycle planning of ship transportation, effectively reduced transportation costs, improved economic benefits, and applied to the differences in different transportation tasks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119273193B_ABST
    Figure CN119273193B_ABST
Patent Text Reader

Abstract

The invention discloses a ship transportation comprehensive planning method and system based on genetic algorithm, including setting initial conditions, taking the minimum amount of cargo loading and unloading as the objective function, and constructing a ship transportation loading planning model with the constraint conditions of ensuring that all initial cargo is loaded on board, ensuring that all cargo to be loaded is loaded on board, and ensuring that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack; setting initial conditions, taking the minimum total voyage fuel consumption of the ship transportation route as the objective function, and constructing a ship transportation route planning model with the constraint conditions of meeting the transportation time requirements and meeting the safe speed of ship transportation; combining the ship transportation loading planning model and the ship transportation route planning model to jointly construct a ship transportation comprehensive planning model, and establish a ship transportation comprehensive planning model; solving the ship transportation comprehensive planning model based on the genetic algorithm, and finally forming the optimal solution for ship transportation comprehensive planning. The invention can reduce the cost of ship transportation.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of ship transportation planning, and in particular to a ship transportation comprehensive planning method and system based on genetic algorithm. Background Art

[0002] The development of ship transportation has become the most important form of international trade cargo transportation due to its long transportation distance, large transportation volume and low transportation cost. However, in recent years, with the gradual increase in shipping-related costs, the cost of ship transportation has directly increased.

[0003] The existing technology for studying the problem of ship transport loading mainly focuses on using random simulation methods, heuristic algorithms, decision support systems, mathematical programming models, etc. to assist in completing loading plan planning; the focus of domestic and foreign research on transportation route optimization is on studying the optimization of roads and railways, and there is relatively little research on the problem of ship transport route optimization.

[0004] At present, the research on ship transportation planning at home and abroad focuses more on ship loading planning, but does not unify loading planning and transportation route planning. As a result, the relevant research content does not fully cover the full cycle planning of ship transportation, and has limited effects on the optimization of ship transportation costs and the improvement of the collaboration capabilities between the entire route and various transportation destinations. It cannot meet the actual needs of reducing transportation costs and improving economic benefits. Summary of the invention

[0005] Purpose of the invention: The first purpose of the present invention is to provide a method for comprehensive planning of ship transportation based on genetic algorithm, so as to solve the problem that ship transportation planning does not unify loading planning and transportation route planning, thereby reducing ship transportation costs and improving economic benefits.

[0006] The second object of the present invention is to provide a comprehensive planning system for ship transportation based on genetic algorithm.

[0007] Technical solution: To achieve the above objectives, the present invention discloses a method for comprehensive planning of ship transportation based on genetic algorithm, comprising the following steps:

[0008] (1) The initial conditions of the ship transport stowage planning model are set, and the minimum amount of cargo loading and unloading is taken as the objective function. The ship transport stowage planning model is constructed with the constraints of ensuring that all the initial cargo is loaded on board, ensuring that all the cargo to be loaded is loaded on board, and ensuring that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack. The initial conditions include the known information of the cargo to be loaded, the known information of the loaded cargo, the known ship space information, the ship space layout description method and the cargo grouping principle.

[0009] (2) Setting the initial conditions of the ship transport route planning model, taking the minimum total fuel consumption of the ship transport route as the objective function, and satisfying the transportation time requirements and the safe speed of the ship transport as the constraints to construct the ship transport route planning model; the initial conditions include the known locations of the departure and destination, the known navigation environment information, the known relationship between the speed and fuel consumption, and the discretization of the navigation area between the departure and destination;

[0010] (3) Combine the ship transport stowage planning model and the ship transport route planning model to jointly construct a ship transport comprehensive planning model, set the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the ship's current transport task, and assign weight values ​​for the loading and unloading volume and fuel consumption. The ship transport comprehensive planning model is established with the minimum loading and unloading volume and the minimum fuel consumption of the ship transport route as the planning objectives;

[0011] (4) Based on the genetic algorithm, the model of integrated planning of shipping transportation is solved. The solution steps are divided into problem coding, initial solution setting, genetic operation design, and fitness function setting, and finally the optimal solution for integrated planning of shipping transportation is formed.

[0012] Optionally, in step (1), the known information of the cargo to be loaded means that the size, weight, type, quantity and destination information of the loaded cargo are known, and the known ship space information means that when the ship is not loaded with cargo or after unloading at the destination, the layout and capacity of the space available for loading cargo are known; the ship space layout description method adopts the container ship space description method, that is, the three-dimensional coordinate system of the ship space is represented by shells, stacks and layers; the cargo grouping principle is determined, that is, cargoes with the same destination can be grouped together, and cargoes with a quantity not exceeding N can be grouped together, where N is set according to the number of vacancies in each stack; and the weight of cargoes in the same group is evenly distributed.

[0013] Optionally, in step (1), an objective function is established to ensure that the amount of cargo loaded and unloaded by the ship is minimized.

[0014] ,

[0015] The amount of cargo that can be loaded and unloaded for ships. Indicates the cargo dumping caused by the change of the initial cargo position. The calculation process is to determine whether the initial cargo position has changed after loading. If it has changed, it will cause cargo dumping. The cargo dumping amount is multiplied by the quantity of the group of cargo.

[0016] ,

[0017] It means that when the ship arrives at the next destination to unload, the cargo inside the stack is pressed and causes cargo to be dumped. The calculation process is to find a stack that is loaded with cargo to be unloaded at more than two destinations at the same time, and judge whether it will cause cargo to be dumped when unloading at the next destination. If it does cause cargo to be dumped, the amount of cargo dumped is the amount of cargo that is not unloaded at the next destination and blocks the unloading operation;

[0018] ,

[0019] For the destination The number of cargo groups to be loaded, is the total number of destinations, is the total number of ship cabin spaces, For the original loading stack and the destination is The quantity of initial goods, For the destination No. The number of grouped goods, The value 1 indicates that the original stack and the destination is The initial cargo was loaded on In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates that the destination is No. The group of goods to be loaded was loaded in the In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates the The stack is loaded with different packets, and the packets that do not need to be unloaded at the next destination are pressed on the packets to be unloaded. 0 represents the value that does not meet the condition of value 1;

[0020] Create constraints:

[0021] Ship transport stowage planning needs to ensure that all initial cargo is loaded on board:

[0022] ,

[0023] For the destination The initial quantity of goods,

[0024] Ship transport stowage planning must ensure that all cargo to be loaded is loaded on board:

[0025] ,

[0026] For the destination The quantity of cargo to be loaded,

[0027] Ship transport stowage planning must ensure that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack:

[0028] ,

[0029] For the The maximum number of items that can be loaded into a stack.

[0030] Optionally, in step (2), the known locations of the departure place and the destination refer to that the longitude and latitude information of the departure place and the destination of the ship transportation are determined, the known navigation environment information refer to that the air conditions and ocean conditions during the ship transportation are determined, the known relationship between the speed and the fuel consumption refer to that the corresponding relationship between the still water speed of the ship and the fuel consumption per nautical mile is known, and the navigation sea area between the departure place and the destination has been discretized refer to that the entire route is divided into 1,2…m route segments, each route segment is also discretized into 1,2…n route points, and the distance between each route point is a constant.

[0031] Optionally, in step (2), an objective function is established to ensure that the total fuel consumption of the shipping route is minimized.

[0032] ,

[0033] It indicates the cumulative fuel consumption of the ship from the departure point to the destination. is the total number of destinations, is the number of route segments after discretization of the navigation area between the departure and destination, is the number of route points of a route segment after the navigation area between the departure and destination is discretized. To indicate the The route point state variable indicates the route point where the ship is currently located; To indicate the Ship heading at waypoint, To indicate the Vessel speed at route point, To indicate the Vessels at waypoints take heading and speed Fuel consumption under To indicate the Route segment Vessels at waypoints take heading and speed Fuel consumption under

[0034] Establish constraints: The ship sails from the departure point to the destination The transportation time requirements must be met:

[0035] ,

[0036] To represent the distance between discrete route points, To indicate that the destination is Vessel transportation time requirements;

[0037] The ship's speed at all route points meets the safe speed for ship transportation:

[0038] ,

[0039] To indicate the safe speed in ship transportation.

[0040] Optionally, the establishment of the ship transport comprehensive planning model in step (3) needs to initially set the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the current transport task according to different transport tasks, and at the same time allocate weight values ​​of the loading and unloading volume and fuel consumption;

[0041] ,

[0042] To indicate the maximum allowable loading and unloading volume set in the current ship transportation plan, To indicate the maximum allowable fuel consumption set in the current ship transportation plan, To represent the weight value of loading and unloading volume in the current ship transportation planning, It represents the weight value of fuel consumption in the current ship transportation planning.

[0043] Optionally, the problem coding in step (4) refers to determining the coding method of the ship transport stowage planning and ship transport route planning problems, wherein the ship transport stowage planning refers to the generation of each bay matrix by real number coding of the ship transport stowage problem, where a space without cargo is represented by -1, and a space with cargo but not loaded is represented by 0; there are G ship transport destinations in total, and 1 represents the next docking destination; the ship transport route planning refers to the number of route segments after the discrete processing of the sailing sea area between the departure place and the destination, and the number of route points in a certain route segment after the discrete processing of the sailing sea area between the departure place and the destination is n.

[0044] Optionally, the initial solution setting in step (4) refers to the initial solutions of the ship transport stowage planning and the ship transport route planning that are designed and determined respectively. The initial solution setting of the ship transport stowage planning is based on the stack numbering, initial cargo grouping, cargo stack selection and stack specific location allocation; the initial solution setting of the ship transport route planning is based on the sea area discrete processing, initial setting of the speed, speed and transportation time verification and total fuel consumption calculation.

[0045] Optionally, the genetic operation design in step (4) includes crossover operation and mutation operation of ship transport stowage planning. During the crossover and operation process, if the destination allocation changes, the ship transport route planning needs to re-discrete the navigation area and complete the calculation of the total fuel consumption of the ship transport; the fitness function setting refers to setting the objective function of the comprehensive planning of ship transport, introducing the maximum allowable loading and unloading volume and the maximum allowable fuel consumption and their corresponding weight values, and performing iterative calculations by setting convergence requirements to obtain the optimal solution for the comprehensive planning of ship transport.

[0046] Based on the same inventive concept, the present invention discloses a ship transportation integrated planning system based on genetic algorithm, comprising:

[0047] The ship transport stowage planning model construction module is used to set the initial conditions of the ship transport stowage planning model, take the minimum amount of cargo loading and unloading as the objective function, and ensure that all the initial cargo is loaded on the ship, that all the cargo to be loaded is loaded on the ship, and that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack as the constraint conditions to build the ship transport stowage planning model; the initial conditions include the known information of the cargo to be loaded, the known information of the loaded cargo, the known ship space information, the ship space layout description method and the cargo grouping principle;

[0048] The ship transport route planning model building module is used to set the initial conditions of the ship transport route planning model, taking the minimum total fuel consumption of the ship transport route as the objective function, and building the ship transport route planning model with the requirements of transportation time and the safe speed of ship transport as the constraints; the initial conditions include the known locations of the departure and destination, the known navigation environment information, the known relationship between the speed and fuel consumption, and the navigation area between the departure and destination has been discretized;

[0049] The ship transport comprehensive planning model construction module is used to jointly construct a ship transport comprehensive planning model by combining the ship transport stowage planning model and the ship transport route planning model, setting the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the ship's current transport task, and at the same time allocating weight values ​​for the loading and unloading volume and fuel consumption, and establishing a ship transport comprehensive planning model with the minimum ship loading and unloading volume and the lowest fuel consumption of the ship transport route as the planning objectives;

[0050] The optimal solution solving module is used to solve the integrated planning model of shipping transportation based on genetic algorithms. The solution steps are divided into problem coding, initial solution setting, genetic operation design, and fitness function setting, and finally the optimal solution for integrated planning of shipping transportation is formed.

[0051] Beneficial effects: Compared with the prior art, the present invention has the following significant advantages: the present invention comprehensively coordinates the loading planning and the transport route planning in the ship transport planning method, covers the whole cycle of ship transport, can effectively reduce the transport cost and improve the economic benefits; the planning method of the present invention takes into account the differences between different transport tasks of ships, sets the maximum allowable loading and unloading volume and the maximum allowable fuel consumption as well as the corresponding weight values ​​of the transport tasks, and based on the wide applicability of genetic algorithms and the advantages of excellent global search capability and parallel computing capability, adopts genetic algorithms to solve the optimal solution, which can meet the planning requirements of different transport tasks. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 is a flow chart of the present invention;

[0053] Figure 2 It is a schematic diagram of the variation operation in the present invention;

[0054] Figure 3 It is a schematic diagram of the cross operation in the present invention;

[0055] Figure 4 This is a block diagram of the module structure in the present invention. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0057] Example 1: Figure 1 As shown, a ship transportation comprehensive planning method based on genetic algorithm includes the following steps:

[0058] (1) Construct a ship transport stowage planning model. As the primary link in the entire ship transport process, the rationality of ship transport stowage planning is crucial to improving the efficiency of cargo loading and unloading operations and enhancing the economic benefits of ship transport. The goal of ship transport stowage planning is to fully utilize the ship's space capacity and avoid or reduce the amount of cargo dumping during loading and unloading on the basis of meeting the cargo loading needs of ship transport.

[0059] In step (1), the initial conditions of the ship transport stowage planning model are set, including the known information of the cargo to be loaded, the known information of the loaded cargo, the known ship space information, the ship space layout description method and the cargo grouping principle; the ship transport stowage planning model is constructed with the minimum cargo loading and unloading volume as the objective function and the constraints of ensuring that all the initial cargo is loaded on board, ensuring that all the cargo to be loaded is loaded on board, and ensuring that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack;

[0060] (1.1) Initial conditions:

[0061] The information of the cargo to be loaded is known, that is, the size, weight, type, quantity and destination of the cargo to be loaded are known;

[0062] The information of the loaded cargo is known, i.e. the size, weight, type, quantity and destination of the loaded cargo are known;

[0063] The ship's cargo space information is known, that is, when the ship is not loaded with cargo or has arrived at the destination and unloaded, the cargo space layout and capacity information available for the ship to load cargo are known;

[0064] Since container ships are mainly used for modern shipping logistics transportation, the ship space layout description method of the present invention adopts the container ship space description method, that is, using shells, stacks, and layers to represent the three-dimensional coordinate system of ship space;

[0065] Cargo grouping principle: cargo with the same destination can be grouped together, cargo with a quantity not exceeding N can be grouped together, N is set according to the number of empty spaces in each stack, and cargo weight in the same group is evenly distributed;

[0066] (1.2) Model establishment

[0067] Establish an objective function to ensure that the amount of cargo loaded and unloaded by the ship is minimized.

[0068] ,

[0069] The amount of cargo loaded and unloaded by the ship, Indicates the cargo dumping caused by the change of the initial cargo position. The calculation process is to determine whether the initial cargo position has changed after loading. If it has changed, it will cause cargo dumping. The cargo dumping amount is multiplied by the quantity of the group of cargo.

[0070] ,

[0071] It means that when the ship arrives at the next destination to unload, the cargo inside the stack is pressed and causes cargo to be dumped. The calculation process is to find a stack that is loaded with cargo to be unloaded at more than two destinations at the same time, and judge whether it will cause cargo to be dumped when unloading at the next destination. If it does cause cargo to be dumped, the amount of cargo dumped is the amount of cargo that is not unloaded at the next destination and blocks the unloading operation;

[0072] ,

[0073] For the destination The number of cargo groups to be loaded, is the total number of destinations, is the total number of ship cabin spaces, For the original loading stack and the destination is The quantity of initial goods, For the destination No. The number of grouped goods, The value 1 indicates that the original stack and the destination is The initial cargo was loaded on In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates that the destination is No. The group of goods to be loaded was loaded in the In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates the The stack is loaded with different packets, and the packets that do not need to be unloaded at the next destination are pressed on the packets to be unloaded. 0 represents the value that does not meet the condition of value 1;

[0074] Create constraints:

[0075] Ship transport stowage planning needs to ensure that all initial cargo is loaded on board:

[0076] ,

[0077] For the destination The initial quantity of goods,

[0078] Ship transport stowage planning must ensure that all cargo to be loaded is loaded on board:

[0079] ,

[0080] For the destination The quantity of cargo to be loaded,

[0081] Ship transport stowage planning must ensure that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack:

[0082] ,

[0083] For the The maximum number of items that can be loaded into a stack.

[0084] (2) Construct a ship transport route planning model;

[0085] In step (2), the initial conditions of the ship transport route planning model are set, including the known locations of the departure and destination, the known navigation environment information, the known relationship between the speed and fuel consumption, and the discretization of the navigation area between the departure and destination; the ship transport route planning model is constructed with the minimum total fuel consumption of the ship transport route as the objective function, and the constraints of meeting the transportation time requirements and meeting the safe speed of the ship transport. The ship transport route cost is an important part of the ship transport cost. The goal of carrying out ship transport route planning is to fully consider the impact of the navigation environment on the ship's navigation, plan and select the route with the least fuel consumption, so as to save fuel consumption and reduce transportation costs.

[0086] (2.1) Initial condition setting

[0087] The locations of the departure and destination are known, that is, the longitude and latitude information of the departure and destination of the ship transportation are determined;

[0088] The navigation environment information is known, that is, the air conditions and ocean conditions during ship transportation are certain;

[0089] The relationship between speed and fuel consumption is known, that is, the corresponding relationship between the ship's still water speed and fuel consumption per nautical mile is known;

[0090] The navigation area between the departure point and the destination has been discretized, that is, the entire route is divided into 1,2...m route segments, each route segment is also discretized into 1,2...n route points, and the distance between each route point is a fixed value;

[0091] (2.2) Model establishment

[0092] Establish an objective function to ensure that the total fuel consumption of the ship transport route is minimized.

[0093] ,

[0094] It indicates the cumulative fuel consumption of the ship from the departure point to the destination. is the total number of destinations, is the number of route segments after discretization of the navigation area between the departure and destination, is the number of route points of a route segment after the navigation area between the departure and destination is discretized. To indicate the The route point state variable indicates the route point where the ship is currently located; To indicate the Ship heading at waypoint, To indicate the Vessel speed at route point, To indicate the Vessels at waypoints take heading and speed Fuel consumption under To indicate the Route segment Vessels at waypoints take heading and speed Fuel consumption under

[0095] Establish constraints: The ship sails from the departure point to the destination Transportation time requirements must be met:

[0096] ,

[0097] To represent the distance between discrete route points, To indicate that the destination is Vessel transportation time requirements;

[0098] The ship's speed at all route points meets the safe speed for ship transportation:

[0099] ,

[0100] To indicate the safe speed in ship transportation.

[0101] (3) Combine the ship transport stowage planning model and the ship transport route planning model to jointly construct a comprehensive ship transport planning model;

[0102] In step (3), the maximum allowable cargo loading and unloading volume and the maximum allowable fuel consumption of the current transport task of the ship are set, and the weight values ​​of the cargo loading and unloading volume and the fuel consumption are assigned. The comprehensive planning model of ship transportation is established with the minimum cargo loading and unloading volume and the minimum fuel consumption of the ship transportation route as the planning objectives;

[0103] (3.1) Model establishment

[0104] The establishment of the ship transport comprehensive planning model requires the initial setting of the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the current transport task according to different transport tasks, and the allocation of weight values ​​for loading and unloading volume and fuel consumption;

[0105] ,

[0106] To indicate the maximum allowable loading and unloading volume set in the current ship transportation plan, To indicate the maximum allowable fuel consumption set in the current ship transportation plan, To represent the weight value of loading and unloading volume in the current ship transportation planning, It represents the weight value of fuel consumption in the current ship transportation planning.

[0107] (4) Solving the integrated planning model of shipping transportation based on genetic algorithms, dividing the solving steps into problem coding, initial solution setting, genetic operation design, and fitness function setting, ultimately forming the optimal solution for integrated planning of shipping transportation;

[0108] (4.1) Problem coding: The coding method for ship transport stowage planning and ship transport route planning problems was determined.

[0109] (4.1.1) Ship transport loading planning: The ship loading problem uses real number coding to generate each bay matrix. A space without cargo is represented by -1, and a space that is available but not loaded is represented by 0. There are G ship transport destinations in total, and 1 represents the next destination.

[0110] (4.1.2) Ship transport route planning: After the navigation area between the departure place and the destination is discretized, the number of route segments is m, and the number of route points of a route segment after the navigation area between the departure place and the destination is discretized is n;

[0111] (4.2) Initial solution setting: The initial solutions of ship transport stowage planning and ship transport route planning are designed and determined respectively. The initial solution of ship transport stowage planning is set according to the stack number, initial cargo grouping, cargo stack selection and stack specific location allocation; the initial solution of ship transport route planning is set according to the sea area discrete processing, initial setting speed, speed and transportation time verification and total fuel consumption calculation;

[0112] (4.2.1) Ship transport loading planning

[0113] 1) Stack numbering: The stacks are numbered in the usual way from bow to stern and from port to starboard, which is convenient for the subsequent description and identification of the stacks;

[0114] 2) Group the initial cargo according to the cargo grouping principle and record the minimum destination number of each stack position in the initial state;

[0115] 3) In the initial state, stacking locations are allocated to each group of goods in the order of destination from far to near. A stacking location is randomly selected. If the number of goods in the group is less than or equal to the number of empty stacking locations, and the destination number of the group of goods is less than or equal to the minimum destination number of the goods already loaded in the stacking location, the stacking location is selected as the loading location for this group of goods. Otherwise, a new stacking location is selected for allocation.

[0116] 4) After each group of cargo is assigned a stacking location, the cargo in each group is assigned a specific location of the stacking location, which serves as the initial solution for the ship transport stowage planning;

[0117] (4.2.2) Ship transport route planning

[0118] According to the order of destination allocation in the initial state of the ship transport loading plan, the navigation area is discretized into m route segments, and each route segment is discretized into n route points; the ship speed is initially set to check whether the set speed meets the safe speed of ship transport, if not, it is reset; the navigation time between route points is calculated according to the distance and speed between route points, and the total navigation time of all segments is accumulated to see whether it meets the transportation time requirements, if not, the initial speed is reset; the fuel consumption between route points is calculated according to the ship's still water speed and unit nautical mile fuel consumption, and the total fuel consumption of ship transport is accumulated as the initial solution of ship transport navigation planning;

[0119] (4.3) Genetic operation design: including crossover and mutation operations of ship transport stowage planning. During the crossover and mutation process, if the destination allocation changes, the ship transport route planning needs to re-discrete the navigation area and complete the calculation of the total fuel consumption of the ship transport;

[0120] 1) Cross

[0121] like Figure 2 As shown, a destination number is randomly generated, and the cargo group with the destination in the loading sequence is found among all cargo groups. Two different cargo groups are randomly selected from them, and the size of the cargo quantity in the two cargo groups is determined. The smaller one is selected for crossover operation.

[0122] 2) Mutation

[0123] like Figure 3As shown, a destination number is randomly generated, the cargo group and stack position of the destination are selected in the loading sequence, and then the empty positions after loading according to the loading sequence are calculated, and the stacks with the number of empty positions ≥ 2 are found, and one is selected as one of the variants of the cargo group; a different cargo group is randomly selected from the selected cargo group set, and the number of its cargo group is counted and compared with the number of empty positions of the stack position where the cargo group is located for the first time, and the smaller one is used as the variant number;

[0124] During the crossover and mutation operations, if the destination allocation changes, it is necessary to re-discrete the navigation area and complete the calculation of the total fuel consumption of the ship transportation;

[0125] (4.4) Fitness function setting: According to the objective function setting of the integrated shipping planning, the maximum allowable cargo loading and unloading volume and the maximum allowable fuel consumption and their corresponding weight values ​​are introduced, and the optimal solution of the integrated shipping planning is obtained by iterative calculation by setting the convergence requirements;

[0126] The objective functions of the ship transportation comprehensive planning model are the ship loading and unloading volume and the fuel consumption of the ship transportation route. Considering the differences between different transportation tasks of ships, the maximum allowable loading and unloading volume and the maximum allowable fuel consumption and their corresponding weight values ​​are introduced when constructing the model.

[0127] In the process of genetic operations, namely crossover and mutation, by setting convergence requirements for iterative calculations, the objective function value continuously approaches the minimum value, and the optimal solution for the comprehensive planning of ship transportation can be obtained. Setting the convergence requirement means that the fuel consumption of the ship transportation route is the lowest.

[0128] Embodiment 2: The present invention discloses a ship transportation integrated planning system based on genetic algorithm, comprising:

[0129] The ship transport stowage planning model construction module is used to set the initial conditions of the ship transport stowage planning model, take the minimum amount of cargo loading and unloading as the objective function, and ensure that all the initial cargo is loaded on the ship, that all the cargo to be loaded is loaded on the ship, and that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack as the constraint conditions to build the ship transport stowage planning model; the initial conditions include the known information of the cargo to be loaded, the known information of the loaded cargo, the known ship space information, the ship space layout description method and the cargo grouping principle;

[0130] The initial condition in the ship transport stowage planning model construction module refers to the known information of the cargo to be loaded, that is, the size, weight, type, quantity and destination information of the cargo to be loaded are known; the loaded cargo information is known, that is, the size, weight, type, quantity and destination information of the loaded cargo are known; the ship's space information is known, that is, when the ship is not loaded with cargo or after unloading at the destination, the layout and capacity information of the space available for loading cargo on the ship are known; because container ships are mainly used for modern shipping logistics transportation, the ship's space layout description method of the present invention adopts the container ship's box space description method, that is, using shells, stacks, and layers to represent the three-dimensional coordinate system of the ship's space; the cargo grouping principle is determined: the same destination can be grouped together, the cargo quantity does not exceed N can be grouped together, N is set according to the number of vacancies in each stack, and the weight of the cargo in the same group is evenly distributed;

[0131] Establish an objective function to ensure that the amount of cargo loaded and unloaded by the ship is minimized.

[0132] ,

[0133] The amount of cargo that can be loaded and unloaded for ships. Indicates the cargo dumping caused by the change of the initial cargo position. The calculation process is to determine whether the initial cargo position has changed after loading. If it has changed, it will cause cargo dumping. The cargo dumping amount is multiplied by the quantity of the group of cargo.

[0134] ,

[0135] It means that when the ship arrives at the next destination to unload, the cargo inside the stack is pressed and causes cargo to be dumped. The calculation process is to find a stack that is loaded with cargo to be unloaded at more than two destinations at the same time, and judge whether it will cause cargo to be dumped when unloading at the next destination. If it does cause cargo to be dumped, the amount of cargo dumped is the amount of cargo that is not unloaded at the next destination and blocks the unloading operation;

[0136] ,

[0137] For the destination The number of cargo groups to be loaded, is the total number of destinations, is the total number of ship cabin spaces, For the original loading stack and the destination is The quantity of initial goods, For the destination No. The number of grouped goods, The value 1 indicates that the original stack and the destination is The initial cargo was loaded on In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates that the destination is No. The group of goods to be loaded was loaded in the In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates the The stack is loaded with different packets, and the packets that do not need to be unloaded at the next destination are pressed on the packets to be unloaded. 0 represents the value that does not meet the condition of value 1;

[0138] Create constraints:

[0139] Ship transport stowage planning needs to ensure that all initial cargo is loaded on board:

[0140] ,

[0141] For the destination The initial quantity of goods,

[0142] Ship transport stowage planning must ensure that all cargo to be loaded is loaded on board:

[0143] ,

[0144] For the destination The quantity of cargo to be loaded,

[0145] Ship transport stowage planning must ensure that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack:

[0146] ,

[0147] For the The maximum number of items that can be loaded into a stack.

[0148] The ship transport route planning model construction module is used to set the initial conditions of the ship transport route planning model, take the minimum total fuel consumption of the ship transport route as the objective function, and construct the ship transport route planning model with the transportation time requirement and the ship transport safety speed as the constraint conditions; the initial conditions include the known locations of the departure and destination, the known navigation environment information, the known relationship between the speed and fuel consumption, and the navigation area between the departure and destination has been discretized; the ship transport route cost is an important part of the ship transportation cost. The goal of ship transport route planning is to fully consider the impact of the navigation environment on the ship's navigation, plan and select the route with the least fuel consumption, so as to save fuel consumption and reduce transportation costs.

[0149] The initial condition setting in the ship transport route planning model building module means that the locations of the departure and destination are known, that is, the longitude and latitude information of the departure and destination of the ship transport is determined; the navigation environment information is known, that is, the air conditions and ocean conditions during the ship transport process are determined; the relationship between speed and fuel consumption is known, that is, the corresponding relationship between the ship's still water speed and the fuel consumption per nautical mile is known; the navigation area between the departure and destination has been discretized, that is, the entire route is divided into 1,2...m route segments, and each route segment is also discretized into 1,2...n route points, and the distance between each route point is a fixed value;

[0150] Establish an objective function to ensure that the total fuel consumption of the ship transport route is minimized.

[0151] ,

[0152] It indicates the cumulative fuel consumption of the ship from the departure point to the destination. is the total number of destinations, is the number of route segments after discretization of the navigation area between the departure and destination, is the number of route points of a route segment after the navigation area between the departure and destination is discretized. To indicate the The route point state variable indicates the route point where the ship is currently located; To indicate the Ship heading at waypoint, To indicate the Vessel speed at route point, To indicate the Vessels at waypoints take heading and speed Fuel consumption under To indicate the Route segment Vessels at waypoints take heading and speed Fuel consumption under

[0153] Establish constraints: The ship sails from the departure point to the destination Transportation time requirements must be met:

[0154] ,

[0155] To represent the distance between discrete route points, To indicate that the destination is Vessel transportation time requirements;

[0156] The ship's speed at all route points meets the safe speed for ship transportation:

[0157] ,

[0158] To indicate the safe speed in ship transportation.

[0159] The ship transport comprehensive planning model construction module is used to jointly construct a ship transport comprehensive planning model by combining the ship transport stowage planning model and the ship transport route planning model, setting the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the ship's current transport task, and at the same time allocating weight values ​​for the loading and unloading volume and fuel consumption, and establishing a ship transport comprehensive planning model with the minimum ship loading and unloading volume and the lowest fuel consumption of the ship transport route as the planning objectives;

[0160] The establishment of the ship transport comprehensive planning model in the ship transport comprehensive planning model construction module needs to initially set the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the current transport task according to different transport tasks, and at the same time allocate the weight values ​​of the loading and unloading volume and fuel consumption;

[0161] The establishment of the ship transport comprehensive planning model requires the initial setting of the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the current transport task according to different transport tasks, and the allocation of weight values ​​for loading and unloading volume and fuel consumption;

[0162] ,

[0163] To indicate the maximum allowable loading and unloading volume set in the current ship transportation plan, To indicate the maximum allowable fuel consumption set in the current ship transportation plan, To represent the weight value of loading and unloading volume in the current ship transportation planning, It represents the weight value of fuel consumption in the current ship transportation planning.

[0164] The optimal solution solving module is used to solve the integrated planning model of shipping transportation based on genetic algorithms. The solution steps are divided into problem coding, initial solution setting, genetic operation design, and fitness function setting, and finally the optimal solution for integrated planning of shipping transportation is formed.

[0165] The problem coding in the optimal solution solving module refers to the coding method for determining the ship transport loading planning and ship transport route planning problems.

[0166] Ship transportation loading planning: The ship loading problem uses real number coding to generate each bay matrix. The unavailable cargo space is represented by -1, and the available but unloaded space is represented by 0. There are G ship transportation destinations in total, and 1 represents the next destination.

[0167] Ship transport route planning: After the navigation area between the departure place and the destination is discretized, the number of route segments is m, and the number of route points of a certain route segment after the navigation area between the departure place and the destination is discretized is n;

[0168] Initial solution setting: The initial solutions of ship transport stowage planning and ship transport route planning are designed and determined respectively. The initial solution of ship transport stowage planning is set according to the stack number, initial cargo grouping, cargo stack selection and specific stack location allocation; the initial solution of ship transport route planning is set according to sea area discrete processing, initial speed setting, speed and transportation time verification and total fuel consumption calculation;

[0169] Ship transport stowage planning

[0170] 1) Stack numbering: The stacks are numbered in the usual way from bow to stern and from port to starboard, which is convenient for the subsequent description and identification of the stacks;

[0171] 2) Group the initial cargo according to the cargo grouping principle and record the minimum destination number of each stack position in the initial state;

[0172] 3) In the initial state, stacking locations are allocated to each group of goods in the order of destination from far to near. A stacking location is randomly selected. If the number of goods in the group is less than or equal to the number of empty stacking locations, and the destination number of the group of goods is less than or equal to the minimum destination number of the goods already loaded in the stacking location, the stacking location is selected as the loading location for this group of goods. Otherwise, a new stacking location is selected for allocation.

[0173] 4) After each group of cargo is assigned a stacking location, the cargo in each group is assigned a specific location of the stacking location, which serves as the initial solution for the ship transport stowage planning;

[0174] Ship transport route planning

[0175] According to the order of destination allocation in the initial state of the ship transport loading plan, the navigation area is discretized into m route segments, and each route segment is discretized into n route points; the ship speed is initially set to check whether the set speed meets the safe speed of ship transport, if not, it is reset; the navigation time between route points is calculated according to the distance and speed between route points, and the total navigation time of all segments is accumulated to see whether it meets the transportation time requirements, if not, the initial speed is reset; the fuel consumption between route points is calculated according to the ship's still water speed and unit nautical mile fuel consumption, and the total fuel consumption of ship transport is accumulated as the initial solution of ship transport navigation planning;

[0176] Genetic operation design: including crossover operation and mutation operation of ship transport stowage planning. During the crossover and operation process, if the destination allocation changes, the ship transport route planning needs to re-discrete the navigation area and complete the calculation of the total fuel consumption of the ship transport;

[0177] 1) Cross

[0178] like Figure 2 As shown, a destination number is randomly generated, and the cargo group with the destination in the loading sequence is found among all cargo groups. Two different cargo groups are randomly selected from them, and the size of the cargo quantity in the two cargo groups is determined. The smaller one is selected for crossover operation.

[0179] 2) Mutation

[0180] like Figure 3 As shown, a destination number is randomly generated, the cargo group and stack position of the destination are selected in the loading sequence, and then the empty positions after loading according to the loading sequence are calculated, and the stacks with the number of empty positions ≥ 2 are found, and one is selected as one of the variants of the cargo group; a different cargo group is randomly selected from the selected cargo group set, and the number of its cargo group is counted and compared with the number of empty positions of the stack position where the cargo group is located for the first time, and the smaller one is used as the variant number;

[0181] During the crossover and mutation operations, if the destination allocation changes, it is necessary to re-discrete the navigation area and complete the calculation of the total fuel consumption of the ship transportation;

[0182] Fitness function setting: According to the objective function setting of the integrated planning of shipping transportation, the maximum allowable loading and unloading volume and the maximum allowable fuel consumption and their corresponding weight values ​​are introduced, and the optimal solution of the integrated planning of shipping transportation is obtained by iterative calculation by setting the convergence requirements;

[0183] The objective functions of the ship transportation comprehensive planning model are the ship loading and unloading volume and the fuel consumption of the ship transportation route. Considering the differences between different transportation tasks of ships, the maximum allowable loading and unloading volume and the maximum allowable fuel consumption and their corresponding weight values ​​are introduced when constructing the model.

[0184] In the process of genetic operations, namely crossover and mutation, by setting convergence requirements for iterative calculations, the objective function value continuously approaches the minimum value, and the optimal solution for the comprehensive planning of ship transportation can be obtained. Setting the convergence requirement means that the fuel consumption of the ship transportation route is the lowest.

Claims

1. A method for comprehensive planning of ship transportation based on genetic algorithm, characterized in that: The following steps are involved: (1) The initial conditions of the ship transport stowage planning model are set, and the minimum amount of cargo loading and unloading is taken as the objective function. The ship transport stowage planning model is constructed with the constraints of ensuring that all the initial cargo is loaded on board, ensuring that all the cargo to be loaded is loaded on board, and ensuring that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack. The initial conditions include the known information of the cargo to be loaded, the known information of the loaded cargo, the known ship space information, the ship space layout description method and the cargo grouping principle. In step (1), an objective function is established to ensure that the amount of cargo loaded and unloaded by the ship is minimized. , The amount of cargo that can be loaded and unloaded for ships. Indicates the cargo dumping caused by the change of the initial cargo position. The calculation process is to determine whether the initial cargo position has changed after loading. If it has changed, it will cause cargo dumping. The cargo dumping amount is multiplied by the quantity of the group of cargo. , It means that when the ship arrives at the next destination to unload, the cargo inside the stack is pressed and causes cargo to be dumped. The calculation process is to find a stack that is loaded with cargo to be unloaded at more than two destinations at the same time, and judge whether it will cause cargo to be dumped when unloading at the next destination. If it does cause cargo to be dumped, the amount of cargo dumped is the amount of cargo that is not unloaded at the next destination and blocks the unloading operation; , For the destination The number of cargo groups to be loaded, is the total number of destinations, is the total number of ship cabin spaces, For the original loading stack and the destination is The quantity of initial goods, For the destination No. The number of grouped goods, The value 1 indicates that the original stack and the destination is The initial cargo was loaded on In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates that the destination is No. The group of goods to be loaded was loaded in the In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates the The stack is loaded with different packets, and the packets that do not need to be unloaded at the next destination are pressed on the packets to be unloaded. 0 represents the value that does not meet the condition of value 1; Create constraints: Ship transport stowage planning needs to ensure that all initial cargo is loaded on board: , For the destination The initial quantity of goods, Ship transport stowage planning must ensure that all cargo to be loaded is loaded on board: , For the destination The quantity of cargo to be loaded, Ship transport stowage planning must ensure that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack: , For the The maximum number of items that can be loaded into a stack; (2) Setting the initial conditions of the ship transport route planning model, taking the minimum total fuel consumption of the ship transport route as the objective function, and satisfying the transportation time requirements and the safe speed of the ship transport as the constraints to construct the ship transport route planning model; the initial conditions include the known locations of the departure and destination, the known navigation environment information, the known relationship between the speed and fuel consumption, and the discretization of the navigation area between the departure and destination; In step (2), an objective function is established to ensure that the total fuel consumption of the shipping route is minimized. , It indicates the cumulative fuel consumption of the ship from the departure point to the destination. is the total number of destinations, is the number of route segments after discretization of the navigation area between the departure and destination, is the number of route points of a route segment after the navigation area between the departure and destination is discretized. To indicate the The route point state variable indicates the route point where the ship is currently located; To indicate the Ship heading at waypoint, To indicate the Vessel speed at route point, To indicate the Vessels at waypoints take heading and speed Fuel consumption under To indicate the Route segment Vessels at waypoints take heading and speed Fuel consumption under Establish constraints: The ship sails from the departure point to the destination The transportation time requirements must be met: , To represent the distance between discrete route points, To indicate that the destination is Vessel transportation time requirements; The ship's speed at all route points meets the safe speed for ship transportation: , To indicate the safe speed of ship transportation; (3) Combine the ship transport stowage planning model and the ship transport route planning model to jointly construct a ship transport comprehensive planning model, set the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the ship's current transport task, and assign weight values ​​for the loading and unloading volume and fuel consumption. The ship transport comprehensive planning model is established with the minimum loading and unloading volume and the minimum fuel consumption of the ship transport route as the planning objectives; In step (3), the establishment of the ship transport comprehensive planning model needs to initially set the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the current transport task according to different transport tasks, and at the same time allocate weight values ​​for the loading and unloading volume and fuel consumption; , To indicate the maximum allowable loading and unloading volume set in the current ship transportation plan, To indicate the maximum allowable fuel consumption set in the current ship transportation plan, To represent the weight value of loading and unloading volume in the current ship transportation planning, To represent the weight value of fuel consumption in the current ship transportation plan; (4) Based on the genetic algorithm, the model of integrated planning of shipping transportation is solved. The solution steps are divided into problem coding, initial solution setting, genetic operation design, and fitness function setting, and finally the optimal solution for integrated planning of shipping transportation is formed.

2. The method for comprehensive planning of ship transportation based on genetic algorithm according to claim 1 is characterized in that: In step (1), the information of the cargo to be loaded is known, which means that the size, weight, type, quantity and destination of the loaded cargo are known; the ship's space information is known, which means that the layout and capacity of the space available for loading cargo are known when the ship is not loaded with cargo or has arrived at the destination and unloaded; the ship's space layout description method adopts the container ship space description method, that is, the three-dimensional coordinate system of the ship's space is represented by shells, stacks and layers; the cargo grouping principle is determined, which means that cargoes with the same destination can be grouped together, and cargoes with a quantity not exceeding N can be grouped together, where N is set according to the number of vacancies in each stack; and the weight of cargoes in the same group is evenly distributed.

3. The method for comprehensive planning of ship transportation based on genetic algorithm according to claim 1 is characterized in that: In step (2), the known locations of the departure place and the destination refer to that the longitude and latitude information of the departure place and the destination of the ship transportation are determined, the known navigation environment information refer to that the air conditions and ocean conditions during the ship transportation are determined, the known relationship between the speed and the fuel consumption refer to that the corresponding relationship between the still water speed of the ship and the fuel consumption per nautical mile is known, and the navigation sea area between the departure place and the destination has been discretized refer to that the entire route is divided into 1,2...m route segments, each route segment is also discretized into 1,2...n route points, and the distance between each route point is a fixed value.

4. The method for comprehensive planning of ship transportation based on genetic algorithm according to claim 1 is characterized in that: The problem coding in step (4) refers to determining the coding method of the ship transport stowage planning and ship transport route planning problems, wherein the ship transport stowage planning refers to the generation of each bay matrix by real number coding for the ship transport stowage problem, where -1 represents a space without cargo, and 0 represents a space with cargo but not loaded; there are G ship transport destinations in total, and 1 represents the next docking destination; the ship transport route planning refers to the number of route segments after the discrete processing of the sailing sea area between the departure place and the destination, and the number of route points in a certain route segment after the discrete processing of the sailing sea area between the departure place and the destination is n.

5. The method for comprehensive planning of ship transportation based on genetic algorithm according to claim 1 is characterized in that: The initial solution setting in step (4) refers to the initial solutions of the ship transport stowage planning and the ship transport route planning being designed and determined respectively. The initial solution setting of the ship transport stowage planning is based on the stack numbering, initial cargo grouping, cargo stack selection and stack specific location allocation; the initial solution setting of the ship transport route planning is based on the sea area discrete processing, initial setting speed, speed and transportation time verification and total fuel consumption calculation.

6. The method for comprehensive planning of ship transportation based on genetic algorithm according to claim 1 is characterized in that: The genetic operation design in step (4) includes crossover operation and mutation operation of ship transport stowage planning. During the crossover and operation process, if the destination allocation changes, the ship transport route planning needs to re-discrete the navigation area and complete the calculation of the total fuel consumption of the ship transport; the fitness function setting refers to setting the objective function of the comprehensive ship transport planning, introducing the maximum allowable loading and unloading volume and the maximum allowable fuel consumption and their corresponding weight values, and performing iterative calculations by setting convergence requirements to obtain the optimal solution for the comprehensive ship transport planning.

7. A ship transportation integrated planning system based on genetic algorithm, characterized in that: include: The ship transport stowage planning model construction module is used to set the initial conditions of the ship transport stowage planning model, take the minimum amount of cargo loading and unloading as the objective function, and ensure that all the initial cargo is loaded on the ship, that all the cargo to be loaded is loaded on the ship, and that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack as the constraint conditions to build the ship transport stowage planning model; the initial conditions include the known information of the cargo to be loaded, the known information of the loaded cargo, the known ship space information, the ship space layout description method and the cargo grouping principle; The objective function is established in the ship transport stowage planning model construction module to ensure that the ship loading and unloading volume is minimized. , The amount of cargo that can be loaded and unloaded for ships. Indicates the cargo dumping caused by the change of the initial cargo position. The calculation process is to determine whether the initial cargo position has changed after loading. If it has changed, it will cause cargo dumping. The cargo dumping amount is multiplied by the quantity of the group of cargo. , It means that when the ship arrives at the next destination to unload, the cargo inside the stack is pressed and causes cargo to be dumped. The calculation process is to find a stack that is loaded with cargo to be unloaded at more than two destinations at the same time, and judge whether it will cause cargo to be dumped when unloading at the next destination. If it does cause cargo to be dumped, the amount of cargo dumped is the amount of cargo that is not unloaded at the next destination and blocks the unloading operation; , For the destination The number of cargo groups to be loaded, is the total number of destinations, is the total number of ship cabin spaces, For the original loading stack and the destination is The quantity of initial goods, For the destination No. The number of grouped goods, The value 1 indicates that the original stack and the destination is The initial cargo was loaded on In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates that the destination is No. The group of goods to be loaded was loaded in the In the stack, 0 represents a value that does not meet the condition of taking value 1; The value 1 indicates the The stack is loaded with different packets, and the packets that do not need to be unloaded at the next destination are pressed on the packets to be unloaded. 0 represents the value that does not meet the condition of value 1; Create constraints: Ship transport stowage planning needs to ensure that all initial cargo is loaded on board: , For the destination The initial quantity of goods, Ship transport stowage planning must ensure that all cargo to be loaded is loaded on board: , For the destination The quantity of cargo to be loaded, Ship transport stowage planning must ensure that the amount of cargo loaded in each stack does not exceed the maximum cargo capacity of the stack: , For the The maximum number of items that can be loaded into a stack; The ship transport route planning model building module is used to set the initial conditions of the ship transport route planning model, taking the minimum total fuel consumption of the ship transport route as the objective function, and building the ship transport route planning model with the requirements of transportation time and the safe speed of ship transport as the constraints; the initial conditions include the known locations of the departure and destination, the known navigation environment information, the known relationship between the speed and fuel consumption, and the discrete processing of the navigation area between the departure and destination; The objective function is established in the ship transport route planning model construction module to ensure that the total fuel consumption of the ship transport route is minimized. , It indicates the cumulative fuel consumption of the ship from the departure point to the destination. is the total number of destinations, is the number of route segments after discretization of the navigation area between the departure and destination, is the number of route points of a route segment after the navigation area between the departure and destination is discretized. To indicate the The route point state variable indicates the route point where the ship is currently located; To indicate the Ship heading at waypoint, To indicate the Vessel speed at route point, To indicate the Vessels at waypoints take heading and speed Fuel consumption under To indicate the Route segment Vessels at waypoints take heading and speed Fuel consumption under Establish constraints: The ship sails from the departure point to the destination Transportation time requirements must be met: , To represent the distance between discrete route points, To indicate that the destination is Vessel transportation time requirements; The ship's speed at all route points meets the safe speed for ship transportation: , To indicate the safe speed of ship transportation; The ship transport comprehensive planning model construction module is used to jointly construct a ship transport comprehensive planning model by combining the ship transport stowage planning model and the ship transport route planning model, setting the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the ship's current transport task, and at the same time allocating weight values ​​for the loading and unloading volume and fuel consumption, and establishing a ship transport comprehensive planning model with the minimum ship loading and unloading volume and the lowest fuel consumption of the ship transport route as the planning objectives; The establishment of the ship transport comprehensive planning model in the ship transport comprehensive planning model building module needs to initially set the maximum allowable loading and unloading volume and the maximum allowable fuel consumption of the current transport task according to different transport tasks, and at the same time allocate weight values ​​for the loading and unloading volume and fuel consumption; , To indicate the maximum allowable loading and unloading volume set in the current ship transportation plan, To indicate the maximum allowable fuel consumption set in the current ship transportation plan, To represent the weight value of loading and unloading volume in the current ship transportation planning, To represent the weight value of fuel consumption in the current ship transportation plan; The optimal solution solving module is used to solve the integrated planning model of shipping transportation based on genetic algorithms. The solution steps are divided into problem coding, initial solution setting, genetic operation design, and fitness function setting, and finally the optimal solution for integrated planning of shipping transportation is formed.

Citation Information

Patent Citations

  • LNG (Liquefied Natural Gas) marine transportation path planning data processing method and device and electronic equipment

    CN116341782A

  • Fixed-route ship speed re-planning method based on improved genetic algorithm

    CN118586113A