Container unloading stacking planning method, device, equipment and storage medium

Abstract

The present application discloses a method, device, equipment, and storage medium for stacking location planning for container unloading. The method includes: clustering containers by type for the first time to obtain a set of containers of different types as a first set; clustering each first set for the second time according to the size and transportation time of the containers to obtain a second set; calculating the sum of the distances from the unloading position of each container in the second set to the stacking location for each container unloading, and constructing a distance matrix as a matrix element; constructing several auxiliary matrices; multiplying the distance matrix with each auxiliary matrix to obtain a corresponding target matrix, and calculating the sum of each element in the target matrix to obtain the path length under different combinations; determining the target matrix corresponding to the shortest path length as the optimal target matrix, and determining the stacking location planning for container unloading based on the auxiliary matrix corresponding to the optimal target matrix. In this way, the unloading efficiency can be improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the technical field of stacking location planning, and in particular to a stacking location planning method, apparatus, device, and storage medium for container unloading. Background Art

[0002] As the storage area for containers entering and leaving a terminal, the container yard's turnover rate has a crucial impact on a terminal's throughput. Choosing a sound yard storage strategy can help improve cargo handling efficiency at a container terminal, thereby maximizing the terminal's cargo throughput and increasing the speed and efficiency of cargo loading and unloading. Given sufficient berths and a certain yard capacity, the efficiency of container turnover within the yard is a key factor in measuring a container terminal's throughput capacity.

[0003] Currently, after the arrival of containers, the stacking locations of the containers in the yard are usually planned manually based on experience. The personnel responsible for container yard scheduling have a heavy workload and find it difficult to plan the stacking locations of the containers in the optimal way, making it difficult to unload the containers in the yard with the highest efficiency. Summary of the Invention

[0004] The embodiments of the present application provide a method, apparatus, device, and storage medium for stacking planning of container unloading, which can improve the efficiency of container unloading.

[0005] In a first aspect, an embodiment of the present application provides a method for stacking location planning for container unloading, comprising:

[0006] Clustering the containers for the first time according to their types to obtain sets of containers of different types, and using the sets of containers as the first set;

[0007] For each of the first sets, clustering is performed a second time according to the size and transportation time of the containers to obtain a second set;

[0008] For each container unloading location, calculate the sum of the distances from the unloading locations of each container in the second set to the location, and use the sum as matrix elements to construct a distance matrix; wherein the number of rows of the distance matrix is ​​equal to the number of the locations, and the number of columns of the distance matrix is ​​equal to the number of the second sets;

[0009] Constructing several auxiliary matrices; wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and other elements in the auxiliary matrix are 0;

[0010] Multiplying the distance matrix with each of the auxiliary matrices to obtain a corresponding target matrix, and calculating the sum of each element in the target matrix to obtain the path length under different combinations;

[0011] A target matrix corresponding to the shortest path length is determined as an optimal target matrix, and a stacking plan for the container unloading is determined based on an auxiliary matrix corresponding to the optimal target matrix.

[0012] In a second aspect, an embodiment of the present application provides a stacking planning device for rapid unloading at a container terminal, comprising:

[0013] A first clustering module is used to perform a first clustering of containers according to their types to obtain a set of containers of different types, and use the set of containers as a first set;

[0014] A second clustering module is configured to perform a second clustering on each of the first sets according to the size and shipping time of the containers to obtain a second set;

[0015] a distance matrix construction module, configured to calculate, for each container unloading location, the sum of the distances from the unloading locations of the containers in the second set to the location, and use the sum of the distances as matrix elements to construct a distance matrix, wherein the number of rows of the distance matrix is ​​equal to the number of the locations, and the number of columns of the distance matrix is ​​equal to the number of the second sets;

[0016] An auxiliary matrix construction module is used to construct several auxiliary matrices, wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and other elements in the auxiliary matrix are 0;

[0017] a path length calculation module, configured to multiply the distance matrix by each of the auxiliary matrices to obtain a corresponding target matrix, and calculate the sum of the elements in the target matrix to obtain the path length under different combinations;

[0018] The planning module is used to determine a target matrix corresponding to the shortest path length as an optimal target matrix, and determine the stacking planning of the container unloading based on an auxiliary matrix corresponding to the optimal target matrix.

[0019] In a third aspect, an embodiment of the present application provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the method provided in the embodiment of the present application is implemented.

