Method and system for generating terminal container storage plan, electronic device, and medium

Abstract

The present application provides a method and system, electronic device, and medium for generating a terminal container storage plan that takes into account dynamically changing information, which are applied to the field of terminal container storage technology, wherein the target data required for calculating the discharge plan is obtained from the data source, and the obtained target data is statistically analyzed, and the optimal suitable bay for the current container grouping is calculated based on the statistical value and the constraint, until all container groups are arranged with the corresponding optimal suitable bay, and then the discharge plan is output. By considering the dynamic information with timeliness of the terminal yard, the most suitable bay corresponding to the container to be entered is automatically determined, which ensures that the discharge plan obtained by automatic processing has good timeliness and can meet the actual situation of the terminal yard, providing a new storage plan discharge solution for the traditional terminal yard, improving efficiency and reducing costs.

Description

Technical Field

[0001] The present application relates to the technical field of terminal container storage, and in particular to a method and system, electronic equipment, and medium for generating a terminal container storage plan taking into account dynamically changing information. Background Art

[0002] As a key node in shipping logistics, the efficiency of the terminal directly affects the cost and speed of international trade, and thus affects the stability of the global supply chain. In the face of continuous and huge container throughput, the formulation of a storage plan can plan the stacking areas of different types of containers in advance, reduce temporary decisions on site, and effectively improve the efficiency of terminal operations.

[0003] However, if there is a storage plan, any container that meets the storage plan conditions will always be placed within the scope of the plan, that is, the conditions and scope of the storage plan determine the stacking of different types of containers on the yard. At present, the terminal container storage plan is still based on manual arrangements and can no longer meet the actual operation needs of the terminal.

[0004] Therefore, how to formulate a storage plan based on real-time conditions has become an important and urgent technical problem that needs to be solved in terminal production and operation. Summary of the invention

[0005] In view of this, the embodiments of this specification provide a method and system, electronic device, and medium for generating a terminal container storage plan. By considering more real-time factors, the generated yard plan is more suitable for the yard at the current moment, thereby solving the problems of incomplete consideration of factors and inability to consider dynamically changing information when manually arranging storage plans.

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

[0007] The embodiment of this specification provides a method for generating a container storage plan at a terminal, comprising:

[0008] Acquire target data required for calculating the discharge plan from the data source, the target data including yard information, on-site container information, machinery information, bridge crane operation plan instructions, data box information and ship chart box information;

[0009] The acquired target data is counted, including grouping the boxes to be entered into the yard, counting the optional positions of the channels, box areas, and shell units, and counting the number of boxes with the same attributes in the channels, box areas, and shell units;

[0010] The optimal suitable bay for the current box grouping is calculated based on the statistical values ​​and constraints, and the discharge plan is output after all box groups are arranged with the corresponding optimal suitable bays.

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

[0012] When generating a stockpile plan, the method of the present application considers the actual information of the yard, such as yard information, on-site container information, machinery information, crane operation plan instructions (CWP instructions), data box information, and ship chart box information, etc. This information is more time-effective, so that the generated stockpile plan can better serve the yard at the current moment. Therefore, compared with manually arranging plans at least 12 hours in advance, the method of the present application reduces the waste of resources caused by advanced planning and can improve the overall operational efficiency of the terminal.

[0013] In addition, the present application realizes a system that can automatically execute the present application method, which can automatically handle complex data analysis and decision-making processes, and generate the optimal plan without human intervention. Not only does it greatly reduce the pressure on human resources, but it also shortens the interval between the planning time and the actual use time of the plan from more than 12 hours to within a few minutes, providing strong support for the plan to quickly respond to the ever-changing site.

[0014] In addition, the plan generated by this application is not only for export containers, but also includes export containers, transit containers and import containers, etc., which can also be divided into refrigerated containers, dangerous goods containers, special containers and ordinary containers. Therefore, the plan types that can be generated cover almost all container types, which are more applicable and can better meet the actual situation of the terminal yard. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0016] Figure 1 This is a schematic diagram of the terminal container storage plan generation scheme architecture in this application;

