Ship loading method, device, equipment, storage medium and program product

Abstract

The invention discloses a shipping stowage method, device and equipment, a storage medium and a program product, and relates to the technical field of shipping intelligent stowage, and the shipping stowage method comprises the following steps: reading a container shipping period of a target ship in a container wharf; according to the container shipping period, shipping containers in a storage yard are combined, and a shipping container string to be loaded is obtained; and carrying out shipping stowage on the target ship based on the shipping container string to be stowage to obtain a shipping stowage plan. According to the shipping stowage method, shipping stowage is carried out through the container shipping period combination shipping container string, shipping stowage of the whole container wharf ship is achieved, the problem that in the prior art, the whole ship shipping stowage convenient to adjust cannot be achieved is solved, manual intervention on the wharf ship shipping stowage is reduced, and the shipping stowage convenience and usability are improved.

Description

Technical Field

[0001] The present application relates to the technical field of intelligent loading and unloading, and in particular to a method, device, equipment, storage medium and program product for loading and unloading. Background Art

[0002] With the introduction of the concept of smart ports and the continuous increase in the loading capacity of container ships, more and more container terminals have begun to adopt intelligent loading based on artificial intelligence algorithms instead of manual loading based mainly on the experience of loaders.

[0003] Due to the complex scenarios and large amount of calculations required for intelligent stowage, the existing intelligent stowage methods on the market can only solve relatively simple stowage problems within the cabin, and it is difficult to achieve stowage of the entire ship. In addition, the algorithm logic of the intelligent stowage method in the existing technology is complex, which is very different from the idea of ​​manual stowage and difficult for stowage operators to understand, so it is difficult to make adjustments based on this.

[0004] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention

[0005] The main purpose of the present application is to provide a method, device, equipment, storage medium and program product for loading and stowing a ship, aiming to solve the problem that the prior art cannot achieve easy-to-adjust whole-ship loading and stowing.

[0006] To achieve the above objectives, the present application proposes a ship loading method, which comprises:

[0007] Read the container schedule of the target vessel in the container terminal;

[0008] According to the container ship schedule, the shipping containers in the yard are combined to obtain a shipping container string to be loaded;

[0009] Based on the to-be-loaded container string, the target ship is loaded and stowed to obtain a loading and stowage plan.

[0010] In one embodiment, the step of combining the shipping containers in the storage yard according to the container ship schedule to obtain a shipping container string to be loaded includes:

[0011] According to the container ship schedule, corresponding yard data, shipping container data and pre-allocated item data are obtained;

[0012] According to the storage yard data, the shipping container data and the pre-allocated item data, the shipping containers in the storage yard are combined to obtain a shipping container string to be loaded.

[0013] In one embodiment, the step of loading and stowing the target ship based on the string of containers to be loaded to obtain a loading and stowing plan includes:

[0014] Based on the string of containers to be loaded, a loading plan is performed on the shells on board the target ship to obtain a loading plan result;

[0015] Based on the loading planning result, reordering the shellfish on the ship to obtain a loading reordering result;

[0016] A loading and distributing plan is generated according to the loading and distributing results.

[0017] In one embodiment, the string of containers to be loaded includes one or more strings of containers, and the step of performing loading planning on the shipboard shells of the target ship based on the string of containers to be loaded to obtain the loading planning result includes:

[0018] Constructing a planning search tree based on the pre-configured items of the target ship;

[0019] The loading planning is performed on the shells on board the target ship through the planning search tree to obtain the loading planning result.

[0020] In one embodiment, the step of performing loading planning on the onboard shells of the target ship through the planning search tree to obtain a loading planning result includes:

[0021] Based on the preset planning penalty parameters and planning constraints, the unplanned shipping container strings in the to-be-loaded shipping container string are attempted to be planned into each remaining child node of the planning search tree for planning penalty calculation, and the remaining child node with the lowest planning penalty calculation value is obtained as the optimal child node;

[0022] Repeat the planning penalty calculation until the to-be-loaded container string does not contain any unplanned container string, and obtain the optimal child nodes of all container strings in the to-be-loaded container string;

[0023] According to the optimal child nodes of all the shipping container strings, the shipping planning result is obtained.

[0024] In one embodiment, the step of reordering the shellfish on the ship based on the shipment planning result to obtain the shipment reordering result includes:

[0025] Based on the shipment planning result, the planned shipment container strings on the ship are split and reorganized to obtain the shipment container strings to be sorted;

[0026] Constructing a reordering search tree based on the shipping box string to be sorted;

[0027] The shellfish on the ship are reordered for loading through the reordering search tree to obtain a loading reordering result.

[0028] In addition, to achieve the above-mentioned purpose, the present application also proposes a ship loading and stowing device, the ship loading and stowing device comprising:

[0029] A reading module is used to read the container schedule of the target ship in the container terminal;

