A method for allocating container yard crane operations based on workload

By combining the number of instructions and completion time in the allocation of yard crane operation tasks, the problem of inflated yard crane busyness has been solved, thereby optimizing equipment scheduling and improving port operation efficiency.

CN123117567APending Publication Date: 2026-11-17CHONGQING NORMAL UNIVERSITY +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410522422.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-04-28
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing technologies cannot accurately consider the number, difficulty, and completion time of work instructions when measuring the busyness of yard bridges, resulting in an inflated busyness level and affecting the accuracy and efficiency of equipment scheduling optimization.

Method used

The calculation method based on the cumulative time of work instruction completion is adopted. By using the yard crane busyness function, the busyness is dynamically updated to reflect the true busy status of the equipment and avoid the phenomenon of artificially high busyness.

Benefits of technology

This improved the accuracy of task allocation for yard crane operations and the utilization rate of equipment, thereby enhancing the overall efficiency of port operations and the rationality of resource allocation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123117567A_ABST
    Figure CN123117567A_ABST
Patent Text Reader

Abstract

This invention belongs to the field of yard crane operation allocation technology, specifically involving a container yard crane operation task allocation method based on busyness, including the following steps: S1: Initialize all instructions and yard crane status, initial yard crane busyness: B; S2: Obtain the total number of operable yard cranes M, establish a yard crane number queue: i∈{1, 2, ..., M}, i=1; according to the total number of different instruction categories C, establish an instruction category number queue: j∈{1, 2, ..., Ci}; S3: Calculate the time for each yard crane to execute each type of instruction: the calculation formula is defined as: S4: Input the actual parameters of the incoming container into the yard crane busyness function, and calculate the busyness of the yard crane; the function is: S5: Determine whether i is less than M; This invention can allocate container yard crane operation tasks through busyness, avoid the problem of "artificially high" yard crane busyness, more feasiblely measure yard crane busyness, and is more conducive to improving yard operation efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of yard crane operation allocation technology, specifically relating to a method for allocating container yard crane operation tasks based on busyness. Background Technology

[0002] Terminal crane busyness is a comprehensive indicator that measures the frequency, workload, and efficiency of terminal crane operations within a certain period. It is used to assess the operational efficiency of terminal cranes, equipment utilization, and the overall operational efficiency of a terminal or port. The level of terminal crane busyness is not only related to the performance and quantity of the terminal cranes themselves, but also closely related to multiple factors such as the layout of the container yard, the coordinated scheduling between equipment, and the overall logistics planning of the port. These workloads or operational frequencies can be quantitatively assessed based on specific operational quantities, efficiency, and quality, and may be affected by external factors such as weather conditions, equipment maintenance and upkeep status, personnel training, and operational experience.

[0003] Existing equipment or system workload metrics are mostly used in the communications, logistics order, or warehouse management fields. These "quantity" metrics offer a direct, intuitive understanding, judging performance solely by numbers. However, different equipment has different operational capabilities, and different tasks have varying levels of difficulty. Reflecting true workload requires considering both operational capacity and difficulty. "Capacity" metrics tend to assign tasks based on performance or speed, but in port operation resource scheduling optimization, capacity is constrained by collaborative scheduling. The uncertainties inherent in the equipment itself and the uncertainty of operation time can affect the accuracy of capacity measurements. "Percentage" metrics also offer a direct, intuitive understanding, judging performance solely by saturation levels; essentially, they are simply "quantity" metrics. Summary of the Invention

[0004] The purpose of this invention is to provide a method for allocating container yard crane operation tasks based on busyness, for optimizing the scheduling of yard cranes during container terminal operations, thereby achieving cost reduction and efficiency improvement. To overcome the problems of inaccurate yard crane busyness measurement and inflated busyness figures, this invention provides a calculation method based on the cumulative completion time of operation instructions. This method considers not only the number of yard crane instructions but also the completion time of each instruction, providing a better measure of the busyness of yard cranes at the present and a future time, which is beneficial for yard crane instruction allocation.

[0005] To achieve the above-mentioned technical objectives, the technical solution adopted by the present invention is as follows:

[0006] A method for allocating container yard crane operations based on workload includes the following steps:

[0007] S1: Initialize all commands and field bridge status; initial field bridge busy level: B.

[0008] S2: Obtain the total number of workable bridges M, and establish a bridge numbering queue: i∈{1,2,...,M}, i=1;

[0009] Based on the total number C of different instruction categories, establish an instruction category number queue: j∈{1,2,...,C} i};

[0010] Therefore, the time required to complete different instruction categories is: The number of different categories of instructions is: Traffic volume of different bridges: B i ;