[0017] Figure 2 It is a flow chart of a method for generating a terminal container storage plan in the present application;

[0018] Figure 3 It is a schematic diagram of the structure of the box grouping in this application;

[0019] Figure 4 It is a schematic diagram of the activation function relu function in this application;

[0020] Figure 5 It is a diagram of the steps for processing and statistical analysis of the acquired data proposed in this application;

[0021] Figure 6 This is a diagram of the steps of calculating the discharge plan based on statistical values ​​and constraints proposed in this application;

[0022] Figure 7 The present application proposes to obtain the optimal suitable step diagram for each bin grouping according to constraint calculation;

[0023] Figure 8 It is a structural schematic diagram of a terminal container storage plan generation system in this application;

[0024] Fig. 9 It is a schematic diagram of the structure of an electronic device used for generating a terminal container storage plan in this application. DETAILED DESCRIPTION

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

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

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

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

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

[0030] In traditional solutions, when making a storage plan for containers that need to enter the yard, the storage plan is usually made manually in advance, for example, 12 hours in advance, and then when the container needs to enter the terminal yard, the storage operation is carried out according to the storage plan made in advance. Therefore, there are obvious disadvantages such as difficulty, high workload, and low efficiency in making a storage plan manually in advance, and the discharge plan made in advance basically cannot meet the terminal's requirements for flexible arrangement and changes in container storage.

[0031] In addition, although there are some preliminary technical solutions that can automatically formulate storage plans for incoming containers, for example, the existing document (Chinese application number: CN202010697916.2) discloses an automated container terminal export container space allocation method, but this solution can only perform storage allocation management for specific export containers, and cannot cover the storage needs of various types of containers entering the terminal.

[0032] In view of this, through in-depth research and improvement exploration of the terminal container yard and operation process, it is found that each yard on the terminal has a large amount of operation data, and these data are usually stored for data backtracking. In addition, these data are all data generated by the terminal yard during operation, such as yard information, on-site container information, machinery information, bridge crane operation plan instructions, data box information and ship map box information, so these data have good real-time and dynamic characteristics, and can well reflect the actual storage situation of the terminal yard.

[0033] Therefore, if it is possible to combine these real-time and dynamic data to formulate a storage plan for the yard, the formulated storage plan should be able to accurately reflect the actual situation of the yard, thereby better adapting to the actual storage needs of the terminal for incoming containers.

[0034] Based on this, for the traditional terminal yard, this application proposes a terminal container storage plan processing solution that takes into account dynamic change information: Figure 1As shown, the yard dynamic data required for calculating the discharge plan is obtained from the data source storing the dynamic data of the terminal yard operation, such as the terminal yard situation, mechanical operation instructions, crane operation plan (CWP), container entry information and other real-time dynamic information of the yard. Then, based on these dynamic information that can reflect the actual entry situation of the current terminal, the obtained data is statistically analyzed and processed, so as to obtain the most suitable container corresponding to each container grouping according to the statistical values ​​and constraints, and finally a storage plan is discharged.

[0035] Since the discharge plan for various containers that need to enter the yard is based on the dynamic information of the terminal yard, that is, this solution takes into account more real-time actual factors of the yard, so that the discharged yard plan is more suitable for the current storage operation, and can also cover all types of containers for storage plan formulation, and the discharge plan process can be completed automatically, and can also be executed at a set time interval, which can achieve seamless connection of the yard's effective plan, that is, there is always an effective and time-effective storage plan at any time.

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

[0037] like Figure 2 As shown, the present application provides a method for generating a terminal container storage plan, which may include:

[0038] Step S10, obtaining target data required for calculating the discharge plan from the data source, wherein the target data includes yard information, on-site container information, machinery information, bridge crane operation plan instructions, data box information and ship map box information.

