A method and system for merging, turning over and loading containers at a port

Abstract

The present application provides a method and system for merging, turning over and loading containers at a port, which are applied in the field of port container technology. The present application identifies and prioritizes containers to be loaded by synchronizing the port operation plan in real time, and then dynamically generates a turning over plan using a heuristic algorithm based on the remaining time before loading. When time permits, a turning over plan is formulated for all containers to be loaded. When time is tight, high-priority containers are processed first to ensure that the most critical loading tasks are completed within a limited time, which significantly improves the efficiency of loading operations and reduces the number of unnecessary turning overs, thereby reducing operating costs and time loss. In addition, the priority of turning over containers is adjusted in real time according to the arrival time of the port ship, and the needs of containers of different priorities are flexibly responded to, port resources are effectively utilized, and the risk of cargo transportation delays is reduced, thereby enhancing the market competitiveness and customer satisfaction of container terminals.

Description

Technical Field

[0001] The present application relates to the technical field of port containers, and in particular to a method and system for merging, turning over and loading port containers. Background Art

[0002] As global trade continues to grow, container terminals are facing unprecedented pressure to handle more and more cargo in limited space and time. Therefore, container management before loading becomes particularly complex and critical at busy container terminals. However, traditional container management operations mainly rely on manpower scheduling and personal experience and judgment, which is not only inefficient but also prone to waste of resources.

[0003] In a busy port environment, the existing container consolidation solution cannot quickly adapt to the real-time changing operation plan and ship dynamics, and it is difficult to effectively handle the priority sorting and loading order of a large number of containers, which increases the operation cost and time loss. In addition, due to the lack of flexibility, the existing solution cannot make full use of the idle time between loading and unloading ships, resulting in low efficiency, increasing the risk of delays in cargo transportation, and seriously affecting the overall operational efficiency of the terminal.

[0004] Based on this, a new port container consolidation solution is needed. Summary of the invention

[0005] In view of this, the embodiments of this specification provide a port container merging, container turning and loading method and system, which are applied to the field of port container technology. The containers to be loaded are identified and prioritized by real-time synchronization of port operation plans, and then a heuristic algorithm is used to dynamically generate a container turning plan based on the remaining time before loading, so as to adapt to different operation plans and time constraints, flexibly adjust the container turning plan, improve the operating efficiency of port container terminals, reduce operating costs, optimize resource allocation, reduce the risk of cargo transportation delays, and thus enhance the market competitiveness and customer satisfaction of container terminals.

[0006] The embodiments of this specification provide the following technical solutions:

[0007] The embodiment of this specification provides a method for merging port containers, including:

[0008] According to the real-time operation plan of the port, determine the containers to be loaded corresponding to the operation plan in the yard bay, and assign corresponding priorities to the containers to be loaded;

[0009] According to the remaining time before loading corresponding to the operation plan, a container turning plan for all the containers to be loaded corresponding to the operation plan is formed based on a heuristic algorithm; wherein the remaining time before loading is the time interval from the completion of the loading and unloading task of the previous ship at the port to the arrival of the next ship, and the next ship is the ship corresponding to the operation plan; if the remaining time before loading is sufficient, a container turning plan is formed for all the containers to be loaded; if the remaining time before loading is insufficient, a container turning plan is formed preferentially for the containers to be loaded with high priority.

[0010] The embodiment of this specification also provides a port container turning method, which uses the port container merging method to turn the container;

[0011] High-priority containers are placed close to the loading area based on the port's real-time operational plan.

[0012] The embodiment of this specification also provides a port container loading method, which uses the port container merging method to turn the container over;

[0013] After the container turnover is completed, the port horizontal transportation equipment is used to transport the sorted containers to the loading location. The embodiment of this specification also provides a port container merging system, which includes a container priority allocation module and a container turnover plan generation module;