[0011] S3: Calculate the time for each fieldbridge to execute each type of instruction: The number of instructions of type j executed by field bridge i is Q, and their execution times are denoted as follows: but Calculation formula:

[0012]

[0013] The calculation formula is defined as follows:

[0014]

[0015] This indicates the start time when field bridge i executes the q-th instruction of type j. This indicates the completion time of the execution of the qth instruction of type j by field bridge i.

[0016] S4: Input the actual parameters of the incoming container into the yard crane busyness function and calculate the busyness of the yard crane;

[0017] The traffic congestion function for the yard bridge is: Since the function f is defined as a weighted summation

[0018] so:

[0019] C i Indicates the number of instruction categories in the field bridge i instruction queue;

[0020] S5: Determine if i is less than M. If i is less than M, return the value of i = i + 1 to S3 and continue the loop.

[0021] When i is greater than or equal to M, find the yard bridge with the lowest traffic among the M yard bridges and assign the new instruction to that yard bridge for operation.

[0022] Since the traffic volume of the yard crane has a dynamic attribute, a time attribute needs to be added to the function in step S4:

[0023]

[0024] Where t represents a certain moment, i.e., B i (t) represents the traffic level of bridge i at time t. C represents the number of class j instructions for field bridge i at time t. i (t) represents the number of instruction categories in the instruction queue of field bridge i at time t.

[0025] Since the instruction is issued at the time the external truck enters the gate, and at this time the external truck has not yet arrived at the yard crane, the yard crane is in standby mode. Therefore, there is a problem of artificially high yard crane busyness. Hence, a new function formula in S4 is derived:

[0026]

[0027] Δt j This indicates the "ready" time for a type j instruction, which is the time required for the external truck to travel to a specific yard location where the instruction needs to be applied. t1 represents the time required for field bridge i to complete instruction j; t1 represents the time required in Δt. j Within the time frame, field bridge i can execute certain instructions in the instruction queue.

[0028] The factors considered in t1 include which instructions in the instruction queue of field bridge i are completed, and the time required to complete these instructions. Since the actual number of instructions completed by the field bridge during the time interval from t to t+Δt is unknown, t1 can only be estimated. The formula for calculating t1 is:

[0029]

[0030] Where L represents the average execution time of one instruction, and N i (t) represents the number of instructions in the instruction queue of field bridge i at time t.

[0031] The formula for calculating L is: B i (t) represents the traffic level of bridge i at time t. This represents the number of class j instructions for field bridge i at time t.

[0032] The calculation formula in step S5:

[0033]

[0034]

[0035] The busyness of field bridge i at time t+Δt is calculated.

[0036] Then, the new allocation command is received by comparing the M field bridges and finding the one with the lowest busyness at time t+Δt.

[0037] This invention avoids the problem of artificially inflated yard crane busyness by incorporating the waiting time for yard crane operations into the busyness calculation. Furthermore, it calculates yard crane busyness more feasiblely by using the number of commands and command completion time. Moreover, by comprehensively considering [t, t+Δt]... j The level of equipment activity during a given time period is more conducive to improving yard operation efficiency. Attached Figure Description

[0038] The present invention can be further illustrated by the non-limiting embodiments given in the accompanying drawings.

[0039] Figure 1 This is a schematic diagram of the first process of a container yard crane operation task allocation method based on busyness according to the present invention;

[0040] Figure 2 This is a schematic diagram of the second process of a container yard crane operation task allocation method based on busyness according to the present invention; Figure 3 This diagram illustrates the process of forming a container yard crane instruction queue, which is part of a container yard crane operation task allocation method based on busyness according to the present invention. Detailed Implementation

[0041] To enable those skilled in the art to better understand the present invention, the technical solution of the present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0042] Example 1: As Figure 1-2 As shown, this invention allocates work instructions based on the busyness of the yard cranes, enabling concurrent operation of yard cranes involved in container terminal work. This maximizes the utilization rate of yard crane equipment to reduce costs and maximizes task balance to improve overall operational efficiency. Due to the inherent performance limitations of the yard crane equipment, its operating frequency is relatively fixed; therefore, the workload of the yard cranes becomes the main factor in measuring busyness.

[0043] In inland container terminals, there are various operational instructions, such as loading and unloading of domestic trucks and picking up and returning containers by foreign trucks. Measuring yard crane busyness solely by the number of operational instructions, without considering the difficulty or completion time of each instruction, may be ineffective. Even if the number of yard crane operational instructions is consistent, some instructions may be completed quickly while others take longer, making it impossible to guarantee concurrent operation of yard crane equipment over extended periods. Therefore, measuring yard crane busyness requires considering not only the number of instructions but also their difficulty; that is, yard crane busyness is a function of both the number and difficulty of instructions.