[0020] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed in a computer, it enables the computer to execute the method provided in the embodiment of the present application.

[0021] The technical solution provided by the embodiment of the present application is to cluster the containers for the first time according to their types to obtain a first set, and to cluster them for the second time according to the sizes and transportation times of the containers to obtain a second set. For each stacking location for unloading of containers, the sum of the distances from the unloading positions of the containers in the second set to the stacking location is calculated, and a distance matrix is ​​constructed as a matrix element. By constructing several auxiliary matrices, the distance matrix and the auxiliary matrix are multiplied to obtain a corresponding target matrix. The sum of the elements in the target matrix is ​​calculated to obtain the path length under different combinations. The target matrix corresponding to the shortest path length is determined, and the corresponding auxiliary matrix is ​​determined. The stacking location planning for container unloading is determined by the auxiliary matrix. That is, the technical solution provided by the embodiment of the present application takes into account the types, sizes and transportation times of containers during stacking location planning. Stacking location planning is achieved by constructing distance matrices and auxiliary matrices. The algorithm is simple to implement and can improve the efficiency of container unloading. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 A flow chart of a container unloading stacking planning method provided in an embodiment of the present application;

[0023] Figure 2 A structural block diagram of a container unloading stacking planning device provided in an embodiment of the present application;

[0024] Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0025] The present application is further described in detail below through the accompanying drawings and specific implementation methods.

[0026] Figure 1 This is a flow chart of a stacking location planning method for container unloading provided in an embodiment of the present application. The method can be executed by a stacking location planning device for container unloading. The device can be implemented by software and / or hardware. The method can be configured in electronic devices such as computers. The method can be applied to planning scenarios for container unloading at terminals.

[0027] like Figure 1 As shown, the method provided in the embodiment of the present application may include the following steps:

[0028] S110: Clustering the containers for the first time according to their types to obtain sets of containers of different types, and using the sets of containers as the first set.

[0029] In this example, containers are clustered twice: the first clustering is based on type, and the second clustering is based on container size and shipping time. Containers are categorized by cargo type into general cargo, empty, hazardous materials, and refrigerated containers. Containers can also be categorized by other methods.

[0030] In this embodiment, clustering the containers for the first time according to their types to obtain sets of containers of different types includes: grouping containers of the same type into one container set;

[0031] The first set includes the following:

[0032]

[0033] :

[0035]

[0036] in, For the first set, is the e-th container in the 1st set;

[0037] For the second first set, is the fth container in the second first set;

[0038] is the pth first set, is the g-th container in the p-th first set.

[0039] S120: For each of the first sets, perform a second clustering based on the size and transportation time of the containers to obtain a second set.

[0040] In this embodiment, optionally, for each of the first sets, a second clustering is performed according to the size of the container and the transportation time to obtain a second set, including: for each first set, the containers whose length is within a preset length range, whose width is within a preset width range, and whose transportation time is within a preset time range are grouped into one set to obtain the second set.

[0041] Specifically, in the first set that satisfies the constraints of the first clustering In the container, you can Classify by size and estimated shipping time, among which the container length can be Within, width Within, the transport time is The containers are grouped into one set, and a second set that satisfies the second clustering constraint is obtained.

[0042] Among them, the following conditions are met:

[0043]

[0044] in, is the mth container in the pth first set, is the allowable length error; is the allowable width error; is the allowable time error. 、 and are the length, width and transportation time of the mth container in the pth first set respectively.

[0045] The second set includes the following:

[0046] :

[0048]

[0049] in, For the 1st second set; is the qth container in the 1st second set;

[0050] is the t-th second set, is the jth container in the tth second set.

[0051] S130: For each container unloading location, calculate the sum of the distances from the unloading positions of each container in the second set to the location, and use the sum as matrix elements to construct a distance matrix, wherein the number of rows of the distance matrix is ​​equal to the number of the locations; and the number of columns of the distance matrix is ​​equal to the number of the second sets.

[0052] In this embodiment, optionally, for each container unloading location, the sum of the distances from the unloading locations of the containers in the second set to the location is calculated, and used as a matrix element to construct a distance matrix, including:

[0053] Obtain the first second set as the current second set; take the first stack position as the current stack position, calculate the sum of the distances from the unloading position of each container in the current second set to the current stack position, and use it as the target distance; take the next stack position as the current stack position, return to calculate the sum of the distances from the unloading position of each container in the current second set to the current stack position, until the last stack position is reached, and form the columns of the distance matrix based on the respective target distances; take the next second set as the current second set, return to the step of taking the first stack position as the current stack position, until the last second set is reached, and obtain the distance matrix.

