Algorithm for intelligent loading and unloading operation planning of bulk cargo terminal

Through intelligent loading and unloading operation planning algorithm, the complex loading and unloading operations of bulk cargo docks are optimized, which solves the complexity of loading and unloading operations and improves the efficiency of the docks.

CN118982297APending Publication Date: 2024-11-19JIANGSU MARITIME INST
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202410976735.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-21
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

The loading and unloading operations of bulk cargo terminals are complex and difficult to standardize the process. How to realize the automated planning of loading and unloading operations to improve the efficiency of the terminal.

Method used

Provide an intelligent loading and unloading operation planning algorithm, including loading and unloading operation planning, and by optimizing objective functions and constraints, using the combination of characteristic variables of loading and unloading machines to generate a minimum loading or unloading time plan. plan.

Benefits of technology

It simplifies the loading and unloading operation planning process, is suitable for different working conditions, improves loading and unloading efficiency, and is suitable for the operation planning of existing bulk terminals.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118982297A_ABST
    Figure CN118982297A_ABST
Patent Text Reader

Abstract

The invention discloses an algorithm for intelligent loading and unloading operation planning of a bulk cargo wharf. The algorithm comprises constraint conditions of ship loading operation planning and ship unloading planning. Wherein the loading working condition is that the ship loaders are located in the barge pairs to be loaded for middle operation, and the multiple barge pairs to be loaded for operation are symmetrical with the connecting line where the ship loaders are located as the symmetry axis; the unloading task working condition is that the bulk cargo ship to be unloaded comprises a plurality of cabins, and the ship unloaders are serially arranged on the same track to unload the cabins; and under the corresponding constraint condition, based on the corresponding target function, optimizing the target function by adopting a preset algorithm to obtain a value of the characteristic variable combination corresponding to the minimum loading time or the minimum unloading time. The utilization rate of bulk cargo wharf equipment can be increased.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of intelligent loading and unloading technology, and in particular to an algorithm for planning intelligent loading and unloading operations at a bulk cargo terminal. Background Art

[0002] The integration of the world economy and the cross-regional flow of production factors have put forward higher requirements for the services of ports and terminals. The bulk cargo flow of ports is developing in the direction of large-scale and specialization, the general cargo, high-value cargo and other containerized cargo are developing in the direction of containerization, and the containerized freight is developing in the direction of large-scale, alliance and networking. The above trends determine that the operation and management of ports and terminals must develop towards information-based and automated smart ports.

[0003] Bulk cargo terminals generally refer to special terminals used for loading and unloading bulk cargoes such as coal, ore, sand and gravel or grain. They play a huge role in my country's resource import and export. Compared with container loading and unloading, bulk cargo loading and unloading processes are complex and the operation process is difficult to standardize due to factors such as large differences in bulk cargo types and diversified customer requirements. Under the background of port terminal informatization construction, how to use new technologies to achieve Therefore, under the background of port terminal informatization construction, it is an urgent research need to explore how to more efficiently utilize the existing resources of bulk cargo terminals and improve their system service capabilities.

[0004] In bulk cargo terminals, how to realize automated planning of loading and unloading operations and improve loading and unloading efficiency is an important aspect of improving terminal efficiency. Summary of the invention

[0005] 1. Technical problems to be solved:

[0006] In view of the above technical problems, the present invention provides an algorithm for intelligent loading and unloading operation planning of bulk cargo terminals.

[0007] 2. Technical solution:

[0008] An algorithm for intelligent loading and unloading operation planning of bulk cargo terminals, including loading operation planning and unloading operation planning; the loading operation is to use a loader to load the cargo to the barge that needs to be connected; the unloading operation is to use a unloader to unload the bulk carrier;

[0009] The objective functions of loading and unloading operation planning are constructed with the minimum loading or unloading task time; the constraints of the two plans are set according to the specific working conditions of the loading or unloading tasks; the loading working condition is that the loader is located in the middle of the barge pair to be loaded, and the multiple barge pairs to be loaded are symmetrical with the line where the loader is located as the symmetry axis; the unloading task working condition is that the bulk carrier to be unloaded includes multiple cabins, and the unloader unloads the cabins serially on the same track;

