Container terminal actual configuration method, device and equipment, storage medium and computer program product

By obtaining and screening ship and destination port data, and generating and calculating the optimal configuration plan, the problem of poor stability of container terminal configuration plan is solved and the terminal operation efficiency is improved.

CN119047691APending Publication Date: 2024-11-29CHINA MERCHANTS HLDG INT INFORMATION TECH COMPANY
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411100455.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-12
Publication Date
2024-11-29

AI Technical Summary

Technical Problem

The actual configuration solution of container terminals has poor stability, resulting in high labor intensity and low efficiency for loading personnel. The existing intelligent loading system uses a random heuristic search algorithm to lead to inconsistent results, making it difficult to adapt to different scenarios.

Method used

By obtaining the ship's pre-configuration diagram and destination port binning data, generating initial data, filtering and splicing to generate feasible solution sets, using preset parameters to calculate to obtain the optimal solution set, and sorting and filtering to select the minimum value as the target solution.

Benefits of technology

It improves the stability of the solution, ensures that the optimal solution is not missed, adapts to different business scenarios, and improves the efficiency of actual configuration of container terminals.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119047691A_ABST
    Figure CN119047691A_ABST
Patent Text Reader

Abstract

The invention discloses a container wharf actual configuration method, device and equipment, a storage medium and a computer program product, and relates to the technical field of wharf informationization, and the method comprises the steps: obtaining a ship pre-configuration graph and destination port container receiving data; ship initial data and destination port initial data are generated according to the ship pre-configuration graph and the destination port container receiving data; screening and splicing the initial data of the ship and the initial data of the destination port to generate a feasible solution set; calculating the feasible solution set through preset parameters to obtain an optimal solution set; and sorting and screening the optimal solution set, and selecting a minimum value in the optimal solution set as a target actual configuration scheme. According to the method, the ship initial data and the destination port initial data are screened and spliced to obtain the feasible solution set, so that the scheme stability can be improved, and the optimal solution cannot be omitted; the feasible solution set is calculated through the preset parameters, and then the target practical configuration scheme is obtained through screening, so that the method can adapt to different service scenes.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of container terminals, and in particular to methods, devices, equipment, storage media and computer program products for container terminal deployment. Background Art

[0002] With the acceleration of global economic integration, the scale of international trade continues to expand, and the demand for transportation continues to increase. Large-scale ships can carry more cargo, greatly shortening the number of transportation times and improving transportation efficiency. In addition, as an important link connecting global trade, shipping is increasingly competitive. Large-scale ships can reduce unit transportation costs and improve the competitiveness of shipping companies.

[0003] The trend of larger ships has brought great challenges to the production and operation planning of terminals. Among them, the actual loading of container terminals, as one of the core links, is directly affected, and the traditional manual loading that relies on empirical rules is no longer applicable. Loaders are faced with the actual loading plan of a large number of containers, with high labor intensity and poor loading effect, which has become a bottleneck restricting the improvement of terminal efficiency; for this reason, the research on ship loading has become a hot issue in the industry, but most of the current research modeling focuses on the perspective of shipping companies, and there are fewer studies from the perspective of terminals, and most of them consider the problem of turning over containers, yard storage problems and loading and loading time, which are inconsistent with the actual terminal operation situation and are difficult to apply in practice; the existing intelligent loading systems mostly use heuristic search algorithms that introduce randomness, resulting in inconsistent results of multiple calculations of the same conditions, making it difficult to make trade-offs, which seriously affects the overall efficiency of container terminal production operations. In addition, the stability is poor, and the effects corresponding to different instances or scenarios are different.

