Dry bulk cargo port ship loading operation scheduling method

By establishing a coordinated scheduling model of berth-loading equipment, using discrete optimization algorithm and artificial hummingbird optimization algorithm, the operation conflict problem of ship loading machines and material picking machines is solved, the loading operation efficiency of dry bulk ports is improved, and reasonable Resource allocation and job time are shortened.

CN118917588APending Publication Date: 2024-11-08YANSHAN UNIV
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202410950208.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-16
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

The existing dry bulk port loading operation scheduling methods are difficult to effectively coordinate the operation efficiency and conflicts of loading machines and material picking machines in complex large-scale port scenarios, resulting in an extended ship operation time and affecting the overall port efficiency.

Method used

Establish a coordinated scheduling model of berth-loading equipment, combine discrete optimization algorithm with artificial hummingbird optimization algorithm, optimize berth allocation and loading schemes, consider the operation conflicts between loading machines and material picking machines, and shorten the completion time of ship loading operations.

Benefits of technology

The reasonable berth, material pickup and loader resources are achieved for each ship, shortening the loading operation completion time of all ships, and improving the overall operating efficiency of the port.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118917588A_ABST
    Figure CN118917588A_ABST
Patent Text Reader

Abstract

The invention discloses a dry bulk cargo port ship loading operation scheduling method. The method comprises the following steps: establishing a berth-ship loading equipment collaborative scheduling model by taking the minimum total ship in-port time as an objective function; the constraint conditions of the berth-ship loading equipment collaborative scheduling model comprise berth distribution constraint, reclaimer distribution constraint, berth-ship loader distribution constraint, reclaimer walking time constraint, ship loader walking time constraint, ship loading operation completion time constraint, ship operation time and departure time constraint; acquiring a data set; the data set comprises berth basic data, ship loader information, material taking machine information, harbor ship basic information and ship loading information; and solving the berth-ship loading equipment collaborative scheduling model by using the data set and using a discrete optimization algorithm to obtain a scheduling scheme of each berth and a ship loader. According to the scheduling method, reasonable berth, reclaimer and ship loader resources are allocated for each ship, so that the overall operation efficiency of a port is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the technical field of ship operation, and in particular to a method for scheduling loading operations at a dry bulk cargo port. Background Art

[0002] As an important transit point for maritime trade, the operating efficiency of dry bulk ports directly affects the transportation level of dry bulk cargo. With the gradual promotion of the concept of smart ports, dry bulk ports have also transformed towards informatization, digitization, and intelligence. Therefore, under the premise of limited hardware resources at the terminal, how to reasonably dispatch existing berths and equipment resources to achieve efficient transportation of dry bulk cargo has become a core issue. At present, the loading operation scheduling plan and berth allocation plan of many ports are formulated by dispatchers based on their experience. When the number of ships forecast to enter the port increases, the dispatcher's experience often has great limitations, and it is impossible to effectively coordinate the loading operation scheduling allocation and berth allocation, which is easy to cause conflicts and extend the operation time of the ship, thereby affecting the operating efficiency of the entire port.

[0003] Mathematical models are applied to the study of dry bulk port operations because of their objectivity and will not be limited by the dispatcher's personal practical experience. Existing research mainly focuses on the allocation of yards and berths and the collaborative research between the two. Based on the research of yards, the main focus is on analyzing the material handling process, establishing the reclaimer operation model, and designing algorithms for solving it, but the model does not consider the constraints of the loader. Based on the research of berths, the predicted arrival time of the ship and the physical conditions of the ship are considered to calculate the arrival time and berthing position of the ship, without considering the operating efficiency and conflicts of the loader and reclaimer. However, the operating process of the loader and reclaimer in the port has complex processes and process conflicts, which will affect the departure time of the ship and further affect the arrival time of the next ship. As a whole, whether the factors considered for intelligent port scheduling are completely and closely affecting the operating efficiency of the port, the above technology is difficult to be directly applied in complex large-scale port scenarios. Summary of the invention

[0004] In view of this, the purpose of this application is to provide a method for scheduling loading operations in a dry bulk port, by combining berth allocation and loading plan formulation, and simultaneously considering the operational conflicts of loaders and reclaimers, so as to establish a berth-loading equipment collaborative scheduling model, thereby shortening the loading completion time of all ships, and allocating reasonable berths, reclaimers, loaders and other resources to each ship, so as to improve the overall operating efficiency of the port.

[0005] The present application provides a method for scheduling loading operations at a dry bulk cargo port, the method comprising:

[0006] A berth-ship loading equipment collaborative scheduling model is established with the minimum total ship in-port time as the objective function; the constraints of the berth-ship loading equipment collaborative scheduling model include: berth allocation constraints, reclaimer allocation constraints, berth-ship loading machine allocation constraints, reclaimer travel time constraints, ship loading machine travel time constraints, loading operation completion time constraints, ship operation time and departure time constraints;

[0007] Acquire a data set; the data set includes: basic berth data, ship loader information, reclaimer information, basic information of incoming ships, and ship loading information;

[0008] The data set is used to solve the berth-ship loading equipment collaborative scheduling model using a discrete optimization algorithm to obtain a scheduling plan for each berth and ship loading equipment.

[0009] Furthermore, the assumptions of the berth-shipping equipment collaborative scheduling model are as follows:

[0010] (1) Each reclaimer continuously performs the reclaiming task of the same ship;

[0011] (2) The ship's demand and the ship's loading order are known;

[0012] (3) Once the ship has completed loading operations, it shall immediately apply to leave the port;

[0013] (4) The operating efficiency of the reclaimer and the transport efficiency of the belt conveyor are both known;

[0014] (5) Failure of loading equipment is not considered;

[0015] (6) Batching operations of multiple reclaimers are not considered;

[0016] (7) Online operation of multiple ship loaders is not considered.

[0017] Further, the use of the data set to solve the berth-ship loading equipment collaborative scheduling model using a discrete optimization algorithm to obtain a scheduling plan for each berth and ship loading machine includes:

[0018] S1, initialization parameter setting; the parameters include: population size N, maximum number of iterations maxT and migration coefficient M;

[0019] S2. Generate the initial population according to the loading process using a three-layer real number coding method;

[0020] S3, calculate the fitness value F of each individual in the current population;

[0021] S4, determine whether the current number of iterations t reaches the maximum number of iterations maxT;

[0022] If the current number of iterations t does not reach the maximum number of iterations maxT, execute step S5;

[0023] If the current number of iterations t reaches the maximum number of iterations maxT, execute step S8;

[0024] S5. Use the artificial hummingbird optimization algorithm to update the individual positions in the current population;

[0025] S6, judging whether the current number of iterations t reaches the migration coefficient M;

[0026] If the current number of iterations t reaches the migration coefficient M, execute step S7;

[0027] S7, using the migration foraging method, randomize the individual Xworst with the smallest fitness value F in the current population to a new individual to correct the individual position, and execute step S3;

[0028] If the current number of iterations t does not reach the migration coefficient M, execute step S3;

[0029] S8. Output the global optimal individual position and optimal fitness value F of the current population.

[0030] Furthermore, the initial population is generated using a three-layer real number encoding method, including:

[0031] Number the berths, ship loaders and reclaimers respectively;

[0032] For each ship, a berth, a loader and a reclaimer are randomly assigned to generate multiple scheduling plans for the ship, and each scheduling plan for the ship is represented by the berth number, the loader number and the reclaimer number respectively;

[0033] The position of any individual in the initial population is jointly characterized by a scheduling scheme corresponding to all ships to generate the initial population.

[0034] Furthermore, the fitness value is the objective function value; the fitness value F of each individual in the population is calculated by the following formula:

[0035]

[0036] Where F is the objective function value, that is, the fitness value; TE i is the end time of operation of ship i; TI i is the planned port arrival time of vessel i.

[0037] Furthermore, the use of the artificial hummingbird algorithm to update the individual positions in the current population includes:

[0038] S5a, determine whether the random number rand is greater than 0.5;

[0039] If the random number rand is greater than 0.5, step S5b is executed to calculate the dynamic adjustment function p using the following formula:

[0040]

[0041] S5b, determine whether the random number rand is greater than the dynamic adjustment function p;

[0042] When the random number rand is greater than the dynamic adjustment function p, step S5c is executed to update the individual positions in the current population using the first guided foraging method as shown in the following formula:

[0043] X new =Cross(X target ,X i )

[0044] In the formula, X new is the updated position of the individual, i.e. the new gene, X target is the position of the target individual, i.e. the target gene, X i is the original position of the individual, i.e. the original gene;

[0045] The first guided foraging method is: from the target gene X target D points are randomly selected from the , where D is the direction vector, and embedded into the new gene X new The corresponding point in the new gene X new The remaining sites are represented by the original gene X i Complete the sequences in one by one;

[0046] When the random number rand is not greater than the dynamic adjustment function p, step S5d is executed to update the individual positions in the current population using the second guided foraging method shown in the following formula:

[0047] X new =Cross(X target ,X i ,X pbest ,X gbest )

[0048] In the formula, X pbest is the current optimal individual, X gbest is the global optimal individual;

[0049] The second guided foraging method refers to: using the global optimal individual and the current optimal individual for flight guidance, and each column is respectively composed of X according to the first guided foraging method. target , X pbest and X gbest Guide the generation of new gene X new ;

[0050] If the random number rand is not greater than 0.5, step S5e is executed to update the individual positions in the current population using the regional foraging method shown in the following formula:

[0051] X new =Reverse(X i )

[0052] The regional foraging refers to: in the original gene X i Randomly select D points from the source, sort them in reverse order, and insert them into the original gene X i New gene X new .

[0053] Furthermore, after the positions of individuals in the current population are updated by using the artificial hummingbird optimization algorithm, the method further includes: detecting and repairing the updated individuals by using the following methods:

[0054] For each ship, the ship will be inspected and repaired in the following manner:

[0055] Check whether the berthing position of the ship exceeds the berth value range. If the berthing position of the ship exceeds the berth value range, a berth is randomly generated within the berth value range;

[0056] Check whether the berthing capacity of the berth meets the requirements of the corresponding berthed ships. If the berthing capacity of the berth does not meet the requirements of the corresponding berthed ships, a berth is randomly generated under the constraints of the ship and berth accessibility matrix;

[0057] Check whether two ships are assigned the same berth in a certain time period and whether they overlap. If two ships are assigned the same berth in a certain time period and whether they overlap, then reallocate the berth to the ship according to the first-come-first-occupied principle and berth allocation constraints. If no suitable berth is found, postpone the berthing time until a feasible berth is found.

[0058] Check whether the loader allocation satisfies the berth-loader accessibility constraint and whether there is any cross-operation conflict between the loaders. If the loader allocation does not satisfy the berth-loader accessibility constraint, or there is a cross-operation conflict between the loaders, reallocate the loader to the ship. If no suitable loader is found, postpone the start time of the loader until a feasible loader is found.

[0059] Check whether the reclaimer allocation satisfies the reclaimer-yard accessibility constraint and whether there are cross-operation conflicts or collision conflicts between reclaimers. If the reclaimer allocation does not satisfy the reclaimer-yard accessibility constraint, or there are cross-operation conflicts or collision conflicts between reclaimers, reallocate the reclaimer for the ship. If no suitable reclaimer is found, postpone the start time of the reclaimer operation until a feasible reclaimer is found.

[0060] The dry bulk port loading operation scheduling method provided in this application combines berth allocation and loading plan formulation, and simultaneously considers the operation conflict problem of the loader and the reclaimer, so as to establish a berth-loading equipment collaborative scheduling model, thereby shortening the loading operation completion time of all ships, and allocating reasonable berths, reclaimers, loaders and other resources to each ship, so as to improve the overall operation efficiency of the port. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] Figure 1 A schematic diagram of dry bulk cargo port loading operation provided by an embodiment of the present application is shown;