[0054] Specifically, calculate Collection container The distances from the unloading position to the first stacking position are , Collection container The distance from the unloading location to the kth stack is , Collection container The distance from the unloading location to the first stacking position is ,container The distance from the unloading location to the kth stack is , based on the above distance, is constructed as k is the number of stacks, and t is the number of second sets, which is the number of first sets classified by container size and shipping time.

[0055] Among them, the distance matrix is:

[0056]

[0057] In the above distance matrix, the sum of the distances from the unloading location to the stacking location of each container in the second set is used as an element in the distance matrix. The sum of the distances from each container in the collection to the stack is taken as the element of the first column of the distance matrix. The sum of the distances from each container in the set to the stack location is taken as the last column of the distance matrix, i.e. the tth column.

[0058] S140: Constructing several auxiliary matrices, wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and the other elements in the auxiliary matrix are 0.

[0059] In this embodiment, several Auxiliary matrix. The number of auxiliary matrices can be .

[0060] Among them, the auxiliary matrix

[0061] Among them, the auxiliary matrix By adjusting the positions of 0 and 1 in each row of the auxiliary matrix, it is ensured that there is only one element 1 in each row of the auxiliary matrix, and at the same time, it is ensured that there is only one element 1 in each column of the auxiliary matrix, and the other elements in the auxiliary matrix are all 0.

[0062] S150: Multiplying the distance matrix with each auxiliary matrix to obtain a corresponding target matrix, and calculating the sum of each element in the target matrix to obtain the path length under different combinations.

[0063] In this embodiment, specifically, the distance matrix can be transformed into a matrix With the auxiliary matrix 、 、 ... Multiply to get the target matrix 、 、 .... .

[0064]

[0065]

[0066] :

[0068]

[0069] Find the target matrix separately 、 、 .... The sum of all elements in , .... , forming a set .

[0070]

[0071] Among them, in the collection The elements in are the sum of all elements in each target matrix, thus obtaining the path length under different combinations.

[0072] S160: Determine a target matrix corresponding to the shortest path length as an optimal target matrix, and determine a stacking plan for container unloading based on an auxiliary matrix corresponding to the optimal target matrix.

[0073] In this embodiment, in the stack planning, it is necessary to select the shortest path length for planning. Therefore, it is necessary to find the target matrix corresponding to the shortest path length. , as the optimal target matrix, determine the auxiliary matrix corresponding to the optimal target matrix , based on the auxiliary matrix Determine the stacking plan for container unloading. Find the smallest element in ,Should The corresponding target matrix , get the target matrix The corresponding auxiliary matrix .

[0074] In this embodiment, optionally, determining the stacking location planning for container unloading based on the auxiliary matrix corresponding to the optimal target matrix includes: in the auxiliary matrix corresponding to the optimal target matrix, sequentially determining the target column with elements of 1 in each row, and sequentially placing the containers in each second set into the stacking location corresponding to the target column. , the meaning of each column element being 1 can be understood as the stacking position where the container in the second set is placed when the path length is the shortest. Therefore, the column sorting number of the target column in the auxiliary matrix is ​​equal to the sorting number of the stacking position.

[0075] Optionally, in the auxiliary matrix corresponding to the optimal target matrix, determining target columns whose elements in each row are 1 in sequence, and placing the containers in the second set in sequence into the stacking locations corresponding to the target columns, includes:

[0076] In the auxiliary matrix corresponding to the optimal target matrix, if the ath row and the mth b If the column is 1, put the container in the ath second set into the mth b In the stack; where a is greater than or equal to 1 and less than or equal to t, b is greater than or equal to 1 and less than or equal to k; m b is greater than or equal to 1 and less than or equal to k; where t and k are the number of rows and columns of the auxiliary matrix corresponding to the optimal target matrix, t is equal to the number of the second set, and k is equal to the number of stacks. Specifically, if the m1th column of the 1st row is 1, the m2th column of the 2nd row is 1, and so on until the mth column of the tth row is 1, k If the column is 1, the The containers in the collection are placed in the m1th stack and the The containers in the collection are placed in the m2th stack until the The container in the collection is placed in the mth k A stack position.