[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 container terminal allocation method, device, equipment, storage medium and computer program product, aiming to solve the technical problem of poor stability of container terminal allocation solutions.

[0006] To achieve the above objectives, the present application proposes a container terminal allocation method, the method comprising:

[0007] Obtain ship pre-configuration diagram and destination port container collection data;

[0008] Generate initial ship data and initial port of destination data according to the ship pre-configuration diagram and the container receiving data of the port of destination;

[0009] Screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set;

[0010] Calculating the feasible solution set by using preset parameters to obtain an optimal solution set;

[0011] The optimal solution set is sorted and screened, and a solution with the minimum value obtained from the optimal solution set is selected as the target actual matching solution.

[0012] In one embodiment, the step of generating the initial ship data and the initial destination port data according to the ship pre-configuration diagram and the destination port container receiving data includes:

[0013] Obtaining a ship pre-configuration diagram, and obtaining ship pre-configuration data according to the ship pre-configuration diagram;

[0014] Initializing the ship pre-configured data to obtain ship initial data;

[0015] The destination port receiving container data is obtained, and the destination port receiving container data is initialized to obtain the destination port initial data.

[0016] In one embodiment, the step of screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set includes:

[0017] Performing parallel calculation on the initial data of the ship and the initial data of the destination port to generate an initial solution vector;

[0018] Comparing and screening the initial solution vectors to obtain feasible solution vectors from the initial solution vectors;

[0019] Performing a column weight test on the feasible solution vector to obtain a column weight test result of the feasible solution vector;

[0020] When the column weight inspection result is qualified, the feasible solution vectors are spliced ​​to obtain a feasible solution set of the initial data of the ship and the initial data of the destination port.

[0021] In one embodiment, the step of comparing and screening the initial solution vectors to obtain feasible solution vectors in the initial solution vectors includes:

[0022] Obtaining corresponding initial ship data and initial destination port data from the initial solution vector;

[0023] According to the initial ship data, obtaining the size of the actual equipped position in the initial ship data;

[0024] According to the initial data of the port of destination, obtaining the size of the container receiving position of the initial data of the port of destination;

[0025] Compare the size of the actual distribution position with the size of the box receiving position to obtain a size comparison result;

[0026] If the size of the actual distribution position is not equal to the size of the box receiving position, the size comparison result is unqualified, and the initial solution vector is deleted;

[0027] If the size of the actual distribution position is equal to the size of the box receiving position, the size comparison result is qualified, and the initial solution vector is set as a feasible solution vector.

[0028] In one embodiment, the step of performing a column weight test on the feasible solution vector to obtain a column weight test result of the feasible solution vector includes:

[0029] According to the initial ship data corresponding to the feasible solution vector, the actual column weight of the feasible solution vector is obtained;

[0030] Compare the actual weight with the weight threshold of the ship pre-configured data to obtain a weight inspection result;

[0031] If the actual column weight is greater than the column weight threshold, the column weight test result is unqualified, and the feasible solution vector is deleted;

[0032] If the actual column weight is less than or equal to the column weight threshold, the column weight test result is qualified, and the feasible solution vectors are spliced.

[0033] In one embodiment, the step of calculating the feasible solution set by using preset parameters to obtain the optimal solution set includes:

[0034] According to the feasible solution set and the initial data of the destination port, a target number of container turnovers of the feasible solution set is obtained;

[0035] Obtaining a container bulk pickup target according to the feasible solution set, the destination port initial data and the ship initial data;

[0036] According to the feasible solution set, obtaining the box dispatch conflict target of the feasible solution set;

[0037] Normalizing the target of the number of container turnovers, the target of container collection, and the target of conflict in dispatching containers to obtain a normalized result;

[0038] The normalized results are calculated using preset parameters to obtain an optimal solution set of the feasible solution set.

[0039] In addition, to achieve the above-mentioned purpose, the present application also proposes a container terminal deployment device, the container terminal deployment device comprising:

[0040] Data acquisition module, used to obtain ship pre-configuration diagram and destination port container collection data;

[0041] An initialization module, used to generate initial ship data and initial port of destination data according to the ship pre-configuration diagram and the container receiving data of the port of destination;

[0042] A screening and splicing module, used for screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set;

[0043] A calculation and sorting module, used to calculate the feasible solution set through preset parameters to obtain an optimal solution set;

[0044] The sorting and screening module is used to sort and screen the optimal solution set, and select the solution with the minimum value in the optimal solution set as the target actual matching solution.

[0045] In addition, to achieve the above objectives, the present application also proposes a container terminal allocation device, 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 container terminal allocation method as described above.

[0046] 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 a processor, the steps of the container terminal allocation method described above are implemented.

[0047] 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 container terminal allocation method as described above are implemented.

[0048] One or more technical solutions proposed in this application have at least the following technical effects:

[0049] The present application discloses a container terminal actual allocation method, device, equipment, storage medium and computer program product, including: obtaining a ship pre-allocation diagram and a destination port container receiving data; generating ship initial data and destination port initial data according to the ship pre-allocation diagram and the destination port container receiving data; screening and splicing the ship initial data and the destination port initial data to generate a feasible solution set; calculating the feasible solution set by preset parameters to obtain an optimal solution set; sorting and screening the optimal solution set, and selecting the minimum value in the optimal solution set as the target actual allocation scheme. The present application obtains a feasible solution set by screening and splicing the ship initial data and the destination port initial data, which can improve the stability of the scheme and will not miss the optimal solution; calculating the feasible solution set by preset parameters, and then screening to obtain the target actual allocation scheme, which can adapt to different business scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] 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.

[0051] 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.

[0052] Figure 1 A flow chart of the first embodiment of the container terminal allocation method of the present application;

[0053] Figure 2 This is a schematic diagram of the module structure of the container terminal deployment device according to an embodiment of the present application;

[0054] Figure 3 Schematic diagram of the equipment structure of the hardware operating environment involved in the container terminal configuration method in the embodiment of the present application.

[0055] 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

[0056] 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.

[0057] 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.

[0058] The main solution of the embodiment of the present application is: obtaining the ship pre-configuration diagram and the destination port container receiving data; generating the ship initial data and the destination port initial data according to the ship pre-configuration diagram and the destination port container receiving data; screening and splicing the ship initial data and the destination port initial data to generate a feasible solution set; calculating the feasible solution set by preset parameters to obtain the optimal solution set; sorting and screening the optimal solution set, and selecting the minimum value in the optimal solution set as the target actual configuration solution.