[0014] The container priority allocation module is used to determine the containers to be loaded corresponding to the operation plan in the yard according to the real-time operation plan of the port, and allocate corresponding priorities to the containers to be loaded;

[0015] The container turning plan generating module is used to form a container turning plan for all the containers to be loaded corresponding to the operation plan based on the heuristic algorithm according to the remaining time before loading corresponding to the operation plan; wherein the remaining time before loading is the time interval from the completion of the loading and unloading task of the previous ship at the port to the arrival of the next ship, and the next ship is the ship corresponding to the operation plan; if the remaining time before loading is sufficient, a container turning plan is formed for all the containers to be loaded; if the remaining time before loading is insufficient, a container turning plan is formed for the containers to be loaded with high priority first.

[0016] Compared with the prior art, the at least one technical solution adopted in the embodiments of this specification can achieve the following beneficial effects:

[0017] The present application identifies and prioritizes containers to be loaded by synchronizing the port operation plan in real time, and then dynamically generates a container turnover plan using a heuristic algorithm based on the remaining time before loading. When time permits, a container turnover plan is formulated for all containers to be loaded; when time is tight, high-priority containers are given priority to ensure that the most critical loading tasks are completed within a limited time, which significantly improves the efficiency of loading operations and reduces the number of unnecessary container turnovers, thereby reducing operating costs and time loss; in addition, the priority of container turnover is adjusted in real time according to the arrival time of the port ship, and flexible responses are made to container demands of different priorities, effectively utilizing port resources, and reducing the risk of cargo transportation delays, thereby enhancing the market competitiveness and customer satisfaction of container terminals. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0019] Figure 1 It is a flow chart of the method for merging containers before loading at a container terminal in the present application;

[0020] Figure 2 It is an actual container turning diagram of the container merging method before loading at the container terminal in this application;

[0021] Figure 3 It is an algorithm implementation diagram of the container merging method before loading at the container terminal in this application. DETAILED DESCRIPTION

[0022] The embodiments of the present application are described in detail below with reference to the accompanying drawings.

[0023] The following describes the implementation methods of the present application through specific examples, and those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. The present application can also be implemented or applied through other different specific implementation methods, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that, in the absence of conflict, the following embodiments and the features in the embodiments can be combined with each other. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work belong to the scope of protection of the present application.

[0024] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein can be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present application, it should be understood by those skilled in the art that an aspect described herein can be implemented independently of any other aspect, and two or more of these aspects can be combined in various ways. For example, any number and aspect described herein can be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein can be used to implement this device and / or practice this method.

[0025] It should also be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present application. The drawings only show components related to the present application rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.

[0026] Additionally, in the following description, specific details are provided to facilitate a thorough understanding of the examples. However, it will be understood by those skilled in the art that the examples can be practiced without these specific details.

[0027] In a busy container terminal, container management before loading is a complex and critical task. It is directly related to the terminal's operating efficiency, cost control, cargo safety, market competitiveness, customer satisfaction, etc. It is the core link to ensure smooth port operations and maximize economic benefits.

[0028] At present, the traditional container terminal relies on manpower scheduling and experience judgment to merge containers before loading. Due to the lack of effective container turnover scheduling strategy, containers often need to undergo multiple unnecessary container turnovers to complete the loading task, which not only wastes valuable operation time, but also increases operating costs and safety risks. Secondly, for containers of different priorities (such as export containers and pick-up containers), traditional methods are difficult to achieve flexible and timely responses, resulting in delays in some important goods.

[0029] In view of this, the inventors found through research and improvement exploration that the existing container merging scheme cannot quickly adapt to the real-time changing operation plan and ship dynamics, and it is difficult to effectively handle the priority sorting and loading order of a large number of containers. With the development of automated container terminals, how to make full use of the idle time between loading and unloading ships has become a new challenge. If these short idle times can be effectively utilized, the overall operational efficiency of the terminal will be greatly improved. However, existing scheduling algorithms often find it difficult to generate optimal or near-optimal solutions in a short period of time, especially when faced with a large number of containers to be processed and complex priority sorting.