[0039] In implementation, the yard information may refer to physical description information of the yard container area, bay position, row and layer, including but not limited to the container area number and the number of bay positions, the bay position number and the number of row layers and the row layer number. The on-site container information may refer to the attribute information of the containers stacked on the yard, including but not limited to the location in the yard, the container size, the container type, the container holder and other attributes. The machinery information may refer to the operation information of the work on the yard, including but not limited to the machinery number, the last operation position, and the operation type. The bridge crane work plan (CWP) instructions may refer to the instructions related to the yard in the CWP, including but not limited to the instructions issued by the CWP for unloading containers from the ship to the yard and the instructions issued by the CWP for sending containers from the yard to the ship. The data box information may be the attribute information of the containers whose attributes have been entered but are not present. The ship map box information may be the attribute information of the containers waiting to be unloaded and enter the yard in the future.

[0040] In addition, when obtaining the data required for calculating the discharge plan from the data source, the database driver can be used to read the required data from the target database. For example, the actual yard information at the current moment can be read from the yard information database, the information related to the actual containers at the current moment can be read from the on-site container information database, the work information on the yard at the current moment can be read from the machinery information database, the instruction information related to the yard at the current moment can be read from the bridge crane operation plan instruction database, and the attribute information of the boxes waiting to be unloaded and entering the yard in the future can be read from the data box information and ship diagram box information database.

[0041] Step S20: Count the acquired target data, in which the boxes to be entered into the yard are grouped, the optional positions of the channels, box areas, and shell units are counted, and the number of boxes with the same attributes in the channels, box areas, and shell units is counted.

[0042] refer to Figure 3 It is shown that the container grouping can be carried out according to the grouping attributes, for example, containers of the same type can be grouped into the same group according to the container type, containers of the same status can be grouped into the same group according to the container status, containers of the same status can be grouped into the same group according to the container dynamics, and containers can be grouped into import containers, export containers, transit containers, etc., containers can be grouped into ordinary containers, special containers, dangerous containers, refrigerated containers, etc.

[0043] In practice, the optional position statistics of the channel, box area, and shell unit can refer to dividing all the empty box positions in the venue into four categories based on shells: shells with small boxes, shells with large boxes, empty shells that can be used to place small boxes, and empty shells that can be used to place large boxes. For each shell, the number of empty positions in the shell is counted and the shell can be marked to form a large shell with the adjacent shells to place large boxes; for the box area, the available positions for large boxes and small boxes in the box area are summed; for the channel, the available positions for large boxes and small boxes in the box area in the channel are summed.

[0044] In implementation, the statistics of the number of boxes with the same attributes in channels, bins, and shell units can refer to setting different same-attribute screening conditions for different levels according to the first-level classification and second-level classification of the boxes. Specifically, for shells, the number of boxes with the same attributes in the shell is counted; for bins, the number of boxes with the same attributes of all shells in the bin is summed; for channels, the number of boxes with the same attributes in all bins in the channel is summed. Among them, boxes with the same attributes can refer to boxes with the same multi-attribute combination conditions for boxes in different states.

[0045] Step S30: Calculate the optimal fit for the current bin grouping based on the statistics and constraints.

[0046] In the implementation, a certain box group is selected as the current box group, and then the optimal suitable box is calculated for the current box group according to the constraints. Among them, selecting a certain box group means selecting a box group from the remaining box groups to be generated.

[0047] It should be noted that the constraint conditions used to constrain the calculation of the most suitable bay may refer to the evaluation value of which bay the container to be delivered is suitable for storage. The most suitable bay may be determined by using one constraint or by using multiple constraints. The specific constraints may be set according to the requirements of the yard.

[0048] Step S40, repeat step S30 until all box groups are arranged with corresponding optimal suitable boxes, thereby completing the discharge plan.

[0049] By considering the actual dynamic information of the terminal yard to plan the discharge of incoming containers, there is no need to make plans in advance too early. Plans can be made automatically at any time to ensure that the discharge plan meets the actual situation of the terminal yard.

[0050] In some implementations, the data may be merged and then counted. Specifically, by using a data table to merge and count, the data processing efficiency can be further improved.