[0062] Figure 2 A flow chart of a method for scheduling dry bulk cargo port loading operations provided by an embodiment of the present application is shown;

[0063] Figure 3 A flowchart of the steps of solving the berth-ship loading equipment collaborative scheduling model using a discrete optimization algorithm provided in an embodiment of the present application is shown;

[0064] Figure 4 A schematic diagram of a three-layer real number encoding method provided in an embodiment of the present application is shown;

[0065] Figure 5 A schematic diagram of a first guided foraging method provided in an embodiment of the present application is shown;

[0066] Figure 6 A schematic diagram of a regional foraging method provided in an embodiment of the present application is shown;

[0067] Figure 7 An example of a port layout schematic diagram provided in an embodiment of the present application is shown;

[0068] Figure 8 A schematic diagram of the optimal iterative process of the discrete optimization algorithm of the present application and the original discrete optimization algorithm provided by the embodiment of the present application is shown. DETAILED DESCRIPTION

[0069] In order to make the purpose, technical solution and advantages of the technical solution more clear, the technical solution is further described in detail below in conjunction with specific implementation methods. It should be understood that these descriptions are only exemplary and are not intended to limit the scope of the technical solution.

[0070] First, the dry bulk port loading equipment and loading operation mode of this application are introduced.

[0071] The loading equipment at the dry bulk port mainly includes ship loaders, reclaimers and belt conveyors; ship loaders are equipment that carry out loading operations for the various holds of ships docked at berths. Mobile ship loaders can move freely along the track to provide services for ships at different berths; reclaimers are equipment that carry out reclaiming operations on each stack in the yard area. They can move along the track in the yard area to operate on each stack; the reclaimer transports the goods taken from the stack to the front area of ​​the wharf through the belt conveyor, and the ship loader carries out the loading operations.

[0072] See also Figure 1 , Figure 1 The schematic diagram of dry bulk cargo port loading operation provided by the embodiment of the present application is shown. Figure 1 As shown, in most cases, dry bulk ports carry out loading operations in a single-retrieving and single-loading operation mode, that is, a reclaimer performs the reclaiming operation, a belt conveyor system performs the horizontal transportation operation, and a loader performs the loading operation; the reclaiming operation is that the dispatcher selects the reclaimer to perform the reclaiming task at the corresponding stack according to the forecast demand plan of the ship and the distribution of the products in the yard; the loading operation is that the dispatcher selects the corresponding loader to perform loading operations on different holds according to the demand of each hold of the ship; among them, the yard is the place where dry bulk cargo is stored at the terminal, generally a strip yard, which is divided into several rectangular stacks, each stack is used to store different types of products.

[0073] Based on Figure 1 The port loading operation mode shown in the figure shows that in the loading operation scheduling stage, there will be conflicts between the loader and the reclaimer when operating the cargo in the yard, so the rationality of the loading plan directly affects the overall efficiency of the port; in the berth allocation stage, the berth is the hub connecting the ship and the terminal, and the rationality of its allocation also directly affects the overall efficiency of the port. At the same time, these two stages restrict and influence each other. First, the loading operation scheduling affects the completion time of the ship's loading operation, thereby affecting the time when the ship leaves the berth, and then affects the berthing time of the next ship, which affects the berth allocation; secondly, the berth allocation affects the completion time of the ship operation and the allocation of the loader, which restricts the rationality of the loading operation scheduling plan.

[0074] Based on the above problems, the present application provides a method for scheduling loading operations at a dry bulk cargo port, which is described below through an embodiment.

[0075] First, the meanings of the symbols in the embodiments of the present application are explained:

[0076] (1) V represents the set of ships;

[0077] (2) B represents the berth set;

[0078] (3) R represents the collection of reclaimers;

[0079] (4) L represents the set of ship loaders;

[0080] (5) Y represents the set of strip yard areas;

[0081] (6) S represents the stacking set in a single strip yard area;

[0082] (7) G represents the set of all stacks in the port;

[0083] (8)T i represents the mission set of ship i;

[0084] (9)C i represents the set of cabins of ship i;

[0085] (10) i represents the ship predicted to arrive at the port within the planning period, i∈V;

[0086] (11) b represents the available berths in the port, b∈B;

[0087] (12)VL i represents the length of ship i in meters;

[0088] (13) VD i represents the draft of ship i, in meters;

[0089] (14)BL b represents the length of berth b;

[0090] (15)BD b Indicates the physical limiting water depth of berth b;

[0091] (16)M ii'b It means that ship i' berths at berth b after ship i;

[0092] (17)TI i represents the planned port entry time of ship i;

[0093] (18)TS ibrl represents the start time of operation of ship i;

[0094] (19)TE iIndicates the end time of operation of vessel i;

[0095] (20)Q it represents the demand for task t of ship i;

[0096] (21)W itg represents the storage capacity of stack g corresponding to the task t of ship i;

[0097] (22) RES(BL) represents the constraint matrix of berth and loader;

[0098] (23) RES(RY) represents the constraint matrix of the reclaimer and the stockyard;

[0099] (24)P rg Indicates the stacking position where the reclaimer r operates;

[0100] (25) represents the stacking position of the reclaimer r when it performs the task t of the ship i;

[0101] (26) represents the position of the cabin where the loader l is when performing task t of ship i;

[0102] (27)β rr' If it means that the reclaimer r and the reclaimer r' are on the same track, the value is 1, otherwise the value is 0;

[0103] (28)R it It indicates the available reclaimer for the mission t of ship i;

[0104] (29) d represents the safe distance between reclaimers;

[0105] (30)RMT irt represents the travel time required for the reclaimer r to perform the task t of the ship i;

[0106] (31)RMV r It represents the travel time of the reclaimer r through a stack;

[0107] (32)RJT irt represents the time required for reclaimer r to perform task t of ship i;