[0059] The trend of larger ships has brought great challenges to the production and operation planning of terminals. Among them, the actual loading of container terminals, as one of the core links, is directly affected, and the traditional manual loading that relies on empirical rules is no longer applicable. Loaders are faced with the actual loading plan of a large number of containers, with high labor intensity and poor loading effect, which has become a bottleneck restricting the improvement of terminal efficiency; for this reason, the research on ship loading has become a hot issue in the industry, but most of the current research modeling focuses on the perspective of shipping companies, and there are fewer studies from the perspective of terminals, and most of them consider the problem of turning over containers, yard storage problems and loading and loading time, which are inconsistent with the actual terminal operation situation and are difficult to apply in practice; the existing intelligent loading systems mostly use heuristic search algorithms that introduce randomness, resulting in inconsistent results of multiple calculations of the same conditions, making it difficult to make trade-offs, which seriously affects the overall efficiency of container terminal production operations. In addition, the stability is poor, and the effects corresponding to different instances or scenarios are different.

[0060] This application obtains a set of feasible solutions by screening and splicing the initial data of the ship and the initial data of the destination port, which can improve the stability of the solution and avoid missing the optimal solution; the feasible solution set is calculated by preset parameters, and then the target actual matching solution is obtained by screening, which can adapt to different business scenarios.

[0061] It should be noted that the execution subject of this embodiment can 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 container terminal real-time distribution device, etc. The following takes the container terminal real-time distribution device as an example to illustrate this embodiment and the following embodiments.

[0062] Based on this, the embodiment of the present application provides a container terminal allocation method, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the container terminal allocation method of the present application.

[0063] In this embodiment, the container terminal allocation method includes steps S10 to S50:

[0064] Step S10, obtaining the ship pre-configuration map and the destination port container receiving data.

[0065] It should be noted that the ship pre-allocation diagram refers to an important document compiled by the shipping company before the container ship is loaded, based on the allocation of space at each port of call on the route and the specific number of export containers and special containers at each port for a single voyage, taking into account the opening volume of container terminal loading and unloading operations. It is the first step in the stowage of container ships and makes a preliminary allocation of the loading positions of containers on the ship according to different unloading ports.

[0066] In addition, it should be noted that the destination port container receiving data refers to the container receiving information of the corresponding ship at the destination port yard obtained through the terminal operating system TOS (Terminal Operating System).

[0067] More specifically, the TOS system is a computer management system used to manage and control all aspects of terminal operations. It is the core of terminal production management. The TOS system covers ship planning, yard control, loading and unloading ship control, inspection bridge, billing, acceptance and other aspects. By reflecting container information in real time, it provides the terminal with the best operation and receiving and sending box solutions, thereby greatly improving the terminal's operating efficiency and service quality. The main functions of the TOS system include: ship planning management, responsible for the ship's port arrival plan, berth arrangement, loading and unloading sequence, etc., to ensure that the ship can complete the loading and unloading operations on time and efficiently; yard control, reasonable arrangement and scheduling of containers in the yard, including the stacking, extraction, and movement of containers, etc., to improve the utilization rate and operation efficiency of the yard; loading and unloading ship control, arranging and controlling the loading and unloading operations of containers, allocating loading and unloading equipment and personnel resources, and ensuring the efficient and safe loading and unloading operations; inspection bridge management, responsible for the inspection of containers during the loading and unloading process, including the integrity of the container, the status of the seal, etc., to ensure the safety of the goods; billing and acceptance, handling the calculation and settlement of various fees of the terminal and the acceptance of customer business, etc.

[0068] Specifically, the ship pre-configuration map is obtained through the shipping company, and the destination port container receiving data is obtained through the terminal operating system TOS.

[0069] Step S20, generating initial ship data and initial port of destination data according to the ship pre-configuration diagram and the container receiving data of the port of destination.

[0070] It should be noted that the initial ship data refers to the data obtained by obtaining the ship pre-allocation data from the ship pre-allocation diagram and initializing the ship pre-allocation data. The ship pre-allocation data includes but is not limited to the actual allocation position of the target ship, the weight threshold, and the data of the destination port corresponding to the target ship.

[0071] More specifically, the actual allocation position of the target ship refers to the specific description of the position of containers or other cargoes on the ship through three dimensions: shell, row, and layer. This division method helps to accurately locate and manage the cargo on the ship and ensure the smooth progress of loading and unloading operations. "Shell" refers to the arrangement sequence number of the container in the longitudinal direction of the ship (i.e., the bow and stern direction), which represents the position of the container in the length direction of the hull; "row" refers to the arrangement sequence number of the container in the transverse direction of the ship (i.e., the left and right direction), which represents the position of the container in the width direction of the hull; "layer" refers to the arrangement sequence number of the container in the vertical direction of the ship (i.e., the vertical direction), which represents the position of the container in the height direction of the hull. The scale of the actual allocation position is the number of boxes and positions on the target ship, denoted by N.

[0072] More specifically, the column weight threshold of the target ship refers to the maximum weight limit that each column in each bay on the target ship can bear.

[0073] More specifically, the destination port corresponding to the target ship, also known as the port of discharge (POD), refers to the port where the target ship will eventually arrive and anchor for cargo unloading or other related operations in accordance with its sailing plan or cargo transportation contract. This port is the end point of the ship's voyage and the place where the cargo is delivered to the consignee.

[0074] In addition, it should be noted that the initial data of the destination port refers to the container receiving data of the target ship at the destination port, and the initial data of the destination port includes but is not limited to the container receiving location, container weight, ship quay crane operation status, operation order and time.