[0051] Before statistics, the acquired data can be merged as follows: merge the read container area table, bay position table, slot table and on-site container information table to obtain a wide yard information table in which each row represents a container position in the yard, and each column records the physical location information of the container position and the attribute information of the occupied container; merge the read container area table, bay position table and machinery information table to obtain a table in which each row represents a bay position, and each column records the physical location information of the bay position and the number of the nearest machinery bays; merge the read container area table with the bridge crane operation plan instruction table to obtain a table in which each row represents a container area, and each column records the physical location information of the container area and the number of bridge crane operation plan instructions to be processed; splice the read data box information table with the ship chart box information table to obtain a table in which each row represents a box and each column records the attribute information of the box to be entered into the yard.

[0052] In some implementations, for box grouping, the boxes may be grouped according to the primary classification and the secondary classification based on the information table of the boxes to be entered into the yard, and the total number of boxes under the planned conditions, applicable attributes and groups may be obtained.

[0053] Refer to the above Figure 3 In other words, the first-level classification can refer to the classification of import containers, export containers and transit containers based on the container dynamics and operation mode. The second-level classification can refer to the classification of ordinary containers, special containers, dangerous containers and refrigerated containers based on the container status.

[0054] In some implementations, after grouping is completed, statistics may be performed based on the bin groupings.

[0055] In statistics, different same-attribute filtering conditions can be set for different grades according to the first-level and second-level classification of boxes; and the following statistics can be performed based on the wide table of yard information: for shells, count the number of boxes with the same attributes in the shells; for box areas, sum the number of boxes with the same attributes of all shells in the box area; for channels, sum the number of boxes with the same attributes of all box areas in the channel.

[0056] In some embodiments, when the optimal suitable shell is obtained, the number of box groupings and the merged information table are updated synchronously, wherein the smaller number of the box grouping number and the optimal suitable shell vacancy number are simultaneously subtracted to complete the information table merger, and / or the optional position statistics table outside the shell unit is updated, and / or the statistics table of the number of boxes with the same attributes is updated.

[0057] By obtaining the most suitable information, and then updating the corresponding information table, each information table can be changed dynamically, so that more reliable statistical results can be obtained according to these information tables in the future.

[0058] Furthermore, after statistics, the termination condition for generating a plan by grouping the current box can be determined. The termination condition for generating a plan by grouping the current box can refer to: if the updated current box group number is still greater than zero, repeat the grouping and calculating the most suitable step until the current box group number reaches zero, indicating that the plan range of the current box group number has been arranged.

[0059] In some implementations, as analyzed above, the constraint may be one or more constraints, and the following is an example of determining the most suitable constraint using multiple constraints.

[0060] In implementation, the optimal suitable shell can be calculated based on the multi-level constraint screening conditions, where the multi-level constraints include constraints unrelated to the calculation box attributes, constraints related to the calculation box attributes, and calculation optimization and tuning constraints. The optimal suitable shell is calculated as follows:

[0061]

[0062]

[0063] in, Refers to the box attribute-independent filter value, the value range is ; Refers to the filter value of the box attribute. ; Refers to the optimization penalty value, the value range is ; Refers to the shell suitability value, which determines the most suitable shell for the current box grouping plan;

[0064] The box attribute-independent constraints are calculated as follows:

[0065]

[0066] in, The first column of the table representing the box attribute irrelevant information Item fields, is the number of fields in the box attribute-independent information table, and each field value is equal to the Y value of the corresponding string type. is 1, otherwise is 0;

[0067] The constraints on box attributes are calculated as follows:

[0068]

[0069] in, Indicates Item box properties, , express The corresponding site attributes, only when each box attribute value is included by its corresponding site attribute, The value is 1, otherwise The value is 0;

[0070] The optimization and tuning constraints are judged and calculated according to the following formula:

[0071]

[0072] in, Indicates Item penalty value, is the number of penalty values, ; After performing the box attribute-independent constraints and box attribute-dependent constraints, Within the storage yard range corresponding to the non-zero value, several judgments and operations are performed on each shell, and the result of the operation is the penalty value.