[0030] A combination module, used for combining the shipping containers in the yard according to the container ship schedule to obtain a shipping container string to be loaded;

[0031] The loading module is used to load the target ship based on the string of containers to be loaded, and obtain a loading plan.

[0032] In addition, to achieve the above-mentioned purpose, the present application also proposes a ship loading and stowing equipment, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, and the computer program is configured to implement the steps of the ship loading and stowing method described above.

[0033] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by the processor, the steps of the ship loading and stowage method described above are implemented.

[0034] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the steps of the ship loading and stowage method as described above are implemented.

[0035] The present application provides a loading and stowing method, which first determines the loading and stowing demand of the target ship by reading the container schedule of the target ship that needs to be loaded and stowed in the container terminal; uses the read container schedule to combine the corresponding loading boxes in the yard to obtain a loading box string to be loaded, and uses the loading box string as the basic unit of loading and stowing, which conforms to the operating idea of ​​the stowage personnel in actual container loading; uses the combined loading box string to be loaded to load the target ship to obtain a loading and stowing plan, and loads the ship in the form of a combined loading box string to be loaded, which reduces the calculation demand of the loading and stowing for the complex logic of stowage adjustment, and improves the convenience and ease of use of the loading and stowing.

[0036] In summary, the present application realizes the loading and stowing of the entire ship at the container terminal by combining the container shipping schedule with the loading and stowing of the container string, solves the problem that the prior art cannot realize the loading and stowing of the entire ship that is easy to adjust, reduces manual intervention in the loading and stowing of the terminal ship, and improves the convenience and ease of use of loading and stowage. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0038] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0039] Figure 1 A schematic diagram of a flow chart provided for the first embodiment of the ship loading method of the present application;

[0040] Figure 2 A schematic diagram of a flow chart provided for the second embodiment of the ship loading method of the present application;

[0041] Figure 3 A schematic diagram of the intelligent stowage platform architecture provided for the third embodiment of the ship stowage method of the present application;

[0042] Figure 4 This is a schematic diagram of the module structure of the ship loading and stowage device according to an embodiment of the present application;

[0043] Figure 5 It is a schematic diagram of the equipment structure of the hardware operating environment involved in the ship loading and stowage method in the embodiment of the present application.

[0044] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0045] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0046] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0047] The main solution of the embodiment of the present application is: reading the container schedule of the target ship in the container terminal; combining the shipping containers in the yard according to the container schedule to obtain a shipping container string to be loaded; based on the shipping container string to be loaded, loading and stowing the target ship to obtain a loading and stowage plan.

[0048] Due to the complexity of intelligent stowage scenarios and the large amount of calculation, the existing intelligent stowage methods on the market can only solve relatively simple cabin stowage problems and cannot achieve whole ship stowage. In addition, the algorithm logic of the existing intelligent stowage method is very different from the idea of ​​manual stowage, which is difficult for stowers to understand, so it is difficult to make adjustments on this basis.

[0049] On the one hand, various intelligent stowage solutions currently on the market focus on relatively simple stowage only in the cabin, which requires manual determination of which boxes to load in the cabin. The stowage work on the deck still requires experienced stowers to complete, and it is impossible to complete the stowage of all shipping boxes on the entire ship.

[0050] On the other hand, existing intelligent loading solutions mostly directly adopt a combination of heuristic algorithms and penalty systems. Due to the algorithmic randomness of the output results and the complexity of the penalty factors, the loading process is very different from the idea of ​​manual loading, making it difficult for loaders to understand their ideas, making it difficult for them to adjust and optimize the loading results.

[0051] The present application realizes the loading and stowing of the entire ship of the container terminal by loading and stowing the container string according to the container shipping schedule, solves the problem that the prior art cannot realize the loading and stowing of the entire ship that is easy to adjust, reduces the manual intervention in the loading and stowing of the terminal ship, and improves the convenience and ease of use of the loading and stowing.

[0052] It should be noted that the execution subject of this embodiment may be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of realizing the above functions, a ship loading and stowage equipment, etc. The following takes the ship loading and stowage equipment as an example to illustrate this embodiment and the following embodiments.

[0053] Based on this, the present application embodiment provides a method for loading and distributing cargo on a ship, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the ship loading method of the present application.

[0054] In this embodiment, the ship loading method includes steps S10 to S30:

[0055] Step S10, reading the container schedule of the target ship in the container terminal;

[0056] It should be noted that the container ship schedule refers to the scheduled flight schedule of the ship, which may include pre-allocation data, berth data, ship engine work plan data, loading box data and other relevant data of ship loading scheduling. The target ship refers to the specific ship that needs to load containers, and the location of container loading includes cabin and deck, etc. The loading box refers to the container ready to be loaded.

[0057] In addition, it should be noted that in addition to ships, container terminals also have berths, quay cranes, yards, etc. The yard is a place where containers to be loaded are stored, and can include the arrangement attributes of container storage such as shells, rows, and layers.