[0010] Under the corresponding constraint conditions, based on the corresponding objective function, a preset algorithm is used to obtain the value of the corresponding characteristic variable combination of the minimum loading time or the minimum unloading time, wherein the characteristic variable combination at least includes the target loading and unloading time for different schemes and the characteristic variables of the loader or unloader corresponding to the target loading and unloading scheme;

[0011] Input a loading task or an unloading task, use a preset algorithm to optimize the objective function of the loading task or the unloading task, and output a corresponding planning scheme; the planning scheme includes the required time and the required loader or unloader.

[0012] Furthermore, the objective function is expressed as:

[0013] minmize C max =max i∈N c i ; (1)

[0014] C i represents the completion time of loading or unloading of barge i; C 0 =0; N represents the set of ship loaders or ship unloaders, N = {1, 2, ...n}.

[0015] Furthermore, the loading constraints include:

[0016] The constraint that each barge is loaded once by only one loader is expressed as:

[0017]

[0018] In the above formula, M represents the set of ship loaders, M={1,2,...,}, m≥2; It means that if loader k loads barges i and j successively, otherwise,

[0019] The constraints for determining the first barge in the operation sequence of each ship loader are:

[0020]

[0021] In the operation sequence of each ship loader, there is a deterministic order constraint between different barges:

[0022]

[0023] In the operation sequence of each ship loader, the constraint on the completion time relationship between adjacent barges is:

[0024]

[0025] In the above formula, Cj represents the loading completion time of barge i; s ij represents the adjustment time required for the loader to switch between barges i and i;

[0026] Decision variable Y ij The properties of are as follows (6) and (7):

[0027]

[0028] In the above formula, is a preset positive number; Y ij Reflects the situation that barges at symmetrical berths cannot be loaded simultaneously and cannot cross each other due to the structural limitation of the ship loader. If the loading completion time of barge i is not later than the loading start time of barge t, Y ij =1; otherwise Y ij =0;

[0029] The constraint that ensures that the two bilaterally symmetric barges cannot be loaded at the same time is:

[0030]

[0031] In the above formula, O represents the set of barge pairs that cannot perform loading operations at the same time, O = {(1,2), (3,4), ..., (2n-1, 2n)};

[0032] The constraint condition that ship loaders cannot cross each other is:

[0033]

[0034] In the above formula, Determine the loader k that loads the barge i; Determine the loader l that loads barge j; because i<j, and barges i and j are loaded at the same time, then k<l, that is, k-l+1≤0.

[0035] Furthermore, the constraints of the unloading task are based on the loading and unloading constraints, specifically:

[0036] The constraint that each cargo hold is loaded once by only one unloader is expressed as:

[0037]

[0038] In the above formula, M represents the set of ship loaders, M={1,2,...,}, m≥2; It means that if loader k loads barges i and j successively, otherwise,

[0039] The constraints for determining the first cargo hold in the operation sequence of each ship unloader are:

[0040]

[0041] In the operation sequence of each ship unloader, there is a deterministic order constraint between different cargo hold ships:

[0042]

[0043] In the operation sequence of each ship loader, the completion time constraint between cargo hold j and its predecessor cargo hold is:

[0044]

[0045] In the above formula, C j represents the loading completion time of barge i; s ij represents the adjustment time required for the loader to switch between barges i and i;

[0046] Decision variable Y ij The properties of are as follows (16) and (17):

[0047]

[0048] In the above formula, is a preset positive number; Y ij Reflects the working condition that barges at symmetrical berths cannot be loaded simultaneously and cannot cross each other due to the structural limitation of the unloader. If the loading completion time of barge i is not later than the loading start time of barge ii, Y ij =1; otherwise Y ij =0;

[0049] The constraint condition that the ship unloaders cannot cross each other is:

[0050]