[0030] Based on this, the embodiment of this specification proposes a method for merging port containers: Figure 1 As shown in the figure, the overall idea is: to identify the containers to be loaded and assign priorities through real-time synchronization of port operation plans, and then use heuristic algorithms to dynamically generate container turning plans based on the remaining time before loading. When time permits, a container turning plan is formulated for all containers to be loaded; when time is tight, high-priority containers are given priority to ensure that the maximum container sorting and loading preparation are completed within a limited time and space, which significantly improves the efficiency of loading operations and reduces the number of unnecessary container turnings, thereby reducing operating costs and time loss. In addition, by flexibly adjusting priorities, port resources are effectively utilized, reducing the risk of cargo transportation delays, thereby improving the market competitiveness and customer satisfaction of container terminals.

[0031] The technical solutions provided by various embodiments of the present application are described below in conjunction with the accompanying drawings.

[0032] like Figure 1 As shown, the embodiment of this specification provides a port container merging method, comprising:

[0033] According to the real-time operation plan of the port, determine the containers to be loaded corresponding to the operation plan in the yard bay, and assign corresponding priorities to the containers to be loaded;

[0034] According to the remaining time before loading corresponding to the operation plan, a container turning plan for all the containers to be loaded corresponding to the operation plan is formed based on a heuristic algorithm; wherein the remaining time before loading is the time interval from the completion of the loading and unloading task of the previous ship at the port to the arrival of the next ship, and the next ship is the ship corresponding to the operation plan; if the remaining time before loading is sufficient, a container turning plan is formed for all the containers to be loaded; if the remaining time before loading is insufficient, a container turning plan is formed preferentially for the containers to be loaded with high priority.

[0035] Specifically, a heuristic algorithm is used to efficiently sort the containers to be loaded in advance during the idle period of the yard. First, the Terminal Operating System (TOS) identifies the containers to be loaded in the yard bays, and then assigns them priorities according to the port's real-time operation plan.

[0036] Subsequently, the TOS system will evaluate the remaining time before loading and determine whether the conditions for the container transfer operation are met. If conditions permit, the system will generate a container transfer plan for all containers to be loaded through a heuristic algorithm, while paying special attention to high-priority containers to optimize loading efficiency. If time is tight, the system will only generate a container transfer plan for high-priority containers to be loaded to ensure that the most critical loading task is completed within a limited time.

[0037] The remaining time before loading is the idle time generated when the sea-surface part of the cantilever of the two-end container area in the automated container terminal cannot interact with the external container truck on the land side, completing the loading and unloading task of the previous ship and before the arrival of the next ship.

[0038] By giving priority to high-priority containers, this application enables the terminal to more efficiently utilize limited resources, such as yard space and handling equipment. In addition, the system can dynamically adjust the priority of container turnover according to the real-time changes in the port operation plan and the actual situation of the ship's arrival at the port, and flexibly respond to different operation needs.

[0039] The present invention effectively utilizes the idle period of the yard, significantly improves the efficiency of the loading operation, and reduces the number of unnecessary container unloading, effectively reducing the operating cost and time loss, thereby optimizing the operation process of the entire terminal.

[0040] In some embodiments, determining the containers to be loaded corresponding to the operation plan in the storage yard according to the real-time operation plan of the port, and assigning corresponding priorities to the containers to be loaded, includes:

[0041] Dynamically adjusting the priority of the containers to be loaded according to the operation plan;

[0042] When shipment planning takes precedence, give export boxes high priority;

[0043] When the crossing pick-up plan takes priority, the pick-up will be given high priority.

[0044] Specifically, the TOS system obtains the loading status of ships entering the port, determines the storage status of the yard at each moment, and performs scheduling based on the container type, yard conditions, and equipment operation status.