[0073] In summary, the most suitable position is obtained by adopting multiple constraints, and these constraints are based on the dynamic information of the yard at the current moment, so the most suitable position can better reflect the actual situation of the incoming container.

[0074] It should be noted that multiple penalty values ​​can be set according to the terminal yard conditions, and can also be set with reference to the examples provided below.

[0075] In some embodiments, when setting multiple penalty values, the corresponding penalty values ​​can be calculated according to the following items: the number of planned storage tasks arranged in the container area, the number of containers closest to the mechanical interval, the number of planned instructions for bridge crane operations, and the number of containers with the same attributes in the channel.

[0076] The definition and calculation process of each penalty value are as follows:

[0077] First, define the box area code as With channel number C ;

[0078] Then, calculate the penalty value corresponding to each item respectively;

[0079] Penalty value corresponding to the number of planned tasks for storage in the container area Calculate as follows:

[0080]

[0081] in, Refers to the No. Number of grouping boxes;

[0082] The penalty value corresponding to the number of bays of the closest mechanical interval Calculate as follows:

[0083]

[0084] in, Refers to the shell number of the current shell. Refers to the bay number where the nearest machine is located;

[0085] Penalty value corresponding to the number of crane operation plan instructions Calculate as follows:

[0086]

[0087] in, Refers to the box from the box area in the bridge crane operation plan instruction Arriving at the ship The command, Refers to the crane operation plan instructions in the box from the ship side Arrival box area orders;

[0088] Penalty value corresponding to the number of channels with the same attribute bins Calculate as follows:

[0089]

[0090] in, Refers to the same attributes as the box group in channel C The total number of boxes in is an activation function, , the relu function curve can be referred to Figure 4 The curve image shown; Refers to the preset setting value.

[0091] By determining multiple penalty values ​​based on the dynamic information of the yard and then obtaining the most suitable shell based on the penalty values, the relationship between the containers to be delivered and the most suitable shell can be reflected, ensuring that the discharge plan is more in line with the actual situation of the terminal yard.

[0092] Below, some embodiments are formed based on the combination of the aforementioned multiple embodiments for schematic illustration.

[0093] In some implementations, the acquired data can be sorted by Figure 5 The processing and statistical work are carried out according to the illustrated processing steps.

[0094] like Figure 5 As shown, the scheme for data processing and statistics is as follows:

[0095] Step S201, merging the acquired data tables. The merging scheme can refer to the above example description;

[0096] Step S202: Group the boxes entering the yard. The box grouping scheme can refer to the above-mentioned example.

[0097] Step S203, counting the optional positions of the channel, box area, and shell unit. The counting scheme can refer to the above example description;

[0098] Step S204: Count the number of boxes with the same attributes in the channel, box area, and shell unit. The statistical scheme can refer to the above example description.

[0099] Based on the above steps S201-S204, the statistical results of the container grouping are obtained by using the dynamic information of the yard. These statistical results can be used to calculate the most suitable shells in the future, so as to obtain the most suitable shells corresponding to the container groupings.

[0100] In some implementations, when making a discharge plan based on statistical results, a certain box group is selected as the current box group, and then the current box group is calculated according to the constraints to obtain the optimal suitable box to carry out the discharge plan. Figure 6 The schematic processing steps are used to carry out the discharge planning work.

[0101] like Figure 6 As shown, the scheme for calculating the discharge plan based on the statistical values ​​and constraints can be as follows:

[0102] Step S301, selecting a box group, wherein selecting a box group may refer to selecting a box group from the remaining box groups for which a plan is to be generated;

[0103] Step S302: Calculate the most suitable bin for the current bin grouping according to the constraints. For details, please refer to the corresponding example above and will not be expanded here.

[0104] Step S303: merge and update the data table information. For the corresponding merge and update scheme, please refer to the above-mentioned corresponding example content;

[0105] Step S304, determine the termination condition for generating a plan for the current group. After obtaining the most suitable value, determine whether to terminate the process of calculating the most suitable value for the current box group by determining the termination condition. The termination condition for generating a plan for the current group may refer to: if the updated current box group number is still greater than zero, repeat S302-S303 until the current box group number reaches zero, indicating that the plan range for the current box group number has been arranged.