[0108] (33)RJV r Represents the operating efficiency of the reclaimer r;

[0109] (34)LMT iltc represents the travel time required for loader l to perform task t of ship i;

[0110] (35)LMV l It indicates the travel time of the loader l passing through a cabin;

[0111] (36)SE itt' If task t' of ship i is executed after task t, the value is 1, otherwise the value is 0;

[0112] (37)RMT ii'r It represents the time for the reclaimer r to move from the last task stacking position of ship i to the first task of ship i';

[0113] (38)LMT ii'l It represents the time for the loader l to move from the last task cabin position of the ship i to the first task cabin of the ship i';

[0114] (39)Dis rl represents the distance from the reclaimer r to the ship loader l;

[0115] (40)IWT ibrl It indicates that the ship i is docked at berth b, and the time required for the loader l and reclaimer r to carry out the loading operation is allocated;

[0116] (41)M ii'b If ship i' berths at berth b after ship i, the value is 1, otherwise the value is 0;

[0117] (42)ML ii'l If ship i' is assigned loader l after ship i, the value is 1, otherwise the value is 0;

[0118] (43)MR ii'r If ship i' is assigned reclaimer r after ship i, the value is 1, otherwise the value is 0;

[0119] (44)X ib The value is 0 or 1, 1 means that ship i berths at berth b during the planning period;

[0120] (45)Y il The value is 0 or 1, 1 means that ship i is assigned to loader l;

[0121] (46)Z ir The value is 0 or 1, 1 means that ship i is assigned to reclaimer r;

[0122] (47)θ ibrl The value is 0 or 1, 1 means that ship i is docked at berth b, and loader l and reclaimer r are assigned to carry out loading operations;

[0123] Among them, the symbol M ii'b ML ii'l , MR ii'r , X ib , Yil , Z ir ,θ ibrl is the decision variable.

[0124] Secondly, in order to reduce the difficulty of constructing and solving the berth-ship loading equipment collaborative scheduling model of the embodiment of the present application, the assumptions of the berth-ship loading equipment collaborative scheduling model are as follows:

[0125] (1) Each reclaimer continuously performs the reclaiming task of the same ship;

[0126] (2) The ship's demand and the ship's loading order are known;

[0127] (3) Once the ship has completed loading operations, it shall immediately apply to leave the port;

[0128] (4) The operating efficiency of the reclaimer and the transport efficiency of the belt conveyor are both known;

[0129] (5) Failure of loading equipment is not considered;

[0130] (6) Batching operations of multiple reclaimers are not considered;

[0131] (7) Online operation of multiple ship loaders is not considered.

[0132] Next, see Figure 2 , Figure 2 The flowchart of the method for scheduling dry bulk cargo port loading operations provided by the embodiment of the present application is shown. Figure 2 As shown, the scheduling method includes:

[0133] S201. Establish a berth-ship loading equipment collaborative scheduling model with the minimum total ship's port time as the objective function; the constraints of the berth-ship loading equipment collaborative scheduling model include: berth allocation constraints, reclaimer allocation constraints, berth-ship loading machine allocation constraints, reclaimer travel time constraints, loader travel time constraints, loading operation completion time constraints, ship operation time and port departure time constraints.

[0134] Before executing step S201 to establish a berth-ship loading equipment collaborative scheduling model with the minimum total ship in-port time as the objective function, it is necessary to analyze the influencing factors of the berth-ship loading equipment collaborative scheduling model:

[0135] The dry bulk port is a complex multi-task scheduling system. The various tasks are closely linked and mutually influenced, and are subject to various factors. Therefore, before establishing the berth-shipping equipment collaborative scheduling model, it is necessary to analyze the various influencing factors and their influencing methods. The influencing factors of the berth-shipping equipment collaborative scheduling model can be divided into: infrastructure and layout, loading process, equipment operation efficiency, equipment operation conflict and basic ship information. The specific analysis is as follows:

[0136] (1) Infrastructure and layout

[0137] The infrastructure of the port mainly includes storage yards and berths, and the loading equipment mainly includes reclaimers and ship loaders. These resources are scarce and expensive to add, so the reasonable scheduling of them actually affects the loading process; for example, the distribution location of the products required by the ship in the storage yard determines the selected reclaimer, which in turn affects the loading time of the ship; the berthing capacity of the berth affects whether the ship can dock at the berth.

[0138] (2) Loading process

[0139] The loading operation includes the entire process from transportation from the yard to the berth. However, the reclaimer has its range of action corresponding to the yard, and there is a corresponding relationship between the reclaimer and the loader. The loader can only act on a specific berth. Therefore, accessibility constraints are also an important factor affecting the berth allocation and loading equipment allocation of the entire loading operation process.

[0140] (3) Operation efficiency of loading equipment

[0141] Ship loaders and reclaimers have their own operating efficiency and moving speed, but there are differences between different equipment. The overall scheduling process is a process of multi-equipment coordination. Different equipment combinations determine the overall operating efficiency of the ship. Therefore, the reasonable allocation of loading equipment is the decisive factor affecting the overall loading efficiency.

[0142] (4) Conflicts in loading equipment operations

[0143] Both the reclaimer and the loader can move on their tracks, so there is a possibility of cross-operation conflicts. At the same time, if two reclaimers are retrieving materials from a stack at the same time, a collision conflict will occur, increasing the ship's stay time in the port, thereby affecting the next ship's entry time.

[0144] (5) Basic information of the ship

[0145] The ship itself has attributes such as length and draft, which determine whether the ship can be allocated to the corresponding berth and affect the overall operation allocation; at the same time, the demand for the ship affects the loading time of the ship.

[0146] Based on the analysis of the influencing factors of the above-mentioned berth-ship loading equipment collaborative scheduling model, the constraint conditions of the berth-ship loading equipment collaborative scheduling model provided in the embodiment of the present application include: berth allocation constraint, reclaimer allocation constraint, berth-ship loading machine allocation constraint, reclaimer travel time constraint, loader travel time constraint, loading operation completion time constraint, ship operation time and departure time constraint; the specific description of the constraint conditions is as follows:

[0147] (1) According to the berthing capacity of the ship, the berths and the material collection locations of the yard are allocated, and the berth allocation constraints are obtained as follows:

[0148]

[0149] Formula (1) indicates that a berth must be allocated to each ship arriving at the port; Formula (2) indicates that each ship can only be allocated to a berth that is suitable for its length; Formula (3) indicates that the draft of each ship must be less than the limited physical depth of the berth; Formula (4) indicates that ships allocated to the same berth must berth in a certain order, that is, if two ships are allocated the same berth, they must use the berth in turn according to the berthing order; Formula (5) indicates that only one ship can berth at each berth to ensure that the operating time of ships using the same berth does not overlap; Formula (6) indicates that the inventory of cargo types in the yard meets the loading capacity of the cargo types required by the ship.

[0150] (2) According to the reclaiming position of the stockyard, the reclaimer is assigned to perform the reclaiming operation, and the reclaimer allocation constraint is obtained as follows:

[0151]

[0152] Formula (7) indicates that each ship has only one reclaimer to operate; Formula (8) indicates that under the condition of satisfying the accessibility constraint of the reclaimer-yard, one reclaimer is assigned to each ship docked at the berth for loading operation; Formula (9) indicates that the operations of two ships assigned the same reclaimer must follow the order of operation; Formula (10) introduces a safety distance to avoid the conflict of cross-operation of reclaimers on the same track; Formula (11) avoids collision of reclaimers on different tracks when reclaiming the same stack, that is, only one reclaimer is arranged to reclaim at the same stack position.

[0153] (3) According to the berth where the ship is docked, the loader is allocated to carry out the loading operation, and the berth-loader allocation constraints are as follows:

[0154]

[0155] Formula (12) indicates that each ship has only one loader to operate; Formula (13) indicates that under the condition of satisfying the berth-loader constraint accessibility, one loader is assigned to each ship docked at the berth for loading operations; Formula (14) indicates that the operations of two ships assigned the same loader must follow the order of operation.

[0156] (4) Determine the travel time constraints of the reclaimer;

[0157]

[0158] Formula (15) represents the time required for the reclaimer to travel when performing the task of reclaiming materials in each hold of a ship; Formula (16) represents the time required for the same reclaimer to travel from the last task stack of the ship to the first task stack of the next ship when performing the tasks of different ships.

[0159] (5) Determine the travel time constraints of the ship loader;

[0160]

[0161] Formula (17) represents the time required for the loader to travel when performing loading tasks in each hold of a ship; Formula (18) represents the time required for the same loader to travel from the last task hold of the ship to the first task hold of the next ship when performing tasks on different ships.

[0162] (7) Determine the time constraints for completing the loading operation;

[0163]

[0164] Formula (19) represents the material taking time of a ship to perform a loading task in a single hold; Formula (20) represents the completion time of a ship's loading operation, which is composed of the loading operation time of all holds, the walking time of the material taking machine for stacking and the walking time of the loader.

[0165] (8) Vessel operation time and departure time constraints

[0166]

[0167] Formula (21) indicates that each ship can only carry out loading operations after arriving at the port; Formula (22) indicates that the ship's end operation time is equal to the sum of the ship's start operation time and the ship's loading operation time; Formula (23) indicates that the start operation time of the next ship assigned to the same berth and using the same reclaimer and loader must be the sum of the previous ship's operation completion time plus the loading equipment preparation time, and the loading equipment preparation time is the maximum value of the loader's cabin shifting time and the reclaimer's stacking time.

[0168] After determining the constraints of the berth-ship loading equipment collaborative scheduling model, the value range of the variables in the berth-ship loading equipment collaborative scheduling model is defined as follows:

[0169]

[0170] Under the constraint conditions of the berth-ship loading equipment collaborative scheduling model, step S101 is executed to establish the berth-ship loading equipment collaborative scheduling model with the minimum total time of the ship in port as the objective function.

[0171] In this step, firstly, the optimization goal is to minimize the total time of the ship in port, and the objective function is established as follows:

[0172]

[0173] Then, the berth-ship loading equipment collaborative scheduling model is established based on the constraints and objective function of the berth-ship loading equipment collaborative scheduling model.

[0174] S202, obtaining a data set; the data set includes: basic berth data, ship loader information, reclaimer information, basic information of incoming ships and ship loading information.

[0175] In this step, the basic data of the berth includes: the length of the berth, berthing capacity and distance information from the yard; the loader information includes: the operating efficiency and moving speed of the loader; the reclaimer information includes: the number, operating efficiency and moving speed of the reclaimer; the basic information of the incoming ship includes: the length of the ship, the tonnage of the ship, the type of cargo required, the total demand and the estimated arrival time of the ship; the ship loading information includes: the order of loading each hold of the ship and the demand for each hold.

[0176] S203: using the data set and utilizing a discrete optimization algorithm to solve the berth-ship loading equipment collaborative scheduling model to obtain a scheduling plan for each berth and ship loading machine.

[0177] For details, please refer to Figure 3 , Figure 3 The flowchart of the steps of solving the berth-ship loading equipment coordinated scheduling model using the discrete optimization algorithm provided in the embodiment of the present application is shown. Figure 3 As shown in the figure, the steps for solving the berth-shipping equipment coordinated scheduling model include:

[0178] S301, initialization parameter setting; the parameters include: population size N, maximum number of iterations maxT and migration coefficient M.

[0179] S302: Generate an initial population according to the loading operation process using a three-layer real number coding method.

[0180] Specifically, the initial population is generated according to the loading operation process using a three-layer real number coding method, including:

[0181] Step 3021, number the berth, ship loader and reclaimer respectively.

[0182] Step 3022: randomly assigning berths, ship loaders and reclaimers to generate multiple scheduling plans for the ship, and using the berth number, the ship loader number and the reclaimer number to represent each scheduling plan for the ship;