[0045] The TOS system assigns container priorities based on the operation plan. When the loading plan is prioritized, export containers will be given a higher priority to ensure that they can be loaded on time. On the contrary, when the crossing pick-up plan is prioritized, the pick-up task has a higher priority to meet the customer's pick-up needs.

[0046] The TOS system will continuously adjust the scheduling plan based on real-time changes to ensure the continuity and efficiency of terminal operations.

[0047] In some embodiments, forming a container turnover plan for all containers to be loaded on the ship corresponding to the operation plan based on a heuristic algorithm includes:

[0048] S301, assigning weights to each column of containers in the container yard according to the score definition method, wherein the weight of the column of containers that do not need to be turned over is assigned to the first weight, and the column of containers that need to be turned over is assigned a corresponding weight according to the number of times the containers are turned over;

[0049] S302, calculating the sum of weighted scores of each column of containers, and obtaining the column of containers with the highest sum of weighted scores;

[0050] S303, moving the container at the top of the container row with the highest weight score to a row that does not affect other containers;

[0051] S304. After the container transfer operation is completed, steps S301-S303 are repeated until all column weights are the first weight or the preset number of iterations is reached, and a container transfer plan for the container to be loaded is generated.

[0052] Specifically, Figure 2 For example, according to the score definition method, a weight is assigned to each column of containers in the yard. If there are no containers that need to be turned over in the first and second columns, the weight is 0. If there is a container that needs to be turned over once in the third column, the weight of this column is 10. If there is a container that needs to be turned over once and a container that needs to be turned over twice in the fourth column, the weight of this column is 29. The total score under this plan is 39, which is the current score of this plan.

[0053] After the score definition is completed, the port TOS system will perform container transfer according to the algorithm allocation. The solution calculated by the algorithm includes the following steps:

[0054] S1. Move the top container of the row with the highest weight. The top container is moved to the first row without affecting other containers.

[0055] S2. After completing the box transfer process, re-weight all columns, select the column with the highest weight and repeat step S1.

[0056] S3, repeat steps S1-S2 until all column weights are 0 or the number of times specified by the algorithm is reached. At this time, the containers in the bay are turned over and sorted, and the container positioning information is regenerated for packing activities.

[0057] In some embodiments, for a container sequence that needs to be turned over, the more times the container sequence is turned over, the higher the weight assigned to the container sequence.

[0058] Specifically, according to the loading plan, find the column where the container that needs to be loaded exists. If the container does not need to be turned over, the weight of this column is defined as 0. If the container needs to be turned over once, the weight of this column is defined as 10. If the container needs to be turned over twice, the weight of this column is defined as 19, and so on.

[0059] In some embodiments, the first container in each column that needs to be turned over is assigned a basic weight, and the weight increases by a preset value each time the container is turned over.

[0060] Specifically, for each column of containers, if there is at least one container that needs to be turned over in the column, then the first container in the column that needs to be turned over will be assigned a basic weight, which is an initial score used to indicate the starting cost or priority of the turning operation.

[0061] Then, based on the basic weight, for each additional container that needs to be turned over, the weight of the column will increase by a preset value to reflect the cumulative cost or complexity of the turning operation.

[0062] The specific value of the weight increment can be set based on different factors, such as the difficulty of the box-turning operation, the time required, the resource consumption, historical data, actual experience, etc.

[0063] For example, you can set the weight to increase by 5 points each time you turn over a box to facilitate calculation and comparison.

[0064] For example, based on the operating data of a specific terminal, the basic weight can be set to 10, and the weight increment sequence can be (9, 6, 4, 2, 1). When a column needs to be turned over once, the weight of the corresponding container column is 10. When a column needs to be turned over twice, the weight of the corresponding container column is 19 (10+9). When a column needs to be turned over three times, the weight of the corresponding container column is 25 (10+9+6), and so on.

[0065] For example, you can set a maximum weight for controlling the box flipping operation to avoid excessive weights affecting the optimization effect of the algorithm.