[0106] In some embodiments, when calculating the best fit for each bin group according to the constraints, the following method can be used: Figure 7 The optimal solution is calculated after calculating each constraint.

[0107] like Figure 7 As shown, the constraint calculation scheme can be as follows:

[0108] Step S3021, calculating box attribute-independent constraints;

[0109] Step S3022, calculating constraints related to box attributes;

[0110] Step S3023, calculating optimization and tuning constraints;

[0111] Among them, the box attribute-independent constraints, box attribute-related constraints and optimization and tuning constraints can be referred to the above examples and will not be expanded here.

[0112] Based on the same inventive concept, the present application also provides a terminal container storage plan generation system, and a storage plan generation system formed based on the aforementioned method examples to automatically, real-time and dynamically formulate an entry plan.

[0113] refer to Figure 8 Schematically, a terminal container storage plan generation system may include:

[0114] Acquisition module 101: Acquisition of target data required for calculating the discharge plan from a data source, the target data including yard information, on-site container information, machinery information, bridge crane operation plan instructions, data box information and ship chart box information;

[0115] Statistics module 103: statistics the acquired target data, including grouping the boxes to be entered into the yard, statistics on the optional positions of the channels, box areas, and shell units, and statistics on the number of boxes with the same attributes in the channels, box areas, and shell units;

[0116] Output module 105: Calculate the optimal and suitable shell discharge plan of the current box group according to the statistical value and the constraints, and output the discharge plan after all box groups are arranged with the corresponding optimal and suitable shells.

[0117] It should be noted that the settings of the unit module functions and the number of modules in the terminal container storage plan generation system can be set accordingly according to the aforementioned method embodiments, which will not be further described here.

[0118] Based on the same inventive concept, the present application also provides an electronic device, comprising: 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: a method for generating a terminal container storage plan as described in any embodiment of the present application.

[0119] like Fig. 9 As shown, the present application also provides a schematic diagram of the structure of an electronic device, which shows the structure of the electronic device 500. The electronic device 500 is merely an example and should not limit the functions and scope of use of the embodiments of the present invention.

[0120] The electronic device 500 may include: at least one processor 510; and a memory 520 communicatively connected to the at least one processor; wherein the memory 520 stores instructions executable by the at least one processor 510, and the instructions are executed by the at least one processor 510 so that the at least one processor 510 can execute: the terminal container storage plan generation method described in any embodiment of the present application.

[0121] It should be noted that the electronic device 500 may be in the form of a general-purpose computing device, for example, it may be a server device.

[0122] In implementation, the components of the electronic device 500 may include but are not limited to: the above-mentioned at least one processor 510, the above-mentioned at least one memory 520, and a bus 530 connecting different system components (including the memory 520 and the processor 510), wherein the bus 530 may include a data bus, an address bus, and a control bus.

[0123] In implementation, the memory 520 may include a volatile memory, such as a random access memory (RAM) 5201 and / or a cache memory 5202 , and may further include a read-only memory (ROM) 5203 .

[0124] The memory 520 may also include a program tool 5205 having a set (at least one) of program modules 5204, such program modules 5204 including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.

[0125] The processor 510 executes various functional applications and data processing by running computer programs stored in the memory 520 .

[0126] The electronic device 500 may also communicate with one or more external devices 540 (e.g., keyboards, pointing devices, etc.). Such communication may be performed via an input / output (I / O) interface 550. In addition, the electronic device 500 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 560, which communicates with other modules in the electronic device 500 via a bus 530. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 500, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (disk array) systems, tape drives, and data backup storage systems, etc.

[0127] It should be noted that although several units / modules or sub-units / modules of the electronic device are mentioned in the above detailed description, this division is merely exemplary and not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more units / modules described above can be embodied in one unit / module. Conversely, the features and functions of one unit / module described above can be further divided into multiple units / modules to be embodied.