[0077] The technical solution provided by the embodiment of the present application is to cluster the containers for the first time according to their types to obtain a first set, and to cluster them for the second time according to the sizes and transportation times of the containers to obtain a second set. For each stacking location for unloading of containers, the sum of the distances from the unloading positions of the containers in the second set to the stacking location is calculated, and a distance matrix is ​​constructed as a matrix element. By constructing several auxiliary matrices, the distance matrix and the auxiliary matrix are multiplied to obtain a corresponding target matrix. The sum of the elements in the target matrix is ​​calculated to obtain the path length under different combinations. The target matrix corresponding to the shortest path length is determined, and the corresponding auxiliary matrix is ​​determined. The stacking location planning for container unloading is determined by the auxiliary matrix. That is, the technical solution provided by the embodiment of the present application takes into account the types, sizes and transportation times of containers during stacking location planning. Stacking location planning is achieved by constructing distance matrices and auxiliary matrices. The algorithm is simple to implement and can improve the efficiency of container unloading.

[0078] It should be noted that the stacking location planning for container unloading can also be implemented using artificial intelligence. Specifically, the historical data of the stacking location for container unloading can be input into the machine learning model for training, and the optimization direction can be specified. The optimal stacking location planning can be obtained based on the trained machine learning model.

[0079] Figure 2 This is a structural block diagram of a container unloading stacking planning device provided in an embodiment of the present application, such as Figure 2 As shown, the device includes:

[0080] A first clustering module 210 is configured to perform a first clustering of containers by type to obtain a set of containers of different types, and use the set of containers as a first set;

[0081] A second clustering module 220 is configured to perform a second clustering on each of the first sets according to the size and shipping time of the containers to obtain a second set;

[0082] a distance matrix construction module 230 for calculating, for each container unloading location, the sum of the distances from the unloading locations of the containers in the second set to the location, and using the sum of the distances as matrix elements to construct a distance matrix, wherein the number of rows of the distance matrix is ​​equal to the number of the locations, and the number of columns of the distance matrix is ​​equal to the number of the second sets;

[0083] An auxiliary matrix construction module 240 is configured to construct a plurality of auxiliary matrices, wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and all other elements in the auxiliary matrix are 0;

[0084] A path length calculation module 250 is configured to multiply the distance matrix by each auxiliary matrix to obtain a corresponding target matrix, and calculate the sum of each element in the target matrix to obtain the path length under different combinations;

[0085] The planning module 260 is configured to determine a target matrix corresponding to the shortest path length as an optimal target matrix, and determine a stacking plan for the container unloading based on an auxiliary matrix corresponding to the optimal target matrix.

[0086] In an optional embodiment, the first clustering of containers by type to obtain sets of containers of different types includes:

[0087] Group containers of the same type into one container set;

[0088] The first set includes the following:

[0089]

[0090] :

[0092]

[0093] in, For the first set, is the mth container in the first set;

[0094] For the second first set, is the mth container in the second first set;

[0095] is the pth first set, is the mth container in the pth first set.

[0096] In an optional embodiment, for each of the first sets, clustering is performed again according to the size and transportation time of the containers to obtain a second set, including:

[0097] For each first set, the containers whose lengths are within a preset length range, whose widths are within a preset width range, and whose shipping times are within a preset time range are grouped into one set to obtain a second set;

[0098] The second set includes the following:

[0099] :

[0101]

[0102] in, For the 1st second set; is the qth container in the 1st second set;

[0103] is the t-th second set, is the jth container in the tth second set.

[0104] In an optional embodiment, for each container unloading location, calculating the sum of distances from the unloading locations of the containers in the second set to the location and using the sum as matrix elements to construct a distance matrix includes:

[0105] Get the first second set as the current second set;

[0106] Taking the first stack location as the current stack location, calculating the sum of the distances from the unloading position of each container in the current second set to the current stack location and using the sum as the target distance, and taking the next stack location as the current stack location, returning to calculate the sum of the distances from the unloading position of each container in the current second set to the current stack location until the last stack location is reached, and forming a column of the distance matrix based on each target distance;

[0107] The next second set is taken as the current second set, and the process of taking the first stack position as the current stack position is returned to, until the last second set is reached, thereby obtaining the distance matrix.

[0108] In an optional embodiment, the distance matrix is:

[0109]

[0110] in, are respectively In the collection The distance from the unloading position to the first stacking position;

[0111] They are respectively In the collection The distance from the unloading location to the kth stacking location;