[0066] In some embodiments, forming a container turnover plan for all containers to be loaded on the ship corresponding to the operation plan based on a heuristic algorithm includes:

[0067] Based on the genetic algorithm, each container turning demand to be loaded is encoded as a chromosome, wherein the turning demand includes: whether the container needs to be turned over and the target column of the turning;

[0068] generating an initial population, wherein a chromosome in the initial population represents a box-turning scheme;

[0069] Define a fitness function based on the number of container turns, container turn cost, operation efficiency, and container priority to evaluate the pros and cons of each container turn plan;

[0070] Calculate the fitness of each chromosome and select the chromosome with the best fitness from the current population as the offspring;

[0071] The offspring generated based on the parent generation are mutated, and in the column of containers that need to be turned over, the column of containers with the best fitness is selected for mutation to generate a new offspring population, and the fitness of the turning over scheme is repeatedly calculated, and it is iterated repeatedly until the termination condition is met, and the turning over plan of the container to be loaded is generated.

[0072] In some embodiments, the box flipping operation is generated by integrating the score definition with the genetic algorithm, including:

[0073] Generate an initial population according to the weights, wherein a chromosome in the initial population represents a box-turning scheme;

[0074] Calculate the sum of weighted scores of all container columns to obtain the sum of weights of each container turnover plan;

[0075] Select the first N box-turning solutions with the lowest total weights from the initial population as offspring, and determine whether there is still box-turning activity in the column after the box is moved, where N represents the number;

[0076] If it does not exist, the gene value corresponding to the column is set to the first gene value, where the first gene value is a specific value, indicating the gene value corresponding to the weight of the container column that does not need to be turned over;

[0077] On the contrary, the offspring generated based on the parent generation is mutated, and in the column of containers that need to be turned over, the column of containers with the highest weight is selected for mutation to generate a new offspring population, and the sum of the weights of the turning scheme is repeatedly calculated until the termination condition is met, and the turning plan for the container to be loaded is generated.

[0078] Specifically, Figure 2 As shown in the figure, first, the initial population is generated according to the weights calculated by the score definition method, in which each chromosome represents a potential container turning plan. At the same time, the weight score and the weight of the container column are calculated for each container turning plan in the initial population (the plan generated by each chromosome), and the total weight of each plan is obtained to evaluate the efficiency and cost of the plan.

[0079] Next, the top N container turning plans (chromosomes) with the lowest weight scores in the population are taken as offspring. For these offspring plans, it is further determined whether each container column needs to be turned over after the container is moved. If it is no longer necessary to turn over the container, the gene corresponding to the column is set to 100 to speed up the search.

[0080] It should be noted that if there is no need to turn over containers anymore, you only need to set the gene value corresponding to the column high enough, such as setting it to 200, to indicate that the turning over task of the column has been completed, so as to distinguish it from other values ​​in the weight sequence and ensure that the algorithm can recognize that these container columns do not need further turning over operations.

[0081] For the container columns that still need to be turned over, select the column with the highest weight, and continue to perform mutation operations based on the optimal offspring generated by the parent generation to explore a better turning-over solution. Use the mutated chromosome as the new parent generation, calculate the sum of the weights of each new solution again, select the offspring with the lowest sum of weights, and then continue to mutate the column with the highest weight in the new offspring, and repeat this cycle.

[0082] Through continuous iteration, the container turning plan is gradually optimized until the termination conditions are met, such as the sum of the weights of all container columns is 0, or the preset number of iterations is reached. At this time, the containers in the bay are turned over and sorted, and the container positioning information is regenerated for loading activities. This not only improves the efficiency of loading operations, but also reduces the number of unnecessary container turnings, reduces operating costs and time loss, and improves the terminal's operating efficiency and customer satisfaction.

[0083] In some embodiments, before generating the initial population, the corresponding gene values ​​are set according to the weights;