[0044]

[0045] Where the superscript 'i' represents the yard bridge number, B i This represents the traffic level of bridge i. This represents the number of instruction type j in the instruction queue of field bridge i. C represents the time required for field bridge i to complete instruction type j. i This represents the number of instruction categories in the instruction queue of field bridge i, i.e., j∈{1,2,...,C} i If the total number of available field bridges is M, then i∈{1, 2, ..., M}. Note that the instructions here are the tasks.

[0046] The function f in formula (1) is defined as a weighted sum: that is, the number of instructions of each type. Multiply by the completion time of each type of instruction. The sum of. Therefore, formula (1) can be further rewritten as:

[0047]

[0048] In the formula, C i This indicates the number of instruction categories in the field bridge i instruction queue.

[0049] The busyness of yard cranes has a dynamic attribute; that is, it is not a static indicator that remains unchanged. It decreases as orders are completed and increases as orders are assigned. Therefore, the busyness of yard cranes will vary depending on the time point viewed. i The values ​​are different, therefore, formula (2) is modified by adding a time attribute, and rewritten as follows:

[0050]

[0051] In formula (3), t in parentheses represents a certain time, i.e., B i (t) represents the traffic level of bridge i at time t. C represents the number of class j instructions for field bridge i at time t. i (t) represents the number of instruction categories in the instruction queue of field bridge i at time t. It is worth noting that the completion time of each type of job instruction... According to historical data, it is not related to a certain moment t, but it is related to the performance of the field bridge i. For example, there is a significant performance difference between high-speed field bridges and low-speed field bridges.

[0052] Given that updating the yard bridge traffic level immediately upon issuing the command can lead to inflated traffic levels, the traffic level update formula is defined as follows:

[0053]

[0054] Formula (4) means that when the instruction is issued at time t, the busy level at time t is not updated, but t+Δt is updated. j The level of activity at any given moment. For example, during container pickup operations, the instruction is issued at the time the container truck enters the gate, and it takes Δt for the truck to travel to the designated yard location for the operation. j Only after a certain period of time can the bridge enter the "ready" operation state. Only when the bridge enters the "ready" operation state can the level of activity truly reflect the busyness of the site. In formula (4), Δt j Indicates the "ready" time of instruction class j. t1 represents the time required for field bridge i to complete instruction j; t1 represents the time required in Δt. j Within the time frame, the field bridge i can complete some instructions in the instruction queue, and the busyness data that needs to be deducted; Represents t+Δt j The estimated traffic volume of bridge i at any given time.

[0055] The calculation of t1 needs to consider two factors: which instructions in the field bridge i instruction queue are completed, and the time required to complete these instructions. Since the update of formula (4) occurs at time t rather than t+Δt, the actual number of instructions completed during the time interval from t to t+Δt is unknown and can only be estimated. Therefore, the formula for calculating t1 is defined as follows:

[0056]

[0057] Where L represents the average execution time of one instruction, according to Perform the calculation, N i (t) represents the number of instructions in the instruction queue of field bridge i at time t, rounded up; Indicates Δt j The number of instructions that can be completed within a time period. Formula (5) means: when Δt... j If the time period is insufficient to complete one instruction, then t+Δt does not need to be deducted. j The busyness data of bridge i at time; otherwise, deduct the corresponding time for the number of instructions that can be completed.

[0058] The present invention is characterized by:

[0059] (1) The calculation of the traffic volume of the yard bridge should not only take into account the number of instructions, but also the difficulty of the instructions, and use the completion time of the instructions as the basis for calculating the difficulty of the task.

[0060] (2) The completion time of each type of instruction is obtained from historical data statistics.

[0061] When assigning instructions, the current busyness of the yard cranes is not updated. Instead, the busyness of the yard cranes corresponding to the "ready" time of the instruction is updated. "Ready" means that the container trucks executing the instruction have arrived at the container position and are ready to start the operation.

[0062] First, the number of operational yard cranes, M, refers to the available equipment resources that can participate in actual port operations, excluding yard cranes under maintenance or abandoned. In TOS, the status of the yard cranes can be edited according to the actual situation to determine the number of yard cranes, M.

[0063] second, The calculation process is shown in the table below. This represents the average time for field bridge i to execute instruction type j, measured in seconds (s). It's worth noting that there exists... In the case of the same bridge executing different types of instructions at different times, this reflects the difficulty of the task; similarly, there exists... This means that the same type of instruction may take different times to execute on different yard cranes, which reflects the operational capabilities of the yard cranes.