[0112] are respectively In the collection The distance from the unloading location to the first stacking position;

[0113] are respectively In the collection The distance from the unloading location to the kth stacking location.

[0114] In an optional embodiment, determining the stacking plan for container unloading based on the auxiliary matrix corresponding to the optimal target matrix includes:

[0115] In the auxiliary matrix corresponding to the optimal target matrix, target columns with elements of 1 in each row are determined in sequence, and the containers in the second set are placed in the stacks corresponding to the target columns in sequence.

[0116] In an optional embodiment, in the auxiliary matrix corresponding to the optimal target matrix, determining target columns whose elements in each row are 1 in sequence, and placing the containers in the second set in sequence into the stack locations corresponding to the target columns, includes:

[0117] In the auxiliary matrix corresponding to the optimal target matrix, if the ath row and the mth b If the column is 1, put the container in the ath second set into the mth b In the stack; where a is greater than or equal to 1 and less than or equal to t, b is greater than or equal to 1 and less than or equal to k; m b is greater than or equal to 1 and less than or equal to k; wherein t and k are the number of rows and columns of the auxiliary matrix corresponding to the optimal target matrix, respectively.

[0118] like Figure 3 As shown, an embodiment of the present application provides an electronic device, including a processor 111, a communication interface 112, a memory 113 and a communication bus 114, wherein the processor 111, the communication interface 112, and the memory 113 communicate with each other through the communication bus 114.

[0119] Memory 113, for storing computer programs;

[0120] In one embodiment of the present application, the processor 111 is configured to execute a program stored in the memory 113 to implement the method provided by any of the aforementioned method embodiments, including:

[0121] Clustering the containers for the first time according to their types to obtain sets of containers of different types, and using the sets of containers as the first set;

[0122] For each of the first sets, clustering is performed a second time according to the size and transportation time of the containers to obtain a second set;

[0123] For each container unloading location, calculate the sum of the distances from the unloading locations of each container in the second set to the location, and use the sum as matrix elements to construct a distance matrix; wherein the number of rows of the distance matrix is ​​equal to the number of the locations, and the number of columns of the distance matrix is ​​equal to the number of the second sets;

[0124] Constructing several auxiliary matrices; wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and other elements in the auxiliary matrix are 0;

[0125] Multiplying the distance matrix with each of the auxiliary matrices to obtain a corresponding target matrix, and calculating the sum of each element in the target matrix to obtain the path length under different combinations;

[0126] A target matrix corresponding to the shortest path length is determined as an optimal target matrix, and a stacking plan for the container unloading is determined based on an auxiliary matrix corresponding to the optimal target matrix.

[0127] An embodiment of the present application further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the method provided in any of the aforementioned method embodiments are implemented.

[0128] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of this embodiment.

[0129] Through the description of the above embodiments, those skilled in the art will clearly understand that each embodiment can be implemented using software plus a general hardware platform, or of course, hardware. Based on this understanding, the essence of the above technical solution, or the portion that contributes to the relevant technology, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, or an optical disk, and includes a number of instructions for causing a computer device (such as a personal computer, server, or network device) to execute the methods described in each embodiment or certain portions of the embodiments.

[0130] The above embodiments are provided for illustrative purposes only and are not intended to limit the scope of implementation. Those skilled in the art will appreciate that other variations or modifications based on the above descriptions are possible. It is not necessary and impossible to provide an exhaustive list of all implementations. Obvious variations or modifications arising therefrom remain within the scope of protection of this application.

Claims

1. A method for stacking location planning for container unloading, characterized in that: include: Clustering the containers for the first time according to their types to obtain sets of containers of different types, and using the sets of containers as the first set; For each of the first sets, clustering is performed a second time according to the size and transportation time of the containers to obtain a second set; For each container unloading location, calculate the sum of the distances from the unloading locations of each container in the second set to the location, and use the sum as matrix elements to construct a distance matrix; wherein the number of rows of the distance matrix is ​​equal to the number of the locations, and the number of columns of the distance matrix is ​​equal to the number of the second sets; Constructing several auxiliary matrices; wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and other elements in the auxiliary matrix are 0; Multiplying the distance matrix with each of the auxiliary matrices to obtain a corresponding target matrix, and calculating the sum of each element in the target matrix to obtain the path length under different combinations; A target matrix corresponding to the shortest path length is determined as an optimal target matrix, and a stacking plan for the container unloading is determined based on an auxiliary matrix corresponding to the optimal target matrix.