[0084] Among them, for the container column with the first weight, the corresponding gene value on the chromosome is set to the first gene value;

[0085] For the container column whose weight is not the first weight, the corresponding gene value on the chromosome is set to the second gene value;

[0086] Among the container columns whose weights are not the first weight, the container column with the highest weight is selected for mutation, and the corresponding gene value is changed from the first weight to x, where x represents the number of the target column to which the container needs to be moved.

[0087] Specifically, Figure 3 As shown in the figure, in the improved genetic algorithm, the population is first defined. In order to reduce the number of iterations and find a better solution more quickly, the gene value corresponding to the column that does not need to be turned over in the score definition method (column with a weight of 0) is set to 100 to ensure that the adjusted column will not be adjusted too much and the gene will not be mutated on this chromosome.

[0088] The corresponding genes of the columns with box flipping activities (columns with weights not equal to 0) are set to 0, and the corresponding genes with the highest weights in the columns are selected for mutation. 1, 2, 3...x in the genes represent the corresponding column numbers to which the box moves. After the initial population setting is completed, the algorithm is iterated to select a better population.

[0089] In some embodiments, the algorithm generates an initial population based on the weights calculated by the score definition method, and performs weight calculations on the schemes generated for each chromosome. The chromosome with the smallest weight score in the population is taken as the offspring. At the same time, it is determined whether there is any box-turning activity in the column after the box is moved. If not, the gene corresponding to the column is set to 100 to speed up the search.

[0090] In some embodiments, the fusion genetic algorithm combines whether the container is turned over and to which column it is turned with the chromosome encoding, and selects the weight score of the plan after turning over and the lowest TOP10 population through the weight score calculated in the score definition for iterative calculation until the total score is 0 or the number of moves is greater than 20.

[0091] In some embodiments, the port container merging method further includes manually adjusting the weight of the column where the container to be adjusted is located, so as to change the container turnover priority.

[0092] Specifically, due to the timeliness and variability of port plans, if there is a high-priority container at this time, the weight of the container existence column can be manually increased through the algorithm to give priority to completing the container turning activity of the container.

[0093] If the remaining time before loading is insufficient, the column weight corresponding to the low-priority container can be set to 0, and the container turning activity of this column will not be arranged temporarily, and the high-priority container will be given priority to perform the container turning task.

[0094] In some embodiments, the heuristic algorithm can adjust parameters according to actual conditions to complete large-scale container turnover plan generation in a short period of time, ensuring that high-priority containers are given priority processing to improve the terminal's operating efficiency and meet shipping schedule requirements.

[0095] For example, setting the number or depth of iterations.

[0096] For example, by adjusting the weight of the column where the container is located, the priority of the container can be changed.

[0097] For example, performing calculations in a limited time and quickly obtaining an acceptable solution.

[0098] For example, a threshold for container robbing can be set based on the actual situation of multiple ships arriving at the port to complete the task of robbing containers with higher priority. For example, if multiple ships are about to arrive at the terminal, a threshold can be set to ensure that high-priority containers can be robbing in time and ready for loading.

[0099] The present application can utilize the idle period between loading and unloading ships to pre-sort the containers that need to be loaded in the bay, and can adjust the priority of the containers to be loaded in real time according to the arrival time of the port ship, giving priority to processing high-priority containers, thereby improving the efficiency of the loading operation, while reducing the number of unnecessary container unloading times, thereby reducing operating costs and time loss.

[0100] Based on the same inventive concept, the present application also provides a container turning method based on a merging method, which uses the port container merging method described in any one of the embodiments of the present application to turn the container;

[0101] High-priority containers are placed close to the loading area based on the port's real-time operational plan.

[0102] Based on the same inventive concept, the present application also provides a loading method based on a merging method, which uses the port container merging method described in any one of the embodiments of the present application to perform container turning;