[0058] It is understandable that in order to ensure that the loading plan is consistent with the actual shipping schedule and avoid loading delays or mismatches due to information mismatch, the container shipping schedule of the target ship is first obtained by accessing the shipping schedule data or system records provided by the loadmaster.

[0059] Step S20, combining the shipping containers in the yard according to the container ship schedule to obtain a shipping container string to be loaded;

[0060] It should be noted that the combination basis of the shipping containers in the yard may include the pre-allocated item to which the container belongs, the yard row and specific location of the container, the weight and height of the container and other loading space-related data.

[0061] It is understandable that in order to optimize the arrangement and combination of shipping containers and ensure that the containers can be effectively loaded onto the target ship, making the loading process as efficient as possible, the containers in the yard to be loaded onto the ship are reasonably combined according to the reading of the container ship schedule and loading requirements to form a string of shipping containers to be loaded.

[0062] Step S30, based on the container string to be loaded, loading and stowing the target ship is performed to obtain a loading and stowing plan.

[0063] It should be noted that the loading and stowage plan refers to a plan that records in detail the loading and stowage of containers, which may include the loading position and sequence of the containers and instructions for specific loading operations, including how to load the containers onto the ship. It may also include data related to operational efficiency such as the number of containers unloaded at the yard and the number of operational conflicts for the reference of the loaders.

[0064] It is understandable that in order to ensure that each container is loaded onto the target ship in the optimal order and position, thereby improving loading efficiency and ensuring the ship's navigation safety, a specific loading and stowage plan is formulated based on the combined loading container string to arrange the loading order and position of each container.

[0065] In a feasible implementation manner, the step of combining the shipping containers in the storage yard according to the container shipping schedule to obtain a shipping container string to be loaded includes:

[0066] Step S201, according to the container ship schedule, obtaining corresponding yard data, shipping box data and pre-allocated item data;

[0067] It should be noted that the yard data contains detailed records of containers in the yard, including location, type, quantity, etc., which are used to understand the distribution and status of containers in the yard and facilitate the formulation of reasonable loading plans. Shipment container data refers to detailed information on containers to be loaded, such as size, weight, content and special requirements, which is used to ensure that the selected containers meet the loading requirements of the ship and can arrange the loading sequence correctly. Pre-loading item data refers to the information of the preliminary loading plan formulated on the basis of meeting the pre-loading principle, which is used to determine the distribution of container slots and the category attributes of the container slots and the unloading port, etc.

[0068] It is understandable that in order to understand the specific situation of the container and the shipping schedule requirements and ensure the accuracy and effectiveness of the loading plan, the yard information, loading box data and pre-allocated item data corresponding to the container shipping schedule are obtained according to the container shipping schedule to ensure that there is sufficient data to formulate a reasonable loading box combination plan.

[0069] Step S202, combining the shipping containers in the storage yard according to the storage yard data, the shipping container data and the pre-assignment item data to obtain a shipping container string to be loaded.

[0070] It should be noted that a shipping container string is a whole formed by combining multiple containers that need to be loaded according to certain rules and sequence. The combination can be optimized according to factors such as the loading requirements of the ship, the nature of the containers, and the loading sequence. By grouping the containers into larger combination units (container strings), the combination complexity of a single container can be reduced and the calculation and operation process can be simplified.

[0071] It is understandable that in order to optimize the process of loading containers, meet the shipping schedule requirements, optimize space utilization, and ensure smooth loading, the acquired yard data, loading container data, and pre-allocated item data are combined, and the containers in the yard are combined into a string of loading containers to be loaded according to the set combination strategy.

[0072] In this embodiment, by acquiring the ship schedule-related data and combining the shipping container strings, the optimization problem of the shipping container combination is effectively simplified, the calculation complexity is reduced, and the efficiency and comprehensibility of the operation are improved. This not only improves the overall efficiency of the loading process, but also provides a more intuitive operation mode for the loaders, thereby optimizing the entire loading process.

[0073] In a feasible implementation manner, the step of loading and stowing the target ship based on the string of containers to be loaded to obtain a loading and stowing plan includes:

[0074] Step S301, based on the to-be-loaded container string, a loading plan is performed on the onboard shellfish of the target ship to obtain a loading plan result;

[0075] It can be understood that according to the characteristics of containers and the bay conditions of the ship, loading planning is carried out with the string of containers to be loaded as the loading planning unit, and the containers are allocated to the bays of the ship to make the best use of the space, comply with the load limit of the ship, and meet the loading and unloading requirements of the cargo.

[0076] Step S302, based on the shipment planning result, reorder the shellfish on the ship to obtain a shipment reordering result;

[0077] It is understandable that in order to improve the loading and unloading sequence and optimize the placement of containers, reduce loading and unloading time and operational complexity, reordering is carried out based on the results of the preliminary loading plan, and the loading order of the containers is rearranged to obtain a loading reordering result that is more in line with the actual loading scenario.