[0183] Step 3023: Utilize a scheduling scheme corresponding to all ships to jointly characterize the position of any individual in the initial population to generate the initial population.

[0184] Here, please see Figure 4 , Figure 4 Schematic diagram of a three-layer real number encoding method provided in an embodiment of the present application is shown. Figure 4 As shown, the code consists of three rows, the first row is the berth number, the second row is the loader number, and the third row is the reclaimer number; in addition, for ease of understanding, the embodiment of the present application also numbers the ships, and the first column of the code is the scheduling plan for ship 1, that is, ship No. 1 is assigned berth No. 3, loader No. 2 and reclaimer No. 5; the second column is the scheduling plan for ship 2, that is, ship No. 2 is assigned berth No. 2, loader No. 3 and reclaimer No. 4, and so on, to obtain a scheduling plan corresponding to all ships respectively, and these scheduling plans jointly represent the position of any individual in the initial population; further, using the three-layer real number coding method, the positions of other individuals in the initial population can also be obtained to establish the initial population.

[0185] S303: Calculate the fitness value F of each individual in the current population.

[0186] Specifically, the fitness value is the objective function value; the fitness value F of each individual in the population is calculated by the following formula (26):

[0187]

[0188] Where F is the objective function value, that is, the fitness value; TE i is the end time of operation of ship i; TI i is the planned port arrival time of vessel i.

[0189] S304: Determine whether the current number of iterations t reaches the maximum number of iterations maxT.

[0190] If the current number of iterations t does not reach the maximum number of iterations maxT, execute step S305;

[0191] If the current number of iterations t reaches the maximum number of iterations maxT, execute step S308;

[0192] S305, determine whether the random number rand is greater than 0.5;

[0193] In this step, the embodiment of the present application introduces an artificial hummingbird optimization algorithm to update the individual positions in the current population. Further, the purpose of determining whether the random number rand is greater than 0.5 is to allocate the update strategy of the individual position according to the value of the random number: guided foraging or regional foraging. In the guided foraging stage, the individual chooses diagonal flight, omnidirectional flight, and axial flight with the flight probabilities shown in the following equations (27) and (28):

[0194]

[0195] Where w is a dynamic adjustment factor, which is used to adjust the probability of hummingbirds choosing the three flight modes. max is the maximum weighted coefficient, w min is the minimum weighting coefficient, r is a random number ranging from [0,1], D(1), D(2) and D(3) are the direction vectors for diagonal flight, omnidirectional flight and axial flight respectively.

[0196] In guided flight, the updated position of an individual actually moves between the position of the target individual and the original position of the individual. The embodiment of the present application introduces the Hamming distance to define the distance between the position of the target individual and the original position of the individual. The Hamming distance refers to: the sum of the number of unequal corresponding positions of two individuals, for example, x 1 =(1,2,3,4,5,6,7), x 2 =(1,3,5,6,2,4,7), x 1 and x 2 The numbers in the 2nd, 3rd, 4th, 5th, and 6th positions are not equal, and there are five positions with different numbers, that is, define x 1 and x 2 The Hamming distance H(x 1 ,x 2 )=5.

[0197] Furthermore, in order to simulate the guided flight process, the embodiment of the present application also introduces a method of mutual intersection to update the individual position, in which the selection of the intersection dimension and the value of the direction vector have the following relationship: when flying diagonally, there is an idea of ​​uncertain length, When flying in all directions, we have the idea that all dimensions need to be changed, and D(2) = H(x i ,x target ); During axial flight, the dimensions that change in individual positions are relatively small, with D(3)=3.

[0198] Specifically, if the random number rand is greater than 0.5, step S305a is executed to calculate the dynamic adjustment function p using the following formula (29):

[0199]

[0200] S305b, determining whether the random number rand is greater than the dynamic adjustment function p;

[0201] When the random number rand is greater than the dynamic adjustment function p, step S305c is executed to update the individual positions in the current population using the first guided foraging method shown in the following formula (30):

[0202] X new=Cross(X target ,X i ) (30)

[0203] Where, X new is the updated position of the individual, i.e. the new gene, X target is the position of the target individual, i.e. the target gene, X i is the original position of the individual, i.e. the original gene;

[0204] Here, please see Figure 5 , Figure 5 FIG. 4 shows a schematic diagram of a first guided foraging method provided in an embodiment of the present application. Figure 5 As shown, the first guided foraging method is: from the target gene X target D points are randomly selected from the , where D is the direction vector, and embedded into the new gene X new The corresponding point in the new gene X new The remaining sites are represented by the original gene X i Complete the sequences in one by one;

[0205] When the random number rand is not greater than the dynamic adjustment function p, step S305d is executed to update the individual positions in the current population using the second guided foraging method shown in the following formula (31):

[0206] X new =Cross(X target ,X i ,X pbest ,X gbest ) (31)

[0207] Where, X pbest is the current optimal individual, X gbest is the global optimal individual;

[0208] The second guided foraging method refers to: using the global optimal individual and the current optimal individual for flight guidance, and each column is composed of X according to the first guided foraging method. target , X pbest and X gbest Guide the generation of new gene X new ;

[0209] If rand is not greater than 0.5, then step S305e is executed to update the individual positions in the current population using the regional foraging method shown in the following equation (32):

[0210] X new =Reverse(X i ) (32)

[0211] Here, please see Figure 6 , Figure 6 A schematic diagram of the regional foraging method provided in the embodiment of the present application is shown. Figure 6 As shown, the regional foraging refers to: in the original gene X i Randomly select D points on the gene, sort them in reverse order, and then insert them into the original gene X i New gene X new .

[0212] S306, judging whether the current number of iterations t reaches the migration coefficient M;

[0213] If the current number of iterations t reaches the migration coefficient M, then execute step S307;

[0214] S307, using the migration foraging method, randomize the individual Xworst with the smallest fitness value F in the current population to a new individual to correct the individual position, and execute step S303;