[0103] After the tumbling is completed, the port's horizontal transportation equipment is used to transport the sorted containers to the loading location.

[0104] Based on the same inventive concept, the present application also provides a port container merging system, which includes a container priority allocation module and a container turnover plan generation module;

[0105] The container priority allocation module is used to determine the containers to be loaded corresponding to the operation plan in the yard according to the real-time operation plan of the port, and allocate corresponding priorities to the containers to be loaded;

[0106] The container turning plan generating module is used to form a container turning plan for all the containers to be loaded corresponding to the operation plan based on the heuristic algorithm according to the remaining time before loading corresponding to the operation plan; wherein the remaining time before loading is the time interval from the completion of the loading and unloading task of the previous ship at the port to the arrival of the next ship, and the next ship is the ship corresponding to the operation plan; if the remaining time before loading is sufficient, a container turning plan is formed for all the containers to be loaded; if the remaining time before loading is insufficient, a container turning plan is formed for the containers to be loaded with high priority first.

[0107] In this specification, the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the embodiments described later, the description is relatively simple, and the relevant parts can be referred to the partial description of the previous embodiments.

[0108] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A method for merging containers at a port, characterized in that: include: According to the real-time operation plan of the port, determine the containers to be loaded corresponding to the operation plan in the yard bay, and assign corresponding priorities to the containers to be loaded; According to the remaining time before loading corresponding to the operation plan, a container turning plan for all the containers to be loaded corresponding to the operation plan is formed based on a heuristic algorithm; wherein the remaining time before loading is the time interval from the completion of the loading and unloading task of the previous ship at the port to the arrival of the next ship, and the next ship is the ship corresponding to the operation plan; if the remaining time before loading is sufficient, a container turning plan is formed for all the containers to be loaded; if the remaining time before loading is insufficient, a container turning plan is formed for the containers to be loaded with high priority first; The container turnover plan for all the containers to be loaded on the ship corresponding to the operation plan formed based on the heuristic algorithm includes: S301, assigning weights to each column of containers in the container yard according to a score definition method, wherein the score definition method includes: assigning a weight of a column of containers that do not need to be turned over to a first weight; for a column of containers that need to be turned over, calculating a sum of weight scores according to the number of times the columns are turned over, and assigning the sum to the weight of the column; S302, according to the weight of each column of containers, obtaining the column of containers with the highest weight; S303, moving the container at the top of the container row with the highest weight to a row that does not affect other containers; S304. After the container transfer operation is completed, steps S301-S303 are repeated until all column weights are the first weight or the preset number of iterations is reached, and a container transfer plan for the container to be loaded is generated.

2. The port container merging method according to claim 1, characterized in that: The method of determining the containers to be loaded corresponding to the operation plan in the storage yard according to the real-time operation plan of the port, and assigning corresponding priorities to the containers to be loaded, includes: Dynamically adjusting the priority of the containers to be loaded according to the operation plan; When shipment planning takes precedence, give export boxes high priority; When the crossing pick-up plan takes priority, the pick-up will be given high priority.

3. The port container merging method according to claim 1, characterized in that: The first container in each column that needs to be turned over is assigned a basic weight, and the weight increases by a preset value each time the container is turned over.

4. The port container merging method according to claim 1, characterized in that: The container turnover plan for all the containers to be loaded on the ship corresponding to the operation plan formed based on the heuristic algorithm includes: Based on the genetic algorithm, each container turning demand to be loaded is encoded as a chromosome, wherein the turning demand includes: whether the container needs to be turned over and the target column of the turning; generating an initial population, wherein a chromosome in the initial population represents a box-turning scheme; A fitness function is defined according to at least one condition: the number of container turning, the cost of container turning, the operation efficiency or the priority of the container, so as to evaluate the pros and cons of each container turning scheme; Calculate the fitness of each chromosome and select the chromosome with the best fitness from the current population as the offspring; The offspring generated based on the parent generation are mutated, and in the column of containers that need to be turned over, the column of containers with the best fitness is selected for mutation to generate a new offspring population, and the fitness of the turning over scheme is repeatedly calculated, and it is iterated repeatedly until the termination condition is met, and the turning over plan of the container to be loaded is generated.