[0051] 3. Beneficial effects:

[0052] (1) The method discloses an algorithm for intelligent loading and unloading operation planning of bulk cargo terminals, which will establish loading models and unloading models for different working conditions of existing bulk cargo terminals, and is more suitable for writing operation plans for existing bulk cargo terminals. (2) The method discloses an algorithm for intelligent loading and unloading operation planning of bulk cargo terminals, which is based on a specific optimization algorithm for the objective function and can simplify the solution process. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 This is the overall flow chart of this method;

[0054] Figure 2 is the working condition of the loading process involved in this method;

[0055] Figure 3 This is the working condition of the unloading process involved in this method. DETAILED DESCRIPTION

[0056] The present invention will be described in detail below with reference to the accompanying drawings.

[0057] As attached Figure 1 As shown: An algorithm for intelligent loading and unloading operation planning of bulk cargo terminals, including loading operation planning and unloading operation planning; the loading operation is to use a loader to load the cargo on the barge that needs to be connected; the unloading operation is to use an unloader to unload the bulk carrier;

[0058] The objective function of the loading and unloading operation planning is constructed with the minimum loading or unloading task time; the constraints of the two plans are set according to the specific working conditions of the loading or unloading tasks; the loading working condition is that the loader is located in the middle of the barge pair to be loaded, and the multiple barge pairs to be loaded are symmetrical with the line where the loader is located as the symmetry axis; the unloading task working condition is that the bulk carrier to be unloaded includes multiple cabins, and the unloader unloads the cabins serially on the same track;

[0059] Under the corresponding constraint conditions, based on the corresponding objective function, the value of the corresponding characteristic variable combination of the minimum loading time or the minimum unloading time is obtained, wherein the characteristic variable combination at least includes the characteristic variables for representing the target loading and unloading time of different schemes and the loader or unloader corresponding to the target loading and unloading scheme;

[0060] Input a loading task or an unloading task, use a preset algorithm to optimize the objective function of the loading task or the unloading task, and output a corresponding planning scheme; the planning scheme includes the required time and the required loader or unloader.

[0061] Figure 2 The working conditions of the loading process involved in this method, Figure 3 The working conditions of the unloading process. Figure 2The m ship loaders need to load 2n barges. The 2n barges are berthed symmetrically on both sides, and each barge is loaded by only one ship loader. There is no interruption or preemption during the loading process until it is completed. The ship loader is a track-moving bulk cargo equipment that adopts a fixed ship and machine moving operation mode. During the loading process, the whole machine travels, the boom is extended, rotated and pitched to cover the barges at different berthing positions on both sides. The time required to complete these movements is the adjustment time related to the order of the ship loader. Due to the space limitation of the operation position, the two symmetrical barges on both sides cannot be loaded at the same time. During the loading process, when the ship loader 1 loads the barge 1, the operation position is occupied by the barge 1, and other ship loaders cannot load the barge 2; similarly, when the ship loader m loads the barge 2n-1, other ship loaders cannot load the barge 2n. In addition, since multiple loaders are connected in series on the same track, they cannot cross over each other due to the track path restrictions. For example, when loader 1 is performing a transfer operation on barge 4, other loaders cannot cross over loader 1 to load barge 1 or 2.

[0062] Furthermore, the objective function is expressed as:

[0063] minmize C max =max i∈N c i ; (1)

[0064] C i represents the completion time of loading or unloading of barge i; C 0 =0; N represents the set of ship loaders or ship unloaders, N = {1, 2, ...n}.

[0065] Furthermore, the loading constraints include:

[0066] The constraint that each barge is loaded once by only one loader is expressed as:

[0067]

[0068] In the above formula, M represents the set of ship loaders, M={1,2,...,}, m≥2; It means that if loader k loads barges i and j successively, otherwise,

[0069] The constraints for determining the first barge in the operation sequence of each ship loader are:

[0070]

[0071] In the operation sequence of each ship loader, there is a deterministic order constraint between different barges:

[0072]