[0215] If the current number of iterations t does not reach the migration coefficient M, then execute step S303;

[0216] S308. Output the global optimal individual position and optimal fitness value F of the current population.

[0217] In addition, after the artificial hummingbird optimization algorithm is used to update the individual positions in the current population, the method further includes: detecting and repairing the updated individuals using the following methods:

[0218] For each ship, the ship will be inspected and repaired in the following manner:

[0219] Check whether the berthing position of the ship exceeds the berth value range. If the berthing position of the ship exceeds the berth value range, a berth is randomly generated within the berth value range;

[0220] Check whether the berthing capacity of the berth meets the requirements of the corresponding berthed ships. If the berthing capacity of the berth does not meet the requirements of the corresponding berthed ships, a berth is randomly generated under the constraints of the ship and berth accessibility matrix;

[0221] Check whether two ships are assigned the same berth in a certain time period and whether they overlap. If two ships are assigned the same berth in a certain time period and whether they overlap, then reallocate the berth to the ship according to the first-come-first-occupied principle and berth allocation constraints. If no suitable berth is found, postpone the berthing time until a feasible berth is found.

[0222] Check whether the loader allocation satisfies the berth-loader accessibility constraint and whether there is any cross-operation conflict between the loaders. If the loader allocation does not satisfy the berth-loader accessibility constraint, or there is a cross-operation conflict between the loaders, reallocate the loader to the ship. If no suitable loader is found, postpone the start time of the loader until a feasible loader is found.

[0223] Check whether the reclaimer allocation satisfies the reclaimer-yard accessibility constraint and whether there are cross-operation conflicts or collision conflicts between reclaimers. If the reclaimer allocation does not satisfy the reclaimer-yard accessibility constraint, or there are cross-operation conflicts or collision conflicts between reclaimers, reallocate the reclaimer for the ship. If no suitable reclaimer is found, postpone the start time of the reclaimer operation until a feasible reclaimer is found.

[0224] In addition, in order to verify the effectiveness of the dry bulk port loading operation scheduling method provided in this application, the embodiment of this application established a ship-loading equipment collaborative scheduling model based on the layout characteristics and actual operation data of the Qinhuangdao Port coal terminal, and solved the model.

[0225] See also Figure 7 , Figure 7 An example of a port layout diagram provided in an embodiment of the present application is shown. Figure 7 As shown, the port has a total of 8 yard areas, 6 reclaimers, 4 ship loaders, 4 berths and 48 stacking positions. The stacking position numbers range from 101-108, 201-209, 301-308, 401-408, 501-508, 601-608, and the product types range from 1 to 12. Each stacking position corresponds to a product type. The length of each stacking position is 200 meters and the capacity is 30,000 tons. The reclaimers on the same track are R1, R2, R3, R6, R4 and R5, and the transportation efficiency of the belt conveyor is 5 m / s. The time required for the ship loader to travel to a cabin position is 1.5 minutes, and the time required for the reclaimer to travel to a stacking position is 5 minutes. The operating efficiency of all ship loaders is 6,000 t / h.

[0226] The basic data of the berths of the terminal are shown in Table 1 below;

[0227] Table 1 Berth basic data table

[0228]

[0229] The accessibility constraints between berths and ship loaders are shown in Table 2 below, indicating the names of ship loaders that can be allocated at the berth;

[0230] Table 2 Berth and loader accessibility constraints

[0231]

[0232] The basic information of ships coming to the port is shown in Table 3 below;

[0233] Table 3 Basic information of ships arriving at the port

[0234]

[0235] The ship loading information is shown in Table 4 below;

[0236] Table 4 Ship loading information

[0237]

[0238] The reclaimer information is shown in Table 5 below;

[0239] Table 5 Reclaimer information table

[0240]

[0241]

[0242] The ship-loading equipment collaborative scheduling model established in the embodiment of the present application is solved by using the discrete optimization algorithm of the present application and the original discrete optimization algorithm respectively. The parameters of the two algorithms are set as: max =0.9, w min =0.6, the population size N is 100, the maximum number of iterations maxT is 50, and it is run independently 10 times. The statistical results of the optimal solution, the worst solution, the average value and the standard deviation of the objective function value are shown in Table 6, and the schematic diagram of the optimal iteration process of the discrete optimization algorithm of this application and the original discrete optimization algorithm is shown in Figure 8 As shown; the dotted line is the original discrete optimization algorithm, and the solid line is the discrete optimization algorithm of this application, such as Figure 8 As shown, the original discrete optimization algorithm converged to 3397min at the 21st generation, while the discrete optimization algorithm of the present application converged to the optimal value of 3325min at the 30th generation. It is obvious that the original discrete optimization algorithm fell into the local optimal solution, while the discrete optimization algorithm of the present application was able to jump out of the local optimal solution and converge to a smaller optimal value with high stability.

[0243] Table 6 Algorithm comparison table

[0244]

[0245] The above contents are only preferred embodiments of the present invention. For ordinary technicians in this field, many changes can be made in the specific implementation methods and application scopes based on the ideas of the present technical content. As long as these changes do not deviate from the concept of the present invention, they all fall within the scope of protection of this patent.

Claims

1. A method for scheduling loading operations at a dry bulk cargo port, characterized in that: The scheduling method comprises: A berth-ship loading equipment collaborative scheduling model is established with the minimum total ship in-port time as the objective function; the constraints of the berth-ship loading equipment collaborative scheduling model include: berth allocation constraints, reclaimer allocation constraints, berth-ship loading machine allocation constraints, reclaimer travel time constraints, ship loading machine travel time constraints, loading operation completion time constraints, ship operation time and departure time constraints; Acquire a data set; the data set includes: basic berth data, ship loader information, reclaimer information, basic information of incoming ships, and ship loading information; The data set is used to solve the berth-ship loading equipment collaborative scheduling model using a discrete optimization algorithm to obtain a scheduling plan for each berth and ship loading equipment.