[0064] The table below shows the average time for different instructions for bridge operations at different sites.

[0065]

[0066]

[0067] Suppose that within a certain period of time, the number of instructions of type j executed by field bridge i is Q, and their execution times are denoted as follows: but The calculation formula is:

[0068]

[0069] The calculation formula is defined as follows:

[0070]

[0071] In the formula, start and finish represent the start and end times of the execution instruction, respectively. Regardless of the start or end time, the system time in TOS shall prevail. This indicates the start time when field bridge i executes the q-th instruction of type j. This indicates the completion time of the qth instruction of type j in the field bridge i instruction.

[0072] According to formula (6), The average execution time is calculated based on historical data, specifically the average completion time of instruction type j over a relatively long period, such as one year. Since this average value comprehensively reflects the performance of field bridge i in completing task type j, and the data is readily available and easy to calculate, it is a reasonable measure of task difficulty.

[0073] Third, the significance of implementing the yard crane busyness indicator. First, it is a comprehensive indicator of the number of instructions and the difficulty of the tasks. For example, if a yard crane has 7 instructions pending execution, each instruction corresponds to a historical statistical execution time. Based on this, the total time required to complete these 7 instructions is calculated according to formula (3), and is used as the busy level of the yard bridge. Second, it has dynamic attributes. As shown in formula (3), the busy level of the yard bridge seen at different time points is different. For example, the busy level of the yard bridge seen at time t is the total time corresponding to the 7 instructions, while t+Δt j The current traffic level of the airfield bridge may be the total time corresponding to 5 commands, because in Δt j Within the time frame, the tasks corresponding to the two instructions may have already been completed. Port operations involve multiple types of operational resources such as yard cranes, container trucks, and quay cranes. Coordination and cooperation among these resources are essential to improve operational efficiency. However, assigning an operational task to a yard crane does not guarantee that the yard crane will immediately execute the task. Even if the yard crane is ready, other resources involved in the task may not be ready. For example, in the case of the task of picking up containers by external container trucks at an inland container terminal, the instruction is issued when the external container truck enters the gate. However, it takes time for the truck to travel from the gate to the operational area, and this is affected by factors such as road traffic, vehicle and personnel uncertainties. In this case, it can be considered that the external container truck is not ready, and the yard crane cannot execute the instruction. Therefore, if this instruction is added to the yard crane instruction queue at this time, it will artificially inflate the yard crane's busyness. The actual increase in the yard crane's busyness should occur after the external container truck is ready. This more realistic measure of busyness is reflected in formula (4), where the updated busyness is t + Δt. j The time, not time t.

[0074] Fourth, the implementation details for the problem of inflated traffic levels at the yard bridge. ① The calculation of t1. As shown in formula (5), for example, in Δt j Within the time frame, if a certain bridge can complete 2 instructions (L = 2), then the "artificially high" bridge busyness caused by these 2 instructions should be deducted, because at time t, the bridge busyness has not increased, while the actual increase occurs at t + Δt. j At time. Of course, in Δt j Within the time range, due to Δt j If the time is too short, and a bridge cannot even complete any instruction in the instruction queue, then no deduction will be made. ② It should also be noted that... In the calculation, L is a time period, representing the average number of instructions per unit of workload. For example, B... i If (t) = 400s, and there are 3 instructions in the instruction queue, then At this point, Δt must be greater than or equal to 134s for the deduction to occur.

[0075] Fifth, the problem of minimizing the traffic volume of the yard cranes. It is necessary to find the yard crane with the lowest traffic volume among the M yard cranes. First, the traffic volume of the yard crane, i.e., in formula (5) The value is measured in seconds (s). Secondly, finding the minimum value can be achieved using any sorting algorithm, such as bubble sort, selection sort, insertion sort, merge sort, or quicksort. The time complexity of the first three methods is O(M). 2 The time complexity of the latter two sorting algorithms is O(M log M). Since the number of field bridges M is small, regardless of the sorting algorithm...

[0076] Calculating yard crane busyness based on the number of commands and command completion time provides a feasible method for measuring equipment performance. Obtaining the number of commands from the yard crane command queue is simple and straightforward, as follows: Figure 3 As shown, the instruction queue of the Terminal Operating System (TOS) is transformed into the yard crane instruction queue through the yard crane instruction allocation process. Figure 3 In this context, N represents the total number of instructions in the TOS system. 1 N 2 ..., N M and represent the number of instructions in the instruction queues of each of the M field bridges, respectively, and the following relationship exists: N = N 1 +N 2 +N M '.