[0075] More specifically, the container receiving position refers to the specific storage position of the container on the yard that can be uniquely determined by the column, shell, row, and layer. These position identifiers together constitute the precise positioning of the container in the yard. The container receiving position (column, shell, row, and layer) together constitutes the three-dimensional spatial coordinates of the container in the yard, so that each container has a unique storage position. This position identification method helps the yard management personnel to manage and dispatch the containers efficiently and orderly.

[0076] "Bar", also known as container area or section, is a regular grid-like position drawn on the container yard according to the corresponding standard scale of containers. It is used to indicate the stacking area of ​​​​containers. The yard will be divided into several container areas according to factors such as container type and container holder. Each container that arrives will be assigned to a container area according to the plan.

[0077] "Bay" is used to identify the longitudinal column position on the container yard. In the yard, the arrangement perpendicular to a certain direction (usually the vertical direction) is called a bay. Each bay can accommodate one or more rows of containers, depending on the width of the bay and the size of the container.

[0078] "Row" refers to the direction perpendicular to the bay in the yard. A row usually consists of one or more containers side by side, and its width matches the width of the container. There is usually enough space between rows to facilitate the loading, unloading and storage of containers.

[0079] "Layer" is used to identify the height of the container in the yard. In the yard, containers can be stacked in multiple layers to save space. Each layer corresponds to a height mark to ensure the stability and safety of the container during storage.

[0080] Specifically, the ship pre-configuration diagram is obtained through the shipping company, and the ship pre-configuration data is obtained according to the ship pre-configuration diagram, the ship pre-configuration data including the actual configuration position (shell, column, layer) of the ship, the column weight threshold and the destination port information of the ship, and the ship pre-configuration data is initialized to obtain the ship initial data; the destination port container receiving data of the target ship is obtained through the terminal operating system, the destination port container receiving data including the destination port container receiving position (column, column, column, layer), container weight, ship quay crane operation column, operation order and time.

[0081] For example, the destination port set involved in the target ship is initialized, and the expression after initialization is:

[0082] P={POD i |i=1,2,...,m}

[0083] Among them, P is the destination port set; POD i is the destination port; i means that the destination port is the i-th one among the m destination ports.

[0084] Step S30, screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set.

[0085] Specifically, the initial data of the ship and the initial data of the port of destination are calculated in parallel to generate an initial solution vector; the initial solution vectors are compared and screened to obtain feasible solution vectors in the initial solution vectors; a column weight check is performed on the feasible solution vectors to obtain a column weight check result of the feasible solution vectors; when the column weight check result is qualified, the feasible solution vectors are spliced ​​to obtain a feasible solution set of the initial data of the ship and the initial data of the port of destination.

[0086] Step S40, calculating the feasible solution set by using preset parameters to obtain an optimal solution set.

[0087] It should be noted that the preset parameters refer to initializing several sets of parameters according to the specific reality of the business scenario, which are used to calculate the optimal solution set.

[0088] In addition, it should be noted that the optimal solution set refers to

[0089] Specifically, according to the feasible solution set and the initial data of the destination port, the target of the number of container turning overs of the feasible solution set is obtained; according to the feasible solution set, the initial data of the destination port and the initial data of the ship, the target of full container pickup is obtained; according to the feasible solution set, the target of conflict in shipping of the feasible solution set is obtained; the target of the number of container turning overs, the target of full container pickup and the target of conflict in shipping are normalized to obtain a normalized result.

[0090] Step S50, sorting and screening the optimal solution set, and selecting a solution with the minimum value in the optimal solution set as a target actual matching solution.

[0091] It should be noted that the target actual allocation plan refers to the actual allocation plan for arranging and managing the actual assembly of containers after the containers on the target ship are unloaded to the corresponding yard of the destination port. Among them, the yard refers to an open-air space in the port for stacking goods. The actual allocation plan is usually a detailed loading and unloading operation plan formulated based on the type, quantity, characteristics of the goods and the specific conditions of the unloading port (such as port facilities, loading and unloading capacity, operating hours, etc.). Its purpose is to optimize the loading and unloading process, improve loading and unloading efficiency, reduce operating costs, and ensure the safety and environmental protection of goods during loading and unloading.

[0092] Specifically, the values ​​in the optimal solution set are sorted, and the solution with the minimum value in the optimal solution set is selected as the target actual matching solution. The actual matching solution can also be selected according to specific circumstances.

[0093] The present application obtains a feasible solution set by screening and splicing the initial data of the ship and the initial data of the destination port, and then calculates the feasible solution set through preset parameters to obtain the optimal solution set, which can improve the stability of the solution and ensure that the optimal solution is not missed; the feasible solution set is calculated through preset parameters, and then the target actual matching solution is obtained through screening, which can adapt to different business scenarios and improve the operating efficiency of the actual matching solution.

[0094] Based on the first embodiment, a second embodiment of the present application is proposed. The difference between the second embodiment of the present application and the first embodiment is that:

[0095] In this embodiment, the generating of the initial ship data and the initial destination port data according to the ship pre-configuration diagram and the destination port container receiving data includes steps S21 to S23:

[0096] Step S21, obtaining a ship pre-configuration drawing, and obtaining ship pre-configuration data according to the ship pre-configuration drawing.

[0097] Step S22, initializing the ship pre-configured data to obtain ship initial data.

[0098] Step S23, obtaining the destination port container receiving data, initializing the destination port container receiving data, and obtaining the destination port initial data.