[0073] In the operation sequence of each ship loader, the constraint on the completion time relationship between adjacent barges is:

[0074]

[0075] In the above formula, C j represents the loading completion time of barge i; s ij represents the adjustment time required for the loader to switch between barges i and i;

[0076] Decision variable Y ij The properties of are as follows (6) and (7):

[0077]

[0078] In the above formula, is a preset positive number; Y ij Reflects the situation that barges at symmetrical berths cannot be loaded simultaneously and cannot cross each other due to the structural limitation of the ship loader. If the loading completion time of barge i is not later than the loading start time of barge t, Y ij =1; otherwise Y ij =0;

[0079] The constraint that ensures that the two bilaterally symmetric barges cannot be loaded at the same time is:

[0080]

[0081] In the above formula, O represents the set of barge pairs that cannot perform loading operations at the same time, O = {(1,2), (3,4), ..., (2n-1, 2n)};

[0082] The constraint condition that ship loaders cannot cross each other is:

[0083]

[0084] In the above formula, Determine the loader k that loads the barge i; Determine the loader l that loads barge j; because i<j, and barges i and j are loaded at the same time, then k<l, that is, k-l+1≤0.

[0085] Figure 3 is a schematic diagram of the unloading process involved in this method, Figure 3In the process, m ship unloaders need to unload n cargo holds of bulk carriers. Each cargo hold is unloaded by only one ship unloader. There is no interruption or preemption during the unloading process until it is completed. During the unloading process, the ship unloader realizes the conversion between different cargo holds by moving the whole machine. The time required for the whole machine to move is the adjustment time related to the sequence of the ship unloaders. Since the m ship unloaders are serially connected on the same track, they cannot cross each other due to the track path restriction. When ship unloader 1 is unloading cargo hold 2, no other ship unloader can cross ship unloader 1 to unload cargo hold 1.

[0086] Furthermore, the constraints of the unloading task are based on the loading and unloading constraints, specifically:

[0087] The constraint that each cargo hold is loaded once by only one unloader is expressed as:

[0088]

[0089] In the above formula, M represents the set of ship loaders, M={1,2,...,}, m≥2; It means that if loader k loads barges i and j successively, otherwise,

[0090] The constraints for determining the first cargo hold in the operation sequence of each ship unloader are:

[0091]

[0092] In the operation sequence of each ship unloader, there is a deterministic order constraint between different cargo hold ships:

[0093]

[0094] In the operation sequence of each ship loader, the completion time constraint between cargo hold j and its predecessor cargo hold is:

[0095]

[0096] In the above formula, C j represents the loading completion time of barge i; s ij represents the adjustment time required for the loader to switch between barges i and i;

[0097] Decision variable Y ij The properties of are as follows (16) and (17):

[0098]

[0099] In the above formula, is a preset positive number; Yij Reflects the working condition that barges at symmetrical berths cannot be loaded simultaneously and cannot cross each other due to the structural limitation of the unloader. If the loading completion time of barge i is not later than the loading start time of barge ii, Y ij =1; otherwise Y ij =0;

[0100] The constraint condition that the ship unloaders cannot cross each other is:

[0101]

[0102] In this method, a genetic algorithm can be used to optimize and solve the generated model, and the process is something that those skilled in the art can undoubtedly derive.

[0103] Although the present invention has been disclosed as above in terms of preferred embodiments, they are not intended to limit the present invention. Anyone skilled in the art can make various changes or modifications without departing from the spirit and scope of the present invention. Therefore, the scope of protection of the present invention should be based on the scope of protection defined by the claims of this application.

Claims