[0078] Step S303: generating a loading and distributing plan according to the loading and distributing reordering result.

[0079] It can be understood that, based on the re-sequencing, a detailed loading and stowage plan is generated, which guides the actual loading operation by concretizing the optimized loading plan, and is suitable for the whole ship stowage scenario of containers, thus ensuring the feasibility and accuracy of the actual operation.

[0080] In this implementation, through loading planning, resequencing and stowage plan generation, the process of generating stowage results is closer to the operational thinking of the stowage personnel in the actual operating environment, maximizing the use of the ship's loading space, ensuring that the actual loading operation is carried out according to the optimization plan, and reducing errors and operational problems.

[0081] This embodiment provides a loading and stowing method, which performs loading and stowing by combining container shipping schedules with loading container strings, thereby realizing loading and stowing of the entire ship at a container terminal, solving the problem that the prior art cannot realize easy-to-adjust loading and stowing of the entire ship, reducing manual intervention in the loading and stowing of terminal ships, and improving the convenience and ease of use of loading and stowing.

[0082] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the first embodiment can refer to the above introduction, and will not be repeated in the following. Figure 2 , Figure 2 This is a flow chart of the second embodiment of the loading and stowage method of the present application. The to-be-loaded container string includes one or more container strings, and the steps of performing loading and stowage planning on the shipboard shells of the target ship based on the to-be-loaded container string to obtain the loading and stowage planning result include:

[0083] Step S3011, constructing a planning search tree based on the pre-configured items of the target ship;

[0084] It should be noted that the pre-stowage item refers to a stowage plan preliminarily formulated on the basis of meeting the pre-stowage principle, which includes the distribution information of bay spaces on the ship, different types of shipping containers, etc.

[0085] It can be understood that in order to find the optimal loading solution under a specific loading configuration, a structured planning search tree is constructed using the preliminary formulated loading solution of the target ship.

[0086] Step S3012, performing loading planning on the shells on board the target ship through the planning search tree to obtain a loading planning result.

[0087] It can be understood that in order to provide a practical loading plan so that containers can be effectively allocated to the exact location of the ship's bay, loading planning is performed by planning a search tree, considering the advantages and disadvantages of various loading plans, and searching for loading planning plans from containers in the terminal yard to the target ship's onboard bays.

[0088] In a feasible implementation manner, the step of performing loading planning on the onboard shells of the target ship through the planning search tree to obtain a loading planning result includes:

[0089] Step S30121, based on preset planning penalty parameters and planning constraints, try to plan the unplanned shipping container strings in the to-be-loaded shipping container strings to each remaining child node of the planning search tree to perform planning penalty calculation, and obtain the remaining child node with the lowest planning penalty calculation value as the optimal child node;

[0090] It should be noted that the planning search tree is a structured decision tree that represents different loading location options and their states. Each node of the tree represents a loading location option. The penalty parameter defines the criteria for calculating the penalty, such as overweight, space waste, etc. The constraint condition can be that the sum of the weight limits of each column on the ship is not less than the sum of the weights of the containers planned for that ship. The child node refers to each possible loading location in the tree, representing a specific loading plan. The planning penalty calculation value reflects the degree of violation of the constraint conditions or the poor utilization of space.

[0091] It can be understood that in order to find the best loading planning scheme, for each unplanned loading container string, try to plan it to the remaining child nodes (i.e., unplanned loading positions) of the current container string in the planning search tree that do not contain the optimal child nodes of other container strings, and calculate the planning penalty value of each allocation method, and find the child node with the lowest penalty value as the optimal child node of the current loading container string.

[0092] Step S30122, repeatedly calculating the planning penalty until the to-be-loaded container string contains no unplanned container string, and obtaining the optimal child nodes of all container strings in the to-be-loaded container string;

[0093] It can be understood that in order to ensure that each container string finds the optimal position and the entire loading plan achieves the best effect after comprehensively considering all container strings, all unplanned loading container strings are processed one by one, and the planning penalty calculation is repeated to search for the optimal loading position of each container string until all container strings are planned.

[0094] Step S30123, obtaining the shipment planning result according to the optimal child nodes of all the shipping container strings.

[0095] It can be understood that in order to comprehensively consider the optimal loading positions of all container string positions, the optimal loading positions on the ship corresponding to the optimal sub-nodes of each loading container string are summarized to obtain the loading planning results.

[0096] In this embodiment, a complete loading plan is formed by optimizing the position of the box string that meets all the constraints, reducing space waste and violations of the constraints, ensuring the best effect of the overall loading plan, and improving loading efficiency and accuracy.

[0097] In a feasible implementation manner, the step of reordering the shellfish on the ship based on the shipment planning result to obtain the shipment reordering result includes:

[0098] Step S3021, based on the shipment planning result, split and reorganize the planned shipment container strings corresponding to the ship, to obtain the shipment container strings to be sorted;

[0099] It is understandable that in order to improve loading efficiency or meet specific needs, it is necessary to reorder the planned shipping containers on board. Based on the planned shipping planning results, the planned shipping container strings corresponding to the planned shipping containers on board are split and reorganized according to the ship's reordering requirements to generate a set of container strings to be sorted, so that these container strings meet specific shipping order or structural requirements.

[0100] Step S3022, constructing a reordering search tree based on the shipping container string to be ordered;

[0101] It should be noted that the reordering search tree represents the tree structure of all possible reordering paths, and each node represents a specific reordering state. The reordering of the container string for loading refers to adjusting the order of the container string to meet new loading requirements or optimize loading efficiency.

[0102] It can be understood that in order to evaluate different reordering schemes and find the optimal reordering result, based on the shipping container string to be sorted, all possible reordering paths are represented by a tree structure to construct a reordering search tree.

[0103] Step S3023, reordering the shellfish on the ship for loading through the reordering search tree to obtain the loading reordering result.

[0104] It is understandable that in order to ensure the optimization of the loading plan and the improvement of the actual effect, the reordering search tree is used to search for the order and position of the box strings that meet the new loading requirements or optimization plan, and obtain the actual loading reordering results on board.

[0105] In this embodiment, by splitting and reorganizing the loading container strings and reordering the loading, a reordering search tree is constructed and used to systematically explore the reordering scheme, and finally the optimal reordering of the loading container strings is achieved, thereby improving the loading efficiency and flexibility, ensuring that the final loading order of the containers meets the safety requirements or optimization goals of the ship's spatial structure, thereby improving the overall loading effect.

[0106] In this embodiment, the loading planning and reordering of the shells on board the ship are carried out through the optimized loading container string, forming a loading and stowage plan that meets specific loading requirements and loading sequence, which can effectively improve the loading efficiency, ensure the optimization of the loading sequence, and meet different loading goals and requirements.

[0107] Based on the first embodiment and / or the second embodiment of the present application, in the third embodiment of the present application, the same or similar contents as those of the first and second embodiments mentioned above can be referred to the above introduction and will not be repeated later.

[0108] like Figure 3 As shown, Figure 3 A schematic diagram of the intelligent stowage platform architecture provided for the third embodiment of the ship stowage method of the present application. In this embodiment, the intelligent stowage platform implemented by the ship stowage method is used as an example for explanation. The intelligent stowage platform may include the following modules:

[0109] 1. Data reading module: mainly responsible for reading the data required for intelligent loading from the container terminal operating system.

[0110] 2. "Container string" sorting module: mainly responsible for sorting the shipping containers in the yard into "container strings".

[0111] 3. Monte Carlo search tree algorithm module: mainly responsible for implementing the underlying Monte Carlo search tree algorithm.

[0112] 4. "Planning" module: It is mainly responsible for realizing the first step of intelligent stowage "Planning", that is, allocating a batch of designated shipping containers to each ship, which will be used to specify the specific loading location and loading order of these containers in the second step "reordering".

[0113] 5. "Reordering" module: mainly responsible for the second step of intelligent loading "reordering", that is, specifying the specific loading location and loading order for each shell's shipping box.

[0114] 6. Plan generation module: Generate the final ship loading plan and output data related to the operation efficiency, such as the number of containers unloaded at the yard and the number of operation conflicts, for the reference of the loaders.

[0115] Specifically, taking a single-ship intelligent loading scenario as an example, the following steps may be included:

[0116] Step 1: Provide the required data support for the core algorithm of intelligent loading.

[0117] Step 1.1: Data reading. After the ship schedule to be intelligently loaded is input into the system, the system reads the pre-allocated position data, berth data, ship and machine work plan data, and container data corresponding to the ship schedule, the ship structure data of the ship to which the ship schedule belongs, and the current position data of the container loaded on the yard for the ship schedule. By incorporating the berth plan position, ship and machine work plan, and yard shell split granularity into the consideration scope of the intelligent loading algorithm, the overall efficiency of the port area is avoided from being reduced due to conflicts in picking up containers between ships.

[0118] Step 1.2: Arrangement of "box strings". Arrange the shipping boxes on the yard into "box strings" according to the pre-allocated items to which the boxes belong, the yard row and specific location of the boxes, and the weight and height of the boxes. In the subsequent algorithms, "box strings" are used as the basic calculation unit instead of boxes, the total weight of "box strings" replaces the box weight, the total height of "box strings" replaces the box height, and the number of boxes to be unloaded from the yard to take a "box string" replaces the number of boxes to be unloaded from the yard.

[0119] Step 2: Call the Monte Carlo Search Tree module for "planning".

[0120] Step 2.1: Clear all implemented shipment instructions and start the search from the initial state.