5. The port container merging method according to claim 1, characterized in that: The box turning plan is generated by integrating the score definition with the genetic algorithm, including: Generate an initial population according to the weights, wherein a chromosome in the initial population represents a box-turning scheme; Calculate the sum of weighted scores of all container columns to obtain the sum of weights of each container turnover plan; Select the first N box-turning solutions with the lowest total weights from the initial population as offspring, and determine whether there is still box-turning activity in the column after the box is moved, where N represents the number; If it does not exist, the gene value corresponding to the column is set to the first gene value, where the first gene value is a specific value, indicating the gene value corresponding to the weight of the container column that does not need to be turned over; On the contrary, the offspring generated based on the parent generation is mutated, and in the column of containers that need to be turned over, the column of containers with the highest weight is selected for mutation to generate a new offspring population, and the sum of the weights of the turning scheme is repeatedly calculated until the termination condition is met, and the turning plan for the container to be loaded is generated.

6. The method for merging port containers according to claim 5, characterized in that: Before generating the initial population, set the corresponding gene value according to the weight; Among them, for the container column with the first weight, the corresponding gene value on the chromosome is set to the first gene value; For the container column whose weight is not the first weight, the corresponding gene value on the chromosome is set to the second gene value; Among the container columns whose weights are not the first weight, the container column with the highest weight is selected for mutation, and the corresponding gene value is changed from the first weight to x, where x represents the number of the target column to which the container needs to be moved.

7. The port container merging method according to claim 1, characterized in that: The port container merging method also includes manually adjusting the weight of the column where the container to be adjusted is located, so as to change the priority of the container turnover.

8. A method for turning over containers at a port, characterized in that: Utilizing the port container merging method as described in any one of claims 1 to 7 to perform container turning; High-priority containers are placed close to the loading area based on the port's real-time operational plan.

9. A method for loading containers at a port, characterized in that: Utilizing the port container merging method as described in any one of claims 1 to 7 to perform container turning; After the tumbling is completed, the port's horizontal transportation equipment is used to transport the sorted containers to the loading location.

10. A port container merging system, characterized in that: The port container merging system includes a container priority allocation module and a container turnover plan generation module; The container priority allocation module is used to determine the containers to be loaded corresponding to the operation plan in the yard according to the real-time operation plan of the port, and allocate corresponding priorities to the containers to be loaded; The container turning plan generating module is used to form a container turning plan for all the containers to be loaded corresponding to the operation plan based on the heuristic algorithm according to the remaining time before loading corresponding to the operation plan; wherein the remaining time before loading is the time interval from the completion of the loading and unloading task of the previous ship at the port to the arrival of the next ship, and the next ship is the ship corresponding to the operation plan; if the remaining time before loading is sufficient, a container turning plan is formed for all the containers to be loaded; if the remaining time before loading is insufficient, a container turning plan is formed for the containers to be loaded with high priority first; The container turnover plan for all the containers to be loaded on the ship corresponding to the operation plan formed based on the heuristic algorithm includes: S301, assigning weights to each column of containers in the container yard according to a score definition method, wherein the score definition method includes: assigning a weight of a column of containers that do not need to be turned over to a first weight; for a column of containers that need to be turned over, calculating a sum of weight scores according to the number of times the columns are turned over, and assigning the sum to the weight of the column; S302, according to the weight of each column of containers, obtaining the column of containers with the highest weight; S303, moving the container at the top of the container row with the highest weight to a row that does not affect other containers; S304. After the container transfer operation is completed, steps S301-S303 are repeated until all column weights are the first weight or the preset number of iterations is reached, and a container transfer plan for the container to be loaded is generated.

Images