[0128] Based on the same inventive concept, the present application also provides a computer storage medium, which stores computer executable instructions. When the computer executable instructions are executed by a processor, they execute: a method for generating a terminal container storage plan as described in any embodiment of the present application.

[0129] It should be noted that the computer storage medium may include but is not limited to: a portable disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, an optical storage device, a magnetic storage device or any suitable combination thereof.

[0130] In a possible implementation, the present invention may also provide a form of a program product that implements data processing, which includes program code. When the program product runs on a terminal device, the program code is used to enable the terminal device to execute several steps of the method described in any of the aforementioned embodiments.

[0131] The program code for executing the present invention may be written in any combination of one or more programming languages, and may be executed entirely on a user device, partially on a user device, as an independent software package, partially on a user device and partially on a remote device, or entirely on a remote device.

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

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

Claims

1. A method for generating a container storage plan at a terminal, characterized in that: include: Acquire target data required for calculating the discharge plan from a data source, wherein the data source is a database storing dynamic operation data generated by the terminal yard during operation, and the target data includes yard information, on-site container information, machinery information, bridge crane operation plan instructions, data box information, and ship diagram box information; The acquired target data is counted, including grouping the boxes to be entered into the yard, counting the optional positions of the channels, box areas, and shell units, and counting the number of boxes with the same attributes in the channels, box areas, and shell units; Calculate the optimal suitable bay for the current box grouping according to the statistical value and constraints, and output the discharge plan after all box groups have been arranged with the corresponding optimal suitable bays; The optimal suitable shell is calculated based on the multi-level constraint screening conditions, where the multi-level constraints include constraints unrelated to the calculation box attributes, constraints related to the calculation box attributes, and calculation optimization and tuning constraints. The optimal suitable shell is calculated as follows: in, Refers to the box attribute-independent filter value, the value range is ; Refers to the filter value of the box attribute. ; Refers to the optimization penalty value, the value range is ; Refers to the shell suitability value, which determines the most suitable shell for the current box grouping plan; The box attribute-independent constraints are calculated as follows: in, The first column of the table representing the box attribute irrelevant information Item fields, is the number of fields in the box attribute-independent information table, and each field value is equal to the Y value of the corresponding string type. is 1, otherwise is 0; The constraints on box attributes are calculated as follows: in, Indicates Item box properties, , express The corresponding site attributes, only when each box attribute value is included by its corresponding site attribute, The value is 1, otherwise The value is 0; The optimization and tuning constraints are judged and calculated according to the following formula: in, Indicates Item penalty value, is the number of penalty values, ; After performing the box attribute-independent constraints and box attribute-dependent constraints, Within the storage yard range corresponding to the non-zero value, several judgments and operations are performed on each shell, and the result of the operation is the penalty value.

2. The method for generating a container storage plan at a terminal according to claim 1, characterized in that: Before statistics, the acquired data is processed as follows: the read container area table, bay position table, slot table and on-site container information table are merged to obtain a wide yard information table in which each row represents a container position in the yard, and each column records the physical location information of the container position and the attribute information of the occupied container; the read container area table, bay position table and machinery information table are merged to obtain a table in which each row represents a bay position, and each column records the physical location information of the bay position and the number of the nearest machinery bays; the read container area table is merged with the bridge crane operation plan instruction table to obtain a table in which each row represents a container area, and each column records the physical location information of the container area and the number of bridge crane operation plan instructions to be processed; the read data box information table is spliced ​​with the ship chart box information table to obtain a table in which each row represents a box and each column records the attribute information of the box to be entered into the yard.

3. The method for generating a terminal container storage plan according to claim 2, characterized in that: Based on the information table of containers to be put into the yard, the containers are grouped according to the primary and secondary classifications, and the total number of containers under the planning conditions, applicable attributes and groups is obtained.