[0121] Step 2.2: Build a search tree by pre-allocated item, each tree containing all the ship positions of the pre-allocated item and the shipping boxes belonging to the pre-allocated item.

[0122] Step 2.3: Initialize the root node for each pre-configured item. Each root node includes the available yard shells in the current state, the ship shells currently to be "planned", the ship shells that have completed "planning", and the yard shells corresponding to the "planned" ship shells.

[0123] Step 2.4: Search for the optimal child node according to the penalty parameters and constraints in the "planning" stage. The penalty parameters include: the difference between the weight difference of each box of each ship and the overall average difference, the average difference of each box of the ship weight, the granularity of the yard shell splitting, and the number of different operation paths of the same ship in the yard. The constraint condition is that the sum of the weight limits of each column of the ship is not less than the sum of the box weights "planned" for the ship. When searching, try to fill the ship with the entire yard shell first, then select a feasible "box string" in the yard to fill the remaining position, and finally select scattered boxes in the yard to fill the remaining position. By combining the design of weight grades and the introduction of mixed loading marks, the intelligent loading of the whole ship can realize the mixed loading process, allowing the boxes in one area to exchange the positions on the ship in the actual loading operation because the order of arrival at the shore is different from the order of box dispatching. The mixed loading process can avoid the problem that the boxes that arrive at the shore first cannot operate due to the suspended position, and it is also convenient for the central control personnel to adjust the order of box dispatching during the operation.

[0124] Step 2.5: Iterate step 2.4 until all child nodes have been searched and the number of iterations has been reached, and generate a "planning" result for display on the ship chart.

[0125] Step 2.6: Check whether all shipping boxes have been "planned". If so, proceed to step 3 "reordering"; otherwise, relax the weight back pressure restriction and return to step 2.1 to clear all shipping instructions and re-plan.

[0126] Step 3: Call the Monte Carlo search tree module to "reorder" each "planned" ship one by one.

[0127] Step 3.1: Arrange the boxes filled in the "Planning" stage into "box strings": The boxes filled in the entire yard are split according to the columns on the yard, and the scattered boxes are added to the "box strings" of the same yard column / same yard / same operation road.

[0128] Step 3.2: Divide the "planned" boxes of the shellfish into different weight grades according to the layers of shellfish on the ship, so that each layer can only hold boxes of the corresponding weight grade.

[0129] Step 3.3: For the shells currently on board, clear the loading instructions for the shells.

[0130] Step 3.4: Build a search tree based on the shells on board, each tree contains a list of positions to be assigned to the shell and a list of boxes "planned" to the shell.

[0131] Step 3.5: Initialize the root node of the shells on the ship, including the unallocated position of the current shell, the allocated position, the allocated "planning" box, and the unallocated "planning" box.

[0132] Step 3.6: Search for the optimal child node according to the penalty value and restriction conditions of the "reordering" stage. The penalty parameters include: weight level, yard turning, caron operation, and adjacent row layer difference. The restriction conditions include: row height limit, row weight limit, and weight back pressure threshold. When searching, the destination position is limited to the current highest layer to avoid hanging boxes. By introducing the current operating height difference between the front and rear shells, the height difference of the double hanging boxes, and the weight difference of the double hanging boxes in the loading restriction conditions, the intelligent loading of the whole ship can adapt to the double hanging operation like manual loading, which improves the safety of ship operation.

[0133] Step 3.7: Iterate step 3.6 until all child nodes have been searched and the number of iterations has been reached, and generate a loading plan for display on the ship chart.

[0134] Step 3.8: Check whether all the "planned" boxes on board have been "reordered". If so, end the algorithm. Otherwise, try to fill the "planned" boxes that have been "planned" but failed to be "reordered" directly into the "planned" position to complete the loading. If there are still boxes that have not been loaded after the previous attempt, relax the weight back pressure limit and weight grade setting limit, and return to step 3.2 to re-reorder.

[0135] Step 4: Output the whole ship loading results as the loading plan, and provide the number of containers unloaded in the yard and the number of operation conflicts for the loaders' reference.

[0136] It can be seen that the intelligent loading platform has the following advantages:

[0137] 1. Improved the usability of intelligent loading results: The two-step thinking of "planning-reordering" during manual loading is simulated, making the process of generating loading results closer to the operating ideas of loaders in the actual production environment, which is easier for them to understand and can be further optimized based on the output results of intelligent loading.

[0138] 2. The concept of "box string" consisting of boxes that can be continuously dispatched from the yard is introduced: the existing method calculates penalty points for each independent box when selecting boxes in the yard. Since each ship may have thousands of boxes to be loaded, the calculation complexity is very high. By introducing the concept of "box string" consisting of multiple boxes, the original box combination optimization problem can be simplified to the combination optimization of "box string", which greatly reduces the calculation complexity. In addition, since the idea used in manual loading is similar to "box string", the loading results generated by this example can also make it easier for loaders to understand.