[0099] Specifically, the ship pre-configuration diagram is obtained through the shipping company, and the ship pre-configuration data is obtained according to the ship pre-configuration diagram, the ship pre-configuration data including the actual configuration position (shell, column, layer) of the ship, the actual configuration position size, the column weight threshold and the destination port information of the ship, and the ship pre-configuration data is initialized to obtain the ship initial data; the destination port container receiving data of the target ship is obtained through the terminal operating system, the destination port container receiving data including the destination port container receiving position (column, column, column, layer), the container receiving position size, the container weight, the ship's quay crane operation shell, the operation order and the operation time.

[0100] Based on the second embodiment, a third embodiment of the present application is proposed. The difference between the third embodiment of the present application and the second embodiment is that:

[0101] In this embodiment, the screening and splicing of the initial ship data and the initial destination port data to generate a feasible solution set includes steps S31 to S34:

[0102] Step S31, performing parallel calculation on the initial data of the ship and the initial data of the destination port to generate an initial solution vector.

[0103] Specifically, the actual allocation position of the initial data of the ship and the container receiving position of the initial data of the destination port are calculated by the lexicographic order method to generate an initial solution vector.

[0104] Furthermore, first, according to actual needs, a lexicographic order rule is formulated. For example, the container can be sorted according to its size, type, destination port and other attributes to determine the priority and treatment method of special containers (such as refrigerated containers, oversized containers, and dangerous goods containers); then, according to the lexicographic order rule and the constraints of the pre-allocation diagram (such as space allocation, loading and unloading operation opening volume, etc.), the containers are sorted, and based on the sorting results, the initial solution vector of the actual allocation is generated. Each element in the initial solution vector may represent the number and position of a container.

[0105] Specifically, select the destination port POD from the destination port set P i ,i=1,2,3,…,m。 The corresponding POD is generated by parallel calculation of the target ship and the destination port one by one i The solution set (parallel computing acceleration, each POD i The initial solution vector is recorded as:

[0106]

[0107] Among them, X i is the initial solution vector corresponding to the i-th destination port, is the candidate solution in the initial solution vector, in, Indicates the destination port POD i n j Location: destination port POD i No. Containers. The entire POD i The solution space is 1-n i permutations and combinations of .

[0108] Step S32: compare and screen the initial solution vectors to obtain feasible solution vectors from the initial solution vectors.

[0109] Specifically, the size of the actual configuration position of the ship corresponding to the candidate solution in the initial solution vector is compared with the size of the container receiving position at the destination port to obtain a size comparison result; if the size of the actual configuration position of the ship is not equal to the size of the container receiving position at the destination port, the size comparison result is unqualified and the initial solution vector is deleted; if the size of the actual configuration position of the ship is equal to the size of the container receiving position at the destination port, the size comparison result is qualified and the initial solution vector is set as a feasible solution vector.

[0110] Step S33, performing a column weight check on the feasible solution vector to obtain a column weight check result of the feasible solution vector.

[0111] Specifically, according to the corresponding initial ship data in the feasible solution vector, the actual column weight of the feasible solution vector is obtained; the actual column weight is compared with the column weight threshold of the ship pre-configured data to obtain a column weight test result; if the actual column weight is greater than the column weight threshold, the column weight test result is unqualified, and the feasible solution vector is deleted; if the actual column weight is less than or equal to the column weight threshold, the column weight test result is qualified, and the feasible solution vector is spliced.

[0112] Step S34, when the column weight check result is qualified, the feasible solution vectors are spliced ​​to obtain a feasible solution set of the initial data of the ship and the initial data of the destination port.

[0113] Specifically, when the column weight inspection result is qualified, the feasible solution vectors are spliced ​​to obtain a feasible solution set of the initial data of the ship and the initial data of the destination port.

[0114] Specifically, the feasible solution vectors are concatenated to obtain the expression of the feasible solution set of the initial ship data and the initial destination port data:

[0115]

[0116] Among them, S is the set of feasible solutions, The candidate solution in the initial solution vector after completing the column weight test for the destination port numbered 1, To place the numbered Containers, For the port numbered n at the destination port numbered m m The position number is The meanings of other candidate solutions in the feasible solution set are similar.

[0117] Based on the third embodiment, a fourth embodiment of the present application is proposed. The difference between the fourth embodiment of the present application and the third embodiment is that:

[0118] In this embodiment, the step of calculating the feasible solution set by using preset parameters to obtain the optimal solution set includes steps S41 to S45:

[0119] Step S41, obtaining the target number of container turnovers of the feasible solution set according to the feasible solution set and the initial data of the destination port.

[0120] It should be noted that the target number of container turning times is the minimum number of overall container turning times at the destination port. The number of container turning times is related to the container turning rate. The container turning rate refers to the proportion of unloaded containers that need to be moved or restacked in the yard of the destination port due to some reasons, such as unreasonable container storage location, changes in loading sequence, container damage or need for inspection. This proportion is an important indicator to measure port operating efficiency, management level and operating costs.

[0121] Specifically, the goal of calculating the number of container turnovers is: According to the feasible solution set, the initial data of the corresponding destination port can be obtained. The initial data of the destination port includes the ship division and operation sequence, and the planned operation time of the container on the corresponding yard of the quay crane can be obtained. The planned operation time is expressed as:

[0122] (t1,t2,......,t j ,......,t n )

[0123] Among them, t1 is the planned operation time of container No. 1, t2 is the planned operation time of container No. 2, and t j is the planned operation time of container j, t n is the planned operation time for container n.

[0124] The set of containers in the same row, column, and row as container k and located above container k is denoted as O. k , so the overall target number of container turnovers at the destination port is:

[0125]

[0126] Among them, T1 is the number of container turnovers at the destination port, and the minimum number of container turnovers of all containers is taken as the target number of container turnovers; t k is the planned operation time of container k; t l The planned operation time for container No. 1.

[0127] Where H is the unit step function, that is:

[0128]

[0129] Indicates that (t k -t l )≤0, H is 0; k -t l )>0, H is 1.