1. An algorithm for intelligent loading and unloading operation planning of bulk cargo terminals, characterized by: It includes the planning of loading and unloading operations. The loading operation is to use a loader to load the barge that needs to be connected; the unloading operation is to use a unloader to unload the bulk carrier. The objective functions of loading and unloading operation planning are constructed with the minimum loading or unloading task time; the constraints of the two plans are set according to the specific working conditions of the loading or unloading tasks; the loading working condition is that the loader is located in the middle of the barge pair to be loaded, and the multiple barge pairs to be loaded are symmetrical with the line where the loader is located as the symmetry axis; the unloading task working condition is that the bulk carrier to be unloaded includes multiple cabins, and the unloader unloads the cabins serially on the same track; Under the corresponding constraint conditions, based on the corresponding objective function, the value of the corresponding characteristic variable combination of the minimum loading time or the minimum unloading time is obtained, wherein the characteristic variable combination at least includes the characteristic variables for representing the target loading and unloading time of different schemes and the loader or unloader corresponding to the target loading and unloading scheme; Input a loading task or an unloading task, use a preset algorithm to optimize the objective function of the loading task or the unloading task, and output a corresponding planning scheme; the planning scheme includes the required time and the required loader or unloader.

2. The algorithm for intelligent loading and unloading operation planning of bulk cargo terminals according to claim 1 is characterized by: The objective function is expressed as: minmizeCmaxmaXi∈NC; (1) C i represents the completion time of loading or unloading of barge i; C0 = 0; N represents the set of loaders or unloaders, N = {1, 2, ... n}.

3. The algorithm for intelligent loading and unloading operation planning of bulk cargo terminals according to claim 1 is characterized by: Shipping constraints include: The constraint that each barge is loaded once by only one loader is expressed as: In the above formula, M represents the set of ship loaders, M={1,2,...,}, m≥2; It means that if loader k loads barges i and j successively, otherwise, The constraints for determining the first barge in the operation sequence of each ship loader are: In the operation sequence of each ship loader, there is a deterministic order constraint between different barges: In the operation sequence of each ship loader, the completion time constraint between adjacent barges is: In the above formula, C j represents the loading completion time of barge i; s ij represents the adjustment time required for the loader to switch between barges i and i; Decision variable Y ij The properties of are as follows (6) and (7): In the above formula, is a preset positive number; Y ij Reflects the situation that barges at symmetrical berths cannot be loaded simultaneously and cannot cross each other due to the structural limitation of the ship loader. If the loading completion time of barge i is not later than the loading start time of barge t, Y ij =1; otherwise Y ij =0; The constraint that ensures that the two bilaterally symmetric barges cannot be loaded at the same time is: In the above formula, O represents the set of barge pairs that cannot perform loading operations at the same time, O = {(1,2), (3,4), ..., (2n-1, 2n)}; The constraint condition that ship loaders cannot cross each other is: In the above formula, Determine the loader k that loads the barge i; Determine the loader l that loads barge j; because i<j, and barges i and j are loaded at the same time, then k<l, that is, k-l+1≤0.

4. The algorithm for intelligent loading and unloading operation planning of bulk cargo terminals according to claim 3 is characterized by: The constraints of the unloading task refer to the loading and unloading constraints, specifically: The constraint that each cargo hold is loaded once by only one unloader is expressed as: In the above formula, M represents the set of ship loaders, M={1,2,...,}, m≥2; It means that if loader k loads barges i and j successively, otherwise, The constraints for determining the first cargo hold in the operation sequence of each ship unloader are: In the operation sequence of each ship unloader, there is a deterministic order constraint between different cargo hold ships: In the operation sequence of each ship loader, the completion time constraint between cargo hold j and its predecessor cargo hold is: In the above formula, C j represents the loading completion time of barge i; s ij represents the adjustment time required for the loader to switch between barges i and i; Decision variable Y ij The properties of are as follows (16) and (17): In the above formula, is a preset positive number; Y ij Reflects the working condition that barges at symmetrical berths cannot be loaded simultaneously and cannot cross each other due to the structural limitation of the unloader. If the loading completion time of barge i is not later than the loading start time of barge ii, Y ij =1; otherwise Y ij =0; The constraint condition that the ship unloaders cannot cross each other is:

Citation Information

Cited By

  • Remote full-automatic multi-machine cooperative intelligent control system based on ship unloader

    CN119991052A