[0079] The symbols and their meanings used in this invention are uniformly explained as follows.

[0080] M: Number of yard cranes (simplified to yard cranes; yard operations also include other operating machinery);

[0081] N: The number of instructions in the TOS system;

[0082] N 1 N 2 ..., N M The number of instructions in the instruction queues of each of the M field bridges satisfies: N = N 1 +N 2 +N M It indicates all the fingers

[0083] All orders require the completion of the yard bridge operation phase;

[0084] C: Total number of instruction categories;

[0085] C 1 C 2 ..., C M The number of instruction types in the instruction queues of each of the M field bridges satisfies: C 1 +C 2 +C M ≤C;

[0086] C i j The number of instructions of type j in the instruction queue of field bridge i, i∈{1,2,...,M}, j∈{1,2,...,C}. i};

[0087] X i j : The average time required for field bridge i to execute instruction type j;

[0088] Δt j : The ready time required for instruction type j.

[0089] The above embodiments are merely illustrative of the principles and effects of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of the present invention. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in the present invention should still be covered by the claims of the present invention.

Claims

1. A method for allocating container yard crane operation tasks based on traffic volume, characterized in that, Includes the following steps: S1: Initialize all commands and field bridge status; initial field bridge busy level: B. S2: Obtain the total number of workable bridges M, and establish a bridge numbering queue: i∈{1,2,...,M}, i=1; Based on the total number C of different instruction categories, establish an instruction category number queue: j∈{1,2,...,C} i }; Therefore, the time required to complete different instruction categories is: The number of different categories of instructions is: Traffic volume of different bridges: B i ; S3: Calculate the time for each fieldbridge to execute each type of instruction: The number of instructions of type j executed by field bridge i is Q, and their execution times are denoted as follows: but Calculation formula: The calculation formula is defined as follows: This indicates the start time when field bridge i executes the q-th instruction of type j. This indicates the completion time of the execution of the qth instruction of type j by field bridge i. S4: Input the actual parameters of the incoming container into the yard crane busyness function and calculate the busyness of the yard crane; The traffic congestion function for the yard bridge is: Since the function f is defined as a weighted summation so: C i Indicates the number of instruction categories in the field bridge i instruction queue; S5: Determine if i is less than M. If i is less than M, return the value of i = i + 1 to S3 and continue the loop. When i is greater than or equal to M, find the yard bridge with the lowest traffic among the M yard bridges and assign the new instruction to that yard bridge for operation.

2. The container yard crane operation task allocation method based on busyness according to claim 1, characterized in that: Since the traffic volume of the yard crane has a dynamic attribute, a time attribute needs to be added to the function in step S4: Where t represents a certain moment, i.e., B i (t) represents the traffic level of bridge i at time t. C represents the number of class j instructions for field bridge i at time t. i (t) represents the number of instruction categories in the instruction queue of field bridge i at time t.

3. The container yard crane operation task allocation method based on busyness according to claim 2, characterized in that: Because the various operating devices may not be ready to operate at the moment the command is issued, such as for commands like container pickup by external trucks, the time when the external truck enters the gate is the time the command is generated. At this time, the external truck has not yet arrived at the yard crane, and the yard crane is in a standby state. Therefore, there is a problem of inflated yard crane busyness. Hence, a new function formula in S4 is derived: Δt j This indicates the "ready" time for a type j instruction, which is the time required for the external truck to travel to a specific yard location where the operation is needed. t1 represents the time required for field bridge i to complete instruction j; t1 represents the time required in Δt. j Within the time frame, field bridge i can execute certain instructions in the instruction queue.

4. The container yard crane operation task allocation method based on busyness according to claim 3, characterized in that: The factors considered in t1 include which instructions in the instruction queue of field bridge i are completed, and the time required to complete these instructions. Since the actual number of instructions completed by the field bridge during the time interval from t to t+Δt is unknown, t1 can only be estimated. The formula for calculating t1 is: Where L represents the average execution time of one instruction, and N i (t) represents the number of instructions in the instruction queue of field bridge i at time t.

5. The container yard crane operation task allocation method based on busyness according to claim 4, characterized in that: The formula for calculating L is: B i (t) represents the traffic level of bridge i at time t. This represents the number of class j instructions for field bridge i at time t.

6. The container yard crane operation task allocation method based on busyness according to claim 1, characterized in that: The calculation formula in step S5: The busyness of field bridge i at time t+Δt is calculated. Then, the new allocation command is received by comparing the M field bridges and finding the one with the lowest busyness at time t+Δt.