2. The method according to claim 1, characterized in that The assumptions of the berth-shipping equipment coordinated scheduling model are as follows: (1) Each reclaimer continuously performs the reclaiming task of the same ship; (2) The ship's demand and the ship's loading order are known; (3) Once the ship has completed loading operations, it shall immediately apply to leave the port; (4) The operating efficiency of the reclaimer and the transport efficiency of the belt conveyor are both known; (5) Failure of loading equipment is not considered; (6) Batching operations of multiple reclaimers are not considered; (7) Online operation of multiple ship loaders is not considered.

3. The method according to claim 1, characterized in that The method uses the data set to solve the berth-ship loading equipment collaborative scheduling model using a discrete optimization algorithm to obtain a scheduling plan for each berth and ship loading machine, including: S1, initialization parameter setting; the parameters include: population size N, maximum number of iterations maxT and migration coefficient M; S2. Generate the initial population according to the loading process using a three-layer real number coding method; S3, calculate the fitness value F of each individual in the current population; S4, determine whether the current number of iterations t reaches the maximum number of iterations maxT; If the current number of iterations t does not reach the maximum number of iterations maxT, execute step S5; If the current number of iterations t reaches the maximum number of iterations maxT, execute step S8; S5. Use the artificial hummingbird optimization algorithm to update the individual positions in the current population; S6, judging whether the current number of iterations t reaches the migration coefficient M; If the current number of iterations t reaches the migration coefficient M, execute step S7; S7, using the migration foraging method, randomize the individual Xworst with the smallest fitness value F in the current population to a new individual to correct the individual position, and execute step S3; If the current number of iterations t does not reach the migration coefficient M, execute step S3; S8. Output the global optimal individual position and optimal fitness value F of the current population.

4. The method according to claim 3, characterized in that According to the loading operation process, the initial population is generated by using a three-layer real number coding method, including: Number the berths, ship loaders and reclaimers respectively; For each ship, a berth, a loader and a reclaimer are randomly assigned to generate multiple scheduling plans for the ship, and each scheduling plan for the ship is represented by the berth number, the loader number and the reclaimer number respectively; The position of any individual in the initial population is jointly characterized by a scheduling scheme corresponding to all ships to generate the initial population.

5. The method according to claim 3, characterized in that The fitness value is the objective function value; The fitness value F of each individual in the population is calculated by the following formula: Where F is the objective function value, that is, the fitness value; TE i is the end time of operation of ship i; TI i is the planned port arrival time of vessel i.

6. The method according to claim 3, characterized in that The method of using the artificial hummingbird algorithm to update the individual positions in the current population includes: S5a, determine whether the random number rand is greater than 0.5; If the random number rand is greater than 0.5, then step S5b is executed to calculate the dynamic adjustment function p using the following formula: S5b, determine whether the random number rand is greater than the dynamic adjustment function p; When the random number rand is greater than the dynamic adjustment function p, step S5c is executed to update the individual positions in the current population using the first guided foraging method as shown in the following formula: X new =Cross(X target ,X i ) In the formula, X new is the updated position of the individual, i.e. the new gene, X target is the position of the target individual, i.e. the target gene, X i is the original position of the individual, i.e. the original gene; The first guided foraging method is: from the target gene X target D points are randomly selected from the , where D is the direction vector, and embedded into the new gene X new The corresponding point in the new gene X new The remaining sites are represented by the original gene X i Complete the sequences in one by one; When the random number rand is not greater than the dynamic adjustment function p, step S5d is executed to update the individual positions in the current population using the second guided foraging method shown in the following formula: X new =Cross(X target ,X i ,X pbest ,X gbest ) In the formula, X pbest is the current optimal individual, X gbest is the global optimal individual; The second guided foraging method refers to: using the global optimal individual and the current optimal individual for flight guidance, and each column is composed of X according to the first guided foraging method. target , X pbest and X gbest Guide the generation of new gene X new ; If the random number rand is not greater than 0.5, step S5e is executed to update the individual positions in the current population using the regional foraging method shown in the following formula: X new =Reverse(X i ) The regional foraging refers to: in the original gene X i Randomly select D points on the gene, sort them in reverse order, and then insert them into the original gene X i New gene X new .

7. The method according to claim 3, characterized in that After the positions of individuals in the current population are updated by using the artificial hummingbird optimization algorithm, the following method is also included: detecting and repairing the updated individuals by using: For each ship, the ship will be inspected and repaired in the following manner: Check whether the berthing position of the ship exceeds the berth value range. If the berthing position of the ship exceeds the berth value range, a berth is randomly generated within the berth value range; Check whether the berthing capacity of the berth meets the requirements of the corresponding berthed ships. If the berthing capacity of the berth does not meet the requirements of the corresponding berthed ships, a berth is randomly generated under the constraints of the ship and berth accessibility matrix; Check whether two ships are assigned the same berth in a certain time period and whether they overlap. If two ships are assigned the same berth in a certain time period and whether they overlap, then reallocate the berth to the ship according to the first-come-first-occupied principle and berth allocation constraints. If no suitable berth is found, postpone the berthing time until a feasible berth is found. Check whether the loader allocation satisfies the berth-loader accessibility constraint and whether there is any cross-operation conflict between the loaders. If the loader allocation does not satisfy the berth-loader accessibility constraint, or there is a cross-operation conflict between the loaders, reallocate the loader to the ship. If no suitable loader is found, postpone the start time of the loader until a feasible loader is found. Check whether the reclaimer allocation satisfies the reclaimer-yard accessibility constraint and whether there are cross-operation conflicts or collision conflicts between reclaimers. If the reclaimer allocation does not satisfy the reclaimer-yard accessibility constraint, or there are cross-operation conflicts or collision conflicts between reclaimers, reallocate the reclaimer for the ship. If no suitable reclaimer is found, postpone the start time of the reclaimer operation until a feasible reclaimer is found.

Citation Information

Cited By

  • Method for acquiring target production scheduling plan of wharf and electronic device

    CN119130299A