[0130] Step S42, obtaining a container bulk pickup target according to the feasible solution set, the destination port initial data and the ship initial data.

[0131] It should be noted that the container pick-up target refers to the minimum number of container pick-ups at the destination port. Container pick-up refers to a series of operations performed on full containers of goods in the container yard, mainly including the processes of container extraction, transportation, and handover.

[0132] Specifically, calculate the container collection target: According to the actual allocation position of the target ship corresponding to the feasible solution vector and the container collection position of the destination port, the ship number corresponding to the containers in the yard column l and column b can be obtained as follows:

[0133] B l,b ∈Z,l∈{1,2,...,L}; b∈{1,2,...,e l}

[0134] Among them, B l,b is the number of shells corresponding to the container, indicating the position of the container in the lth column and bth column of the yard. L means there are at most L columns, e l Indicates that there are at most e l cowry.

[0135] Therefore, the container loading target is as follows:

[0136]

[0137] Among them, T2 is the number of containers picked up at the destination port.

[0138] Step S43: obtaining the box dispatch conflict target of the feasible solution set according to the feasible solution set.

[0139] It should be noted that the container dispatch conflict target refers to the minimum value of the overall container dispatch conflict at the destination port. Container dispatch conflict refers to the operation conflict or resource contention problem caused by multiple operation requests (such as loading, picking up containers, etc.) in the container terminal yard operation at the same time or almost at the same time to move containers at the same or nearby locations in the yard.

[0140] Specifically, the shipping conflict target is calculated: According to the corresponding relationship between the target ship and the destination port in the feasible solution set, the number of bays of each target ship and the storage yard of the destination port is obtained as follows:

[0141] VB b ∈Z,b∈{1,2,...,ve l}

[0142] Among them, VB b is the number of bays in each bay of the target ship and the storage yard of the destination port, ve l The maximum number of shellfish at the destination port yard.

[0143] Therefore, the conflicting targets of the whole dispatch box are as follows:

[0144]

[0145] Where abs() represents the absolute value, T3 is the number of container dispatch conflicts at the destination port, and R is the equipment ratio of the quay crane and yard crane at the destination port set to 1:R.

[0146] Step S44, normalizing the target of the number of container turnovers, the target of container collection, and the target of conflict in dispatching containers to obtain a normalized result.

[0147] Specifically, the target of the number of container turnovers, the target of container collection, and the target of conflict in dispatching containers are all normalized to obtain the normalized result. The calculation formula for the normalization is:

[0148]

[0149] Among them, T i,B is the normalized result, for example, T 1,B is the normalized result of the target number of box flipping; T 2,B is the normalized result of the container loading target; T 3,B is the normalized result of the outbound conflict target. 1,max It is the maximum value of the number of container turnovers T1 at the destination port.

[0150] Step S45, calculating the normalized result by using preset parameters to obtain an optimal solution set of the feasible solution set.

[0151] Specifically, first initialize the c set of preset parameters:

[0152] {λ1,λ2,......,λ c}

[0153] Among them, each set of parameters satisfies the following relationship:

[0154]

[0155] Among them, λ k1 is the calculation coefficient of the normalized result of the target number of box turnovers, λ k2 is the calculation coefficient of the normalized result of the container loading target, λ k3 The coefficient for calculating the normalized result of the outbound conflict target.

[0156] The calculation formula for calculating the normalized result by using the preset parameters is:

[0157]

[0158] Among them, T k The normalized result is calculated using preset parameters.

[0159] Each time the normalized result is calculated by a set of preset parameters, it is sorted. There are c sets of parameters in total, so c sortings are performed, and the minimum value obtained after each sorting is selected to form an optimal solution set.

[0160] Based on the fourth embodiment, a fifth embodiment of the present application is proposed. The difference between the fifth embodiment of the present application and the fourth embodiment is that:

[0161] In this embodiment, the step of comparing and screening the initial solution vectors to obtain feasible solution vectors in the initial solution vectors includes steps S321 to S326:

[0162] Step S321, obtaining corresponding initial ship data and initial destination port data from the initial solution vector.

[0163] Step S322: acquiring the size of the actual position in the initial ship data according to the initial ship data.

[0164] Step S323, according to the initial data of the destination port, obtaining the size of the container receiving position of the initial data of the destination port.

[0165] Step S324, comparing the size of the actual distribution position with the size of the box receiving position to obtain a size comparison result.

[0166] Step S325: If the size of the actual distribution position is not equal to the size of the box receiving position, the size comparison result is unqualified, and the initial solution vector is deleted.