4. The method for generating a container storage plan at a terminal according to claim 2, characterized in that: According to the primary and secondary classification of boxes, different same-attribute screening conditions are set for different grades; based on the wide table of yard information, for shells, the number of boxes with the same attributes in the shells is counted; for box areas, the number of boxes with the same attributes of all shells in the box area is summed up; for channels, the number of boxes with the same attributes of all box areas in the channel is summed up.

5. The method for generating a terminal container storage plan according to claim 2, characterized in that: When the best suitable shell is obtained, the number of box groupings and the merged information table are updated synchronously; the information table is merged by subtracting the smaller number of the number of box groupings and the best suitable shell vacancy number from each other, and / or the optional position statistics table outside the shell unit is updated, and / or the statistics table of the number of boxes with the same attributes is updated.

6. The method for generating a terminal container storage plan according to claim 1, characterized in that: The corresponding penalty values ​​are calculated according to the following items: the number of planned storage tasks arranged in the container area, the number of containers with the closest mechanical interval, the number of planned instructions for bridge crane operations, and the number of containers with the same attributes in the channel; First, define the box area code as With channel number C ; Then, calculate the penalty value corresponding to each item respectively; Penalty value corresponding to the number of planned tasks for storage in the container area Calculate as follows: in, Refers to the No. Number of grouping boxes; The penalty value corresponding to the number of bays of the closest mechanical interval Calculate as follows: in, Refers to the shell number of the current shell. Refers to the bay number where the nearest machine is located; Penalty value corresponding to the number of instructions for bridge crane operation plan Calculate as follows: in, Refers to the box from the box area in the bridge crane operation plan instruction Arriving at the ship The command, Refers to the crane operation plan instructions in the box from the ship side Arrival box area orders; Penalty value corresponding to the number of channels with the same attribute bins Calculate as follows: in, Refers to the same attributes as the box group in channel C The total number of boxes in is an activation function, ; Refers to the preset setting value.

7. A terminal container storage plan generation system, characterized in that: include: Acquisition module: acquires target data required for calculating the discharge plan from a data source, wherein the data source is a database storing dynamic operation data generated by the terminal yard during operation, and the target data includes yard information, on-site container information, machinery information, bridge crane operation plan instructions, data box information and ship diagram box information; Statistics module: statistics the acquired target data, including grouping the boxes to be entered into the yard, statistics on the optional positions of channels, box areas and shell units, and statistics on the number of boxes with the same attributes in channels, box areas and shell units; Output module: Calculate the optimal and suitable shell discharge plan for the current box group according to the statistical value and constraints, and output the discharge plan after all box groups have the corresponding optimal and suitable shells; The optimal suitable shell is calculated based on the multi-level constraint screening conditions, where the multi-level constraints include constraints unrelated to the calculation box attributes, constraints related to the calculation box attributes, and calculation optimization and tuning constraints. The optimal suitable shell is calculated as follows: in, Refers to the box attribute-independent filter value, the value range is ; Refers to the filter value of the box attribute. ; Refers to the optimization penalty value, the value range is ; Refers to the shell suitability value, which determines the most suitable shell for the current box grouping plan; The box attribute-independent constraints are calculated as follows: in, The first column of the table representing the box attribute irrelevant information Item fields, is the number of fields in the box attribute-independent information table, and each field value is equal to the Y value of the corresponding string type. is 1, otherwise is 0; The constraints on box attributes are calculated as follows: in, Indicates Item box properties, , express The corresponding site attributes, only when each box attribute value is included by its corresponding site attribute, The value is 1, otherwise The value is 0; The optimization and tuning constraints are judged and calculated according to the following formula: in, Indicates Item penalty value, is the number of penalty values, ; After performing the box attribute-independent constraints and box attribute-dependent constraints, Within the storage yard range corresponding to the non-zero value, several judgments and operations are performed on each shell, and the result of the operation is the penalty value.

8. An electronic device, characterized in that: include: 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 terminal container storage plan generation method as described in any one of claims 1-6.

9. A computer storage medium, characterized in that The computer storage medium stores computer executable instructions, and when the computer executable instructions are executed by the processor, the method for generating a terminal container storage plan according to any one of claims 1 to 6 is performed.

Images