[0139] 3. By introducing factors such as the current operating height difference between the front and rear shells, the height difference between the double hoisting boxes, and the weight difference between the double hoisting boxes, the new method can be adapted to the double hoisting process. Compared with the existing method which is limited to the single hoisting process, the loading operation efficiency is greatly improved.

[0140] 4. The introduction of mixed loading marks enables the new method to adapt to the mixed loading process. Compared with the existing method, it solves the problem that the order in which the containers are transported to the shore during actual operations does not match the planned loading order, resulting in the inability to operate the containers that arrived first.

[0141] 5. Introduce multi-ship operation conflicts as a factor affecting loading: Existing methods focus on the efficiency of single-ship loading, such as container turnover in the yard and crane movement, but ignore the impact of multi-ship operation conflicts on the efficiency of the entire port area. According to the ship and machine work plans and container pickup yards at different berths, it is possible to avoid the situation where different ships send containers from the same yard at the same time, and the crane cannot operate at the same time due to equipment limitations, resulting in reduced operating efficiency.

[0142] In this embodiment, loading and stowing of the entire ship is achieved by combining the container shipping schedule with the loading string, thereby solving the problem that the prior art cannot achieve easy-to-adjust loading and stowing of the entire ship, reducing manual intervention in the loading and stowing of the terminal ship, and improving the convenience and ease of use of loading and stowage.

[0143] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the loading and stowage method of the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0144] This application also provides a loading and unloading device, please refer to Figure 4 , the ship loading device comprises:

[0145] A reading module 10 is used to read the container schedule of the target ship in the container terminal;

[0146] A combination module 20 is used to combine the shipping containers in the yard according to the container ship schedule to obtain a shipping container string to be loaded;

[0147] The loading module 30 is used to load the target ship based on the container string to be loaded, and obtain a loading plan.

[0148] Optionally, the combination module 20 is further used for:

[0149] According to the container ship schedule, corresponding yard data, shipping container data and pre-allocated item data are obtained;

[0150] According to the yard data, the shipping container data and the pre-allocated item data, the shipping containers in the yard are combined to obtain a shipping container string to be loaded.

[0151] Optionally, the loading module 30 is further used for:

[0152] Based on the string of containers to be loaded, a loading plan is performed on the shells on board the target ship to obtain a loading plan result;

[0153] Based on the loading planning result, reordering the shellfish on the ship to obtain a loading reordering result;

[0154] A loading and distributing plan is generated according to the loading and distributing results.

[0155] Optionally, the shipping container string to be loaded includes one or more shipping container strings, and the loading module 30 is further used for:

[0156] Constructing a planning search tree based on the pre-configured items of the target ship;

[0157] The loading planning is performed on the shells on board the target ship through the planning search tree to obtain the loading planning result.

[0158] Optionally, the loading module 30 is further used for:

[0159] Based on the preset planning penalty parameters and planning constraints, the unplanned shipping container strings in the to-be-loaded shipping container string are attempted to be planned into each remaining child node of the planning search tree for planning penalty calculation, and the remaining child node with the lowest planning penalty calculation value is obtained as the optimal child node;

[0160] Repeat the planning penalty calculation until the to-be-loaded container string does not contain any unplanned container string, and obtain the optimal child nodes of all container strings in the to-be-loaded container string;

[0161] According to the optimal child nodes of all the shipping container strings, the shipping planning result is obtained.

[0162] Optionally, the loading module 30 is further used for:

[0163] Based on the shipment planning result, the planned shipment container strings on the ship are split and reorganized to obtain the shipment container strings to be sorted;

[0164] Constructing a reordering search tree based on the shipping box string to be sorted;

[0165] The shellfish on the ship are reordered for loading through the reordering search tree to obtain a loading reordering result.

[0166] The ship loading and stowing device provided by the present application adopts the ship loading and stowing method in the above embodiment, which can solve the technical problem that the prior art cannot realize the whole ship loading and stowing that is easy to adjust. Compared with the prior art, the beneficial effects of the ship loading and stowing device provided by the present application are the same as the beneficial effects of the ship loading and stowing method provided by the above embodiment, and the other technical features of the ship loading and stowing device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0167] The present application provides a ship loading and stowing equipment, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the ship loading and stowing method in the first embodiment described above.

[0168] Reference below Figure 5 , which shows a schematic diagram of the structure of the ship loading equipment suitable for implementing the embodiment of the present application. The ship loading equipment in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle terminals (such as vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The ship loading and stowage equipment shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0169] like Figure 5 As shown, the ship loading equipment may include a processing device 1001 (such as a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. Various programs and data required for the operation of the ship loading equipment are also stored in the RAM 1004. The processing device 1001, the ROM 1002 and the RAM 1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems may be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 may allow the ship loading and stowage equipment to communicate with other devices wirelessly or by wire to exchange data. Although the figure shows the ship loading and stowage equipment with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have instead.

[0170] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0171] The loading and stowing equipment provided by the present application adopts the loading and stowing method in the above embodiment, which can solve the technical problem that the prior art cannot realize the whole ship loading and stowing that is easy to adjust. Compared with the prior art, the beneficial effects of the loading and stowing equipment provided by the present application are the same as the beneficial effects of the loading and stowing method provided by the above embodiment, and the other technical features of the loading and stowing equipment are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0172] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0173] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0174] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, and the computer-readable program instructions are used to execute the ship loading and stowage method in the above-mentioned embodiment.