[0167] Step S326: If the size of the actual distribution position is equal to the size of the box receiving position, the size comparison result is qualified, and the initial solution vector is set as a feasible solution vector.

[0168] It can be understood that each initial solution vector has corresponding initial data of the ship and initial data of the destination port, and the value of the vector can uniquely determine the actual delivery position of the target ship and the container receiving position of the destination port.

[0169] Specifically, according to the initial data of the ship corresponding to the initial solution vector, the size of the actual allocation position of the container in the initial data of the ship is obtained, and according to the initial data of the port of destination corresponding to the initial solution vector, the size of the container receiving position in the yard of the initial data of the port of destination is obtained. The size of the actual allocation position of the ship in each initial solution vector is compared with the size of the container receiving position of the port of destination one by one. If the size of the actual allocation position of the ship is not equal to the size of the container receiving position of the port of destination, the size comparison result is unqualified and the initial solution vector is deleted; if the size of the actual allocation position of the ship is equal to the size of the container receiving position of the port of destination, the size comparison result is qualified and the initial solution vector is set as a feasible solution vector.

[0170] Based on the fifth embodiment, a sixth embodiment of the present application is proposed. The difference between the sixth embodiment of the present application and the fifth embodiment is that:

[0171] In this embodiment, the step of performing a column weight check on the feasible solution vector to obtain a column weight check result of the feasible solution vector includes steps S331 to S334:

[0172] Step S331, obtaining the actual column weight of the feasible solution vector according to the initial ship data corresponding to the feasible solution vector.

[0173] Step S332, comparing the actual column weight with the column weight threshold of the ship pre-configured data to obtain the column weight inspection result.

[0174] Step S333: If the actual column weight is greater than the column weight threshold, the column weight check result is unqualified, and the feasible solution vector is deleted.

[0175] Step S334: If the actual column weight is less than or equal to the column weight threshold, the column weight check result is qualified, and the feasible solution vectors are spliced.

[0176] Specifically, the initial data of the ship corresponding to the feasible solution vector is obtained, the weight of each column in the ship's bay corresponding to the feasible solution vector is obtained, the weight of each column in the ship's bay is summed, and the actual column weight of the total weight of each column in the ship's bay corresponding to the feasible solution vector is obtained, and the actual column weight is compared with the column weight threshold of the ship's pre-configured data to obtain the column weight test result. If the actual column weight is greater than the column weight threshold, the column weight test result is unqualified, and the feasible solution vector is deleted; if the actual column weight is less than or equal to the column weight threshold, the column weight test result is qualified, and the feasible solution vector is spliced.

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

[0178] This application also provides a container terminal installation device, please refer to Figure 2 , the container terminal real-time distribution device comprises:

[0179] Data acquisition module 201, used to obtain ship pre-configuration diagram and destination port container receiving data;

[0180] Initialization module 202, used to generate ship initial data and destination port initial data according to the ship pre-configuration diagram and the destination port container receiving data;

[0181] A screening and splicing module 203 is used to screen and splice the initial ship data and the initial destination port data to generate a feasible solution set;

[0182] A calculation and sorting module 204 is used to calculate the feasible solution set by using preset parameters to obtain an optimal solution set;

[0183] The sorting and screening module 205 is used to sort and screen the optimal solution set, and select the solution with the minimum value in the optimal solution set as the target actual matching solution.

[0184] The container terminal real-time allocation device provided by the present application adopts the container terminal real-time allocation method in the above embodiment, which can solve the technical problem of poor stability of the container terminal real-time allocation scheme. Compared with the prior art, the beneficial effects of the container terminal real-time allocation device provided by the present application are the same as the beneficial effects of the container terminal real-time allocation method provided by the above embodiment, and other technical features in the container terminal real-time allocation device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0185] The present application provides a container terminal allocation device, 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 container terminal allocation method in the above-mentioned embodiment 1.

[0186] Reference below Figure 3 , which shows a schematic diagram of the structure of a container terminal real configuration device suitable for implementing the embodiment of the present application. The container terminal real configuration device 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 Displays), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 3 The container terminal equipment shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0187] like Figure 3As shown, the container terminal equipment may include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read On ly 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 container terminal equipment are also stored in the RAM 1004. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other via 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 container terminal equipment to communicate with other devices wirelessly or by wire to exchange data. Although the container terminal equipment with various systems is shown in the figure, 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.

[0188] 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.

[0189] The container terminal real-time matching equipment provided by the present application adopts the container terminal real-time matching method in the above embodiment, which can solve the technical problem of poor stability of the container terminal real-time matching scheme. Compared with the prior art, the beneficial effects of the container terminal real-time matching equipment provided by the present application are the same as the beneficial effects of the container terminal real-time matching method provided by the above embodiment, and other technical features in the container terminal real-time matching equipment are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0190] 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.

[0191] 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.

[0192] 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 container terminal allocation method in the above-mentioned embodiment.

[0193] 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: Erasable Programmab le Read On ly Memory or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM: CD-Read On ly Memory), 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: Radio Frequency), etc., or any suitable combination of the above.

[0194] The computer-readable storage medium may be included in the container terminal distribution equipment; or may exist independently without being assembled into the container terminal distribution equipment.