2. The method according to claim 1, characterized in that The containers are clustered for the first time according to their types to obtain sets of containers of different types, including: Group containers of the same type into one container set; The first set includes the following: ： in, For the first set, is the e-th container in the 1st set; For the second first set, is the fth container in the second first set; is the pth first set, is the g-th container in the p-th first set.

3. The method according to claim 1, characterized in that For each of the first sets, clustering is performed again according to the size and transportation time of the containers to obtain a second set, including: For each first set, the containers whose lengths are within a preset length range, whose widths are within a preset width range, and whose shipping times are within a preset time range are grouped into one set to obtain a second set; The second set includes the following: ： in, For the 1st second set; is the qth container in the 1st second set; is the t-th second set, is the jth container in the tth second set.

4. The method according to claim 1, wherein For each container unloading location, calculating the sum of the distances from the unloading locations of the containers in the second set to the location and using the sum as matrix elements to construct a distance matrix includes: Get the first second set as the current second set; Taking the first stack location as the current stack location, calculating the sum of the distances from the unloading position of each container in the current second set to the current stack location and using the sum as the target distance, and taking the next stack location as the current stack location, returning to calculate the sum of the distances from the unloading position of each container in the current second set to the current stack location until the last stack location is reached, and forming a column of the distance matrix based on each target distance; The next second set is taken as the current second set, and the process of taking the first stack position as the current stack position is returned to, until the last second set is reached, thereby obtaining the distance matrix.

5. The method according to claim 3, characterized in that The distance matrix is: in, They are respectively In the collection The distance from the unloading position to the first stacking position; They are respectively In the collection The distance from the unloading location to the kth stacking location; They are respectively In the collection The distance from the unloading location to the first stacking position; They are respectively In the collection The distance from the unloading location to the kth stacking location.

6. The method according to claim 5, characterized in that The determining of the container unloading stacking plan based on the auxiliary matrix corresponding to the optimal target matrix includes: In the auxiliary matrix corresponding to the optimal target matrix, target columns with elements of 1 in each row are determined in sequence, and the containers in the second set are placed in the stacks corresponding to the target columns in sequence.

7. The method according to claim 6, characterized in that In the auxiliary matrix corresponding to the optimal target matrix, target columns whose elements in each row are 1 are sequentially determined, and containers in the second set are sequentially placed in the stack locations corresponding to the target columns, including: In the auxiliary matrix corresponding to the optimal target matrix, if the ath row and the mth b If the column is 1, put the container in the ath second set into the mth b In the stack; where a is greater than or equal to 1 and less than or equal to t, b is greater than or equal to 1 and less than or equal to k; m b is greater than or equal to 1 and less than or equal to k; wherein t and k are the number of rows and columns of the auxiliary matrix corresponding to the optimal target matrix, respectively.

8. A stacking planning device for rapid unloading at a container terminal, characterized in that: include: A first clustering module is used to perform a first clustering of containers according to their types to obtain a set of containers of different types, and use the set of containers as a first set; A second clustering module is configured to perform a second clustering on each of the first sets according to the size and shipping time of the containers to obtain a second set; a distance matrix construction module, configured to calculate, for each container unloading location, the sum of the distances from the unloading locations of the containers in the second set to the location, and use the sum of the distances as matrix elements to construct a distance matrix, wherein the number of rows of the distance matrix is ​​equal to the number of the locations, and the number of columns of the distance matrix is ​​equal to the number of the second sets; An auxiliary matrix construction module is used to construct several auxiliary matrices, wherein the number of rows of the auxiliary matrix is ​​equal to the number of columns of the distance matrix, and the number of columns of the auxiliary matrix is ​​equal to the number of rows of the distance matrix; each row of the auxiliary matrix has only one 1 element, and each column has only one 1 element, and other elements in the auxiliary matrix are 0; a path length calculation module, configured to multiply the distance matrix by each of the auxiliary matrices to obtain a corresponding target matrix, and calculate the sum of the elements in the target matrix to obtain the path length under different combinations; The planning module is used to determine a target matrix corresponding to the shortest path length as an optimal target matrix, and determine the stacking planning of the container unloading based on an auxiliary matrix corresponding to the optimal target matrix.

9. An electronic device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the method according to any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium, characterized in that A computer program is stored thereon, and when the computer program is executed in a computer, the computer is caused to execute the method according to any one of claims 1 to 7.

Images