[0175] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0176] The computer-readable storage medium may be included in the ship loading and stowing equipment; or it may exist independently without being assembled into the ship loading and stowing equipment.

[0177] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the loading and stowing equipment, the loading and stowing equipment: reads the container schedule of the target ship in the container terminal; combines the shipping containers in the yard according to the container schedule to obtain a string of shipping containers to be loaded; and performs loading and stowing on the target ship based on the string of shipping containers to be loaded to obtain a loading and stowing plan.

[0178] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0179] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0180] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0181] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned loading and stowing method, and can solve the technical problem that the prior art cannot realize the whole ship loading and stowing that is easy to adjust. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the loading and stowing method provided by the above-mentioned embodiment, and will not be repeated here.

[0182] The present application also provides a computer program product, including a computer program, which implements the steps of the above-mentioned ship loading and stowage method when executed by a processor.

[0183] The computer program product provided by the present application can solve the technical problem that the prior art cannot realize the whole ship loading and stowage that is easy to adjust. Compared with the prior art, the beneficial effects of the computer program product provided by the present application are the same as the beneficial effects of the loading and stowage method provided by the above embodiment, which will not be described in detail here.

[0184] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A method for loading and stowing, characterized in that: The method comprises: Read the container schedule of the target vessel in the container terminal; According to the container ship schedule, the shipping containers in the yard are combined to obtain a shipping container string to be loaded; Based on the string of containers to be loaded, the target ship is loaded and stowed to obtain a loading and stowage plan.

2. The method according to claim 1, characterized in that: The step of combining the shipping containers in the storage yard according to the container ship schedule to obtain a shipping container string to be loaded includes: According to the container ship schedule, corresponding yard data, shipping container data and pre-allocated item data are obtained; According to the yard data, the shipping container data and the pre-allocated item data, the shipping containers in the yard are combined to obtain a shipping container string to be loaded.

3. The method according to claim 1, characterized in that: The step of loading and stowing the target ship based on the string of containers to be loaded to obtain a loading and stowing plan comprises: Based on the string of containers to be loaded, a loading plan is performed on the shells on board the target ship to obtain a loading plan result; Based on the loading planning result, reordering the shellfish on the ship to obtain a loading reordering result; A loading and distributing plan is generated according to the loading and distributing results.

4. The method according to claim 3, characterized in that: The string of shipping containers to be loaded includes one or more string of shipping containers, and the step of performing loading planning on the shipboard shells of the target ship based on the string of shipping containers to be loaded to obtain the loading planning result includes: Constructing a planning search tree based on the pre-configured items of the target ship; The loading planning is performed on the shells on board the target ship through the planning search tree to obtain the loading planning result.

5. The method according to claim 4, characterized in that: The step of performing loading planning on the shells on board the target ship through the planning search tree to obtain a loading planning result comprises: Based on the preset planning penalty parameters and planning constraints, the unplanned shipping container strings in the to-be-loaded shipping container string are attempted to be planned into each remaining child node of the planning search tree for planning penalty calculation, and the remaining child node with the lowest planning penalty calculation value is obtained as the optimal child node; Repeat the planning penalty calculation until the to-be-loaded container string does not contain any unplanned container string, and obtain the optimal child nodes of all container strings in the to-be-loaded container string; According to the optimal child nodes of all the shipping container strings, the shipping planning result is obtained.

6. The method according to claim 3, characterized in that: The step of reordering the shellfish on the ship based on the shipment planning result to obtain the shipment reordering result comprises: Based on the shipment planning result, the planned shipment container strings on the ship are split and reorganized to obtain the shipment container strings to be sorted; Constructing a reordering search tree based on the shipping box string to be sorted; The shellfish on the ship are reordered for loading via the reordering search tree to obtain a loading reordering result.

7. A ship loading device, characterized in that: The device comprises: A reading module is used to read the container schedule of the target ship in the container terminal; A combination module, used for combining the shipping containers in the yard according to the container ship schedule to obtain a shipping container string to be loaded; The loading module is used to load the target ship based on the string of containers to be loaded, and obtain a loading plan.

8. A ship loading equipment, characterized in that: The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the ship loading and stowage method according to any one of claims 1 to 6.

9. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the ship loading and stowage method according to any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the ship loading and stowage method according to any one of claims 1 to 6 are implemented.

Images