[0195] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the container terminal actual matching equipment, the container terminal actual matching equipment: obtains the ship pre-matching diagram and the destination port container receiving data; generates the ship initial data and the destination port initial data according to the ship pre-matching diagram and the destination port container receiving data; screens and splices the ship initial data and the destination port initial data to generate a feasible solution set; calculates the feasible solution set through preset parameters to obtain an optimal solution set; sorts and screens the optimal solution set, and selects the minimum value in the optimal solution set as the target actual matching solution.

[0196] 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 via 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).

[0197] 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.

[0198] 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.

[0199] The readable storage medium provided in the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned container terminal allocation method, and can solve the technical problems of container terminal allocation. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in the present application are the same as the beneficial effects of the container terminal allocation method provided in the above-mentioned embodiment, and will not be repeated here.

[0200] The present application also provides a computer program product, including a computer program, which implements the steps of the container terminal allocation method as described above when executed by a processor.

[0201] The computer program product provided by the present application can solve the technical problem of poor stability of the container terminal allocation scheme. 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 container terminal allocation method provided by the above embodiment, which will not be repeated here.

[0202] 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 container terminal allocation method, characterized in that: The method comprises: Obtain ship pre-configuration diagram and destination port container collection data; Generate initial ship data and initial port of destination data according to the ship pre-configuration diagram and the container receiving data of the port of destination; Screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set; Calculating the feasible solution set by using preset parameters to obtain an optimal solution set; The optimal solution set is sorted and screened, and a solution with the minimum value obtained from the optimal solution set is selected as the target actual matching solution.

2. The method according to claim 1, characterized in that The step of generating the initial ship data and the initial destination port data according to the ship pre-configuration diagram and the destination port container receiving data comprises: Obtaining a ship pre-configuration diagram, and obtaining ship pre-configuration data according to the ship pre-configuration diagram; Initializing the ship pre-configured data to obtain ship initial data; The destination port receiving container data is obtained, and the destination port receiving container data is initialized to obtain the destination port initial data.

3. The method according to claim 1, characterized in that The step of screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set comprises: Performing parallel calculation on the initial data of the ship and the initial data of the destination port to generate an initial solution vector; Comparing and screening the initial solution vectors to obtain feasible solution vectors from the initial solution vectors; Performing a column weight test on the feasible solution vector to obtain a column weight test result of the feasible solution vector; When the column weight inspection result is qualified, the feasible solution vectors are spliced ​​to obtain a feasible solution set of the initial data of the ship and the initial data of the destination port.

4. The method according to claim 3, characterized in that The step of comparing and screening the initial solution vectors to obtain feasible solution vectors in the initial solution vectors comprises: Obtaining corresponding initial ship data and initial destination port data from the initial solution vector; According to the initial ship data, obtaining the size of the actual equipped position in the initial ship data; According to the initial data of the port of destination, obtaining the size of the container receiving position of the initial data of the port of destination; Compare the size of the actual distribution position with the size of the box receiving position to obtain a size comparison result; If the size of the actual distribution position is not equal to the size of the box receiving position, the size comparison result is unqualified, and the initial solution vector is deleted; If the size of the actual distribution position is equal to the size of the box receiving position, the size comparison result is qualified, and the initial solution vector is set as a feasible solution vector.

5. The method according to claim 3, characterized in that The step of performing a column weight test on the feasible solution vector to obtain a column weight test result of the feasible solution vector comprises: According to the corresponding initial ship data in the feasible solution vector, the actual column weight of the feasible solution vector is obtained; Compare the actual weight with the weight threshold of the ship pre-configured data to obtain a weight inspection result; If the actual column weight is greater than the column weight threshold, the column weight test result is unqualified, and the feasible solution vector is deleted; If the actual column weight is less than or equal to the column weight threshold, the column weight test result is qualified, and the feasible solution vectors are spliced.

6. The method according to claim 1, characterized in that The step of calculating the feasible solution set by using preset parameters to obtain the optimal solution set includes: According to the feasible solution set and the initial data of the destination port, a target number of container turnovers of the feasible solution set is obtained; Obtaining a container bulk pickup target according to the feasible solution set, the destination port initial data and the ship initial data; According to the feasible solution set, obtaining the box dispatch conflict target of the feasible solution set; Normalizing the target of the number of container turnovers, the target of container collection, and the target of conflict in dispatching containers to obtain a normalized result; The normalized results are calculated using preset parameters to obtain an optimal solution set of the feasible solution set.

7. A container terminal deployment device, characterized in that: The device comprises: Data acquisition module, used to obtain ship pre-configuration diagram and destination port container collection data; An initialization module, used to generate initial ship data and initial port of destination data according to the ship pre-configuration diagram and the container receiving data of the port of destination; A screening and splicing module, used for screening and splicing the initial ship data and the initial destination port data to generate a feasible solution set; A calculation and sorting module, used to calculate the feasible solution set through preset parameters to obtain an optimal solution set; The sorting and screening module is used to sort and screen the optimal solution set, and select the solution with the minimum value in the optimal solution set as the target actual matching solution.

8. A container terminal distribution 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 container terminal allocation 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, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the container terminal allocation 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 container terminal allocation method according to any one of claims 1 to 6 are implemented.

Citation Information

Cited By

  • A container wharf yard dynamic security positioning method and system

    CN122887333A