Wharf production scheduling method and system and related equipment thereof
By optimizing the terminal scheduling method and combining the constraints of ships and berths, the optimal berthing plan and transportation tasks were determined, which solved the problem of high energy consumption in terminal berthing operations and achieved the effect of energy conservation and consumption reduction.
Patent Information
- Application Number
- CN202411545968.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-01
- Publication Date
- 2024-11-29
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Existing dock scheduling methods fail to effectively consider energy conservation and consumption reduction factors, resulting in high energy consumption during berthing operations.
By obtaining the berthing plans of vessels waiting to berth, and combining the vessel preparation time, available berthing time periods, and berth safety rules, the arrival berthing sequence and berths are optimized to determine the optimal berthing plan. Based on this plan, loading and unloading transportation tasks and yard transportation tasks are determined, including the loading and unloading volume and the number of equipment resources, in order to optimize the direct loading coefficient and operation time.
This reduced energy consumption during dock berthing operations, improved operational efficiency, and achieved the goal of energy conservation and consumption reduction.
Smart Images

Figure CN119047804A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of port technology, and in particular to a dock production scheduling method, system and related equipment. Background Art
[0002] Energy conservation and consumption reduction can not only reduce corporate costs, but also bring positive effects to the ecology and energy of society. The current dock berthing operation adopts intelligent scheduling methods to achieve automated scheduling, which greatly improves the port's throughput. However, the current scheduling method often schedules production with the goal of completing the berthing operation task in the shortest time, without considering energy conservation and consumption reduction factors. That is, the dock scheduling method of related technologies leads to high energy consumption in berthing operations, and no effective solution has been proposed yet. Summary of the invention
[0003] The embodiments of the present application provide a dock production scheduling method, system and related equipment to at least solve the problem of high energy consumption in berthing operations caused by the dock production scheduling method in the related art.
[0004] A production scheduling method for a dock, comprising: Obtaining a berthing plan for the ship to be docked, the berthing plan includes the berthing order and berthing berth; taking the preparation process duration of the ship, the berthing time period of the berth and the berthing safety rules as constraints, optimizing the berthing order and berthing berth according to the preset constraint targets to obtain the optimal berthing plan, wherein the preset constraint targets are the optimal direct loading coefficient and operation duration of the berthing operation; Determine the cargo handling and transportation tasks according to the optimal berthing plan, wherein the cargo handling and transportation tasks include the cargo handling volume between the yard and the ship, the cargo handling volume between the ships, and the number of cargo handling equipment resources used; The yard transportation task is determined according to the loading and unloading volume between the yard and the ship, and the yard transportation task includes the stacks corresponding to the in-and-out cargo and the quantity of the loading and unloading equipment resources used.
[0005] In some embodiments, obtaining a berthing plan of a ship to be docked includes: In the case where the berthing priorities of the ships to be docked are the same, determining the berthing order of the ships to be docked according to the arrival order of the ships to be docked; In the case that there are high-priority ships with higher berthing priorities and low-priority ships with lower berthing priorities among the ships to be docked, a plurality of the berthing orders at the port are determined according to the arrival time and the berthing priority.
[0006] In some embodiments, the preset constraint target is: The minimum value is obtained by making "the total operation time for all ships to be berthed to complete the berthing operation + α × the sum of the time when all ships to be berthed do not meet the direct loading operation conditions when performing berthing operations"; wherein α is a coefficient used to adjust the importance of the direct loading coefficient.
[0007] In some embodiments, determining the loading and unloading transportation task according to the optimal berthing plan includes: Determine multiple time points with preset time intervals in the future time period, and obtain the berth status of each berth at the terminal at the initial time point; According to the optimal berthing plan, the berthing status and loading and unloading tasks at the current time point are determined at each time point; and according to the completion progress of the berthing status and loading and unloading tasks, the berthing and unberthing arrangements of the ship to be docked are made.
[0008] In some of the embodiments, the yard transportation task also includes: the number of stacks corresponding to the ore mixing task and the number of loading and unloading equipment resources used.
[0009] A production scheduling system for a dock, comprising: The berthing and unberthing module is used to obtain the berthing plan of the ship to be docked, and the berthing plan includes the berthing sequence and berthing berth; taking the preparation process duration of the ship, the berthing time period of the berth and the berthing safety rules as constraints, the berthing sequence and berthing berth are optimized according to the preset constraint targets to obtain the optimal berthing plan, wherein the preset constraint targets are the optimal direct loading coefficient and operation duration of the berthing operation; A transportation task module, used to determine the loading and unloading transportation task according to the optimal berthing plan, wherein the loading and unloading transportation task includes the loading and unloading volume between the yard and the ship, the loading and unloading volume between the ships, and the number of loading and unloading equipment resources used; The yard decision module is used to determine the yard transportation task according to the loading and unloading volume between the yard and the ship. The yard transportation task includes the stacking corresponding to the in-and-out cargo and the number of loading and unloading equipment resources used.
[0010] In some embodiments, the preset constraint target is: The minimum value is obtained by making "the total operation time for all ships to be berthed to complete the berthing operation + α × the sum of the time when all ships to be berthed do not meet the direct loading operation conditions when performing berthing operations"; wherein α is a coefficient used to adjust the importance of the direct loading coefficient.
[0011] In some of the embodiments, the transportation task module is used to determine multiple time points with preset time intervals in a future time period, and obtain the berth status of each berth at the terminal at the initial time point; according to the optimal berthing plan, decide the berth status and loading and unloading transportation tasks at the current time point at each time point; and according to the completion progress of the berth status and loading and unloading transportation tasks, arrange the berthing and unberthing of the ship to be docked.
[0012] An electronic device includes a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the above-mentioned dock scheduling method.
[0013] A storage medium stores a computer program, wherein the computer program is configured to execute the above-mentioned dock scheduling method when running.
[0014] Compared with the related art, the scheduling method, system and related equipment of the terminal provided in the embodiment of the present application obtains the berthing plan of the ship to be docked, and the berthing plan includes the berthing sequence and berthing berths; takes the preparation process duration of the ship, the berthing time period of the berth and the berth safety rules as constraints, optimizes the berthing sequence and berthing berths according to the preset constraint targets, and obtains the optimal berthing plan, wherein the preset constraint targets are the direct loading coefficient and the operation duration of the berthing operation are optimized; according to the optimal berthing plan, the loading and unloading and transportation tasks are determined, and the loading and unloading and transportation tasks include the loading and unloading volume between the yard and the ship, the loading and unloading volume between the ship and the ship, and the number of loading and unloading equipment resources used; according to the loading and unloading volume between the yard and the ship, the yard transportation tasks are determined, and the yard transportation tasks include the stacks corresponding to the inbound and outbound goods and the number of loading and unloading equipment resources used, which solves the problem of high energy consumption of berthing operations caused by the terminal scheduling method in the related art and reduces the energy consumption of the terminal berthing operation.
[0015] Details of one or more embodiments of the present application are set forth in the following drawings and description to make other features, objects, and advantages of the present application more readily apparent. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:
[0017] Figure 1 It is a hardware structure block diagram of a terminal of the production scheduling method of a dock according to an embodiment of the present application;
[0018] Figure 2 is a flow chart of a method for scheduling production at a terminal according to an embodiment of the present application;
[0019] Figure 3 is a structural block diagram of a production scheduling system for a terminal according to an embodiment of the present application;
[0020] Figure 4 It is a production scheduling flow chart of the production scheduling system of the terminal according to the embodiment of the present application. DETAILED DESCRIPTION
[0021] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is described and illustrated below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. Based on the embodiments provided in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application. In addition, it can also be understood that although the efforts made in this development process may be complex and lengthy, for ordinary technicians in the field related to the contents disclosed in the present application, some changes such as design, manufacturing or production based on the technical contents disclosed in the present application are only conventional technical means, and should not be understood as insufficient contents disclosed in the present application.
[0022] Reference to "embodiments" in this application means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those of ordinary skill in the art that the embodiments described in this application may be combined with other embodiments without conflict.
[0023] Unless otherwise defined, the technical terms or scientific terms involved in this application should be understood by people with ordinary skills in the technical field to which this application belongs. The words "one", "a", "a", "the" and the like involved in this application do not indicate a quantity limitation, and may indicate the singular or plural. The terms "include", "comprise", "have" and any of their variations involved in this application are intended to cover non-exclusive inclusions; for example, a process, method, system, product or device that includes a series of steps or modules (units) is not limited to the listed steps or units, but may also include steps or units that are not listed, or may also include other steps or units inherent to these processes, methods, products or devices. The words "connect", "connected", "coupled" and the like involved in this application are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The "multiple" involved in this application means greater than or equal to two. "And / or" describes the association relationship of associated objects, indicating that there can be three relationships. For example, "A and / or B" can mean: A exists alone, A and B exist at the same time, and B exists alone. The terms "first", "second", "third" and the like involved in the present application are merely used to distinguish similar objects and do not represent a specific ordering of the objects.
[0024] The method embodiment provided in this embodiment can be executed in a terminal, a computer or a similar computing device. Taking running on a terminal as an example, Figure 1 1 is a hardware structure block diagram of a terminal according to a method for scheduling production at a terminal according to an embodiment of the present application. Figure 1 As shown, the terminal may include one or more ( Figure 1 Only one is shown in the figure) a processor 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data. Optionally, the terminal may also include a transmission device 106 and an input / output device 108 for communication functions. It can be understood by those skilled in the art that Figure 1 The structure shown is for illustration only and does not limit the structure of the above terminal. Figure 1 More or fewer components as shown, or with Figure 1 Different configurations are shown.
[0025] The memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the production scheduling method of the dock in the embodiment of the present application. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, to implement the above method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor 102, and these remote memories may be connected to the terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0026] The transmission device 106 is used to receive or send data via a network. The specific example of the above network may include a wireless network provided by a communication provider of the terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, referred to as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.
[0027] The present application embodiment provides a method for scheduling production at a dock. Figure 2 is a flow chart of a method for scheduling production at a terminal according to an embodiment of the present application, such as Figure 2 As shown, the process includes the following steps: Step S201, obtaining a berthing plan for the ship to be docked, the berthing plan includes the berthing sequence and berthing berths; taking the preparation process duration of the ship, the berthing time period of the berth and the berth safety rules as constraints, optimizing the berthing sequence and berthing berths according to the preset constraint targets to obtain the optimal berthing plan, wherein the preset constraint targets are the optimal direct loading coefficient and operation duration of the berthing operation.
[0028] The ships to be docked are determined by the production scheduling demand task list. In this embodiment, the production scheduling demand task list includes three types of tasks, namely, first-pass ship tasks, second-pass ship tasks, and mixed ore tasks.
[0029] The tasks of a ship trip mainly include the Chinese name of the ship, the time of arrival at the anchorage, the type of ship, the operation time, the type of ore carried, the maximum belt flow, the unloading volume, the single mixed pile type, the upper limit of the number of unloaders allowed, the procedure time, the medium-length time, the berthing priority, etc.
[0030] In addition to the same content as the first-leg ship task, the second-leg ship task also includes the name of the first-leg ship corresponding to the cargo owner of each ore that the ship needs to load, the name of the first-leg ship that the cargo owner of each ore that the ship needs to load can directly load, and the preparation process time parameters related to the second-leg ship task (such as constant time, drainage time, water receiving time, etc.).
[0031] The mixed ore task mainly includes task batches, remaining mixed ore quantity, mixed pile batches, and ore types carried.
[0032] The above-mentioned berthing plan can be one or more, and usually multiple. When obtaining the berthing plan of the ship to be docked, if the berthing priorities of the ships to be docked are the same, the berthing order of the ships to be docked is determined according to the arrival order of the ships to be docked. For example, if the berthing priorities of ships A, B, and C that arrive at the port in sequence are the same, then their arrival order in the berthing plan is also ships A, B, and C. However, between ship A and ship B, or between ship B and ship C, there may also be ships that arrive later but have a higher berthing priority.
[0033] In the case where there are high-priority ships with higher berthing priorities and low-priority ships with lower berthing priorities among the ships to be docked, multiple berthing orders are determined according to the arrival time and berthing priority. For example, the berthing priority of ship D is higher than that of ships A, B, and C; when the arrival time of ship D is later than that of ship B and ship C, but the difference in their arrival times is less than a time threshold (for example, half an hour), then the arrival order of the ships in the berthing plan can be either ships A, D, B, C, or ships A, B, D, C. That is, there are multiple possible berthing plans.
[0034] In this embodiment, in order to reduce the energy consumption of the berthing operation, two factors are mainly considered: the direct loading coefficient and the total duration of the berthing operation.
[0035] Direct loading at the terminal refers to "direct loading at shipside" or "direct loading and unloading" operations, which is a special ore loading and unloading process in which the ore is transferred directly from a transport vehicle (such as a truck or train) to a ship, or vice versa, from a ship to a transport vehicle without going through the storage link at the terminal yard.
[0036] In some of the embodiments, the preset constraint target is: to make "the total operation time for all ships to be berthed to complete the berthing operation + α×the sum of the time when all ships to be berthed do not meet the direct loading operation conditions when performing the berthing operation" reach the minimum value; wherein α is a coefficient used to adjust the importance of the direct loading coefficient. α is a positive number. When the value of α is larger, the consumption reduction effect is better; conversely, when the value of α is smaller, the consumption reduction effect is smaller. When the value of α is 0, it is equivalent to not considering the consumption reduction effect, but only considering the operation time.
[0037] In this embodiment, a berthing plan is solved for each feasible port arrival sequence to obtain the berthing plan with the best effect as the optimal berthing plan. The optimization process is described below. The optimization process involves the following sets, parameters, and decision variables.
[0038] (I) Sets (capital letters are set names, followed by lowercase letters are set elements) 1. Decision time frame , ; 2. One-way boat ride , ; 3. Two-way ship , ; 4. One-way boat type collection , ; 5. Second-City Ship Type Collection , ; 6. Each ship Permissible range of berthing time , ; 7. Each ship Permissible range of departure time , ; 8. Each ship A collection of available berths , ; 9. Berth and A combination of ship types that will cause conflicts if they dock one after another and some of their docking times overlap , ; 10. Theoretically, a pairing of one-way and two-way vessels that can be directly loaded , .
[0039] (II) Parameters 1. Number of ships per trip ; 2. Number of Second-Way Vessels ; 3. Ship Ship Type ; 4. Each ship Estimated duration of the job ; 5. Each ship Process time before loading and unloading ; 6. Berth Preparation time between ship calls ; 7. Berth and Two types of ships docked successively and Required safe berthing interval time ; 8. Parameters of direct installation coefficient consumption reduction .
[0040] Decision variables 1. Ship Berth time ; 2. Ship Departure time ; 3. The latest time for all ships to complete berthing operations ; 4. Chengchuan Whether to rely on berth ; 5. Time period Is it later than the ship? Start time of loading and unloading , satisfy; 6. Time period Is it earlier than the ship? End of loading and unloading time , satisfy; 7. Time period Is it on a boat? During loading and unloading time , in; 8. Time period Is it on a boat? and During loading and unloading time , in; 9. Time period Whether it meets the direct installation conditions , satisfy.
[0041] The above steps can directly solve the value of the decision variable by constructing a mathematical programming model. The objective function and some key constraints of the planning model are explained below.
[0042] 1. Objective function The objective function attempts to strike a balance between "completing a given task in the shortest possible time" and "creating as many direct installation opportunities as possible"; .
[0043] (II) Constraints 1. The latest time for all ships to complete berthing operations should be later than the departure time of all ships: ; 2. Each ship must and can only berth at a berth it can berth: ; 3. The berthing time of each vessel must be at least longer than the sum of the loading and unloading time and other process time: ; 4. Vessels at the same berth must not overlap in time and allow time for berth preparation: ; 5. If the berthing times of ships at different berths overlap, conflicts will occur. The berthing times must not overlap: ; 6. Vessels berthing at different berths must leave safe berthing interval time: ; 7. Yes Variable value restrictions: ; 8. Yes Variable value restrictions: ; 9. Yes Variable value restrictions: ; 10. Yes Variable value restrictions: ; 11. Yes Variable value restrictions: ; 12. Variable value range limitation: berthing and unberthing time must meet the following requirements: ; 13. Variable value range limit: 0-1 Variable requirements: .
[0044] Step S202, determining the cargo handling and transportation tasks according to the optimal berthing plan, the cargo handling and transportation tasks including the cargo handling volume between the yard and the ship, the cargo handling volume between the ships and the number of cargo handling equipment resources used.
[0045] In the loading and unloading and transportation tasks, unless there are small flow restrictions for special mines, we set the large machine at the head of each process to grab materials at the maximum efficiency of actual work, and allocate 2 to 3 ship unloaders to each process, and do not consider the situation where one ship unloader works for one process.
[0046] In this embodiment, starting from the start of production scheduling, the future T time is used as the decision range, and T is divided into N discrete time periods, each of which is separated by a time point. According to the optimal berthing plan, determining the loading and unloading transportation task includes: determining multiple time points with a preset time interval in the future time period, and obtaining the berth status of each berth at the terminal at the initial time point; according to the optimal berthing plan, deciding the berth status and loading and unloading transportation task at the current time point at each time point; and arranging the berthing and unberthing of the ship to be docked according to the berthing status and the completion progress of the loading and unloading transportation task.
[0047] After the berthing plan is determined, the next step is to determine the transportation tasks in each discrete time period. This part of the decision does not involve the pick-up and drop-off location in the yard, but only determines: In the calculation, how much weight of a certain ore on the corresponding ship is transferred to the yard, or how much weight is transferred to a second-pass ship that is moored at the same time; at the same time, how much weight of a certain ore is transferred from the yard to a second-pass ship. Of course, the number of unloaders to be scheduled and the belts to be used will also be determined here. The following lists the important sets, parameters, and decision variables of the preliminary mathematical model of the conveying task module.
[0048] 1. Collection Mine collection per ship , .
[0049] (II) Parameters 1. One boat trip The maximum number of unloaders allowed to be used simultaneously ; 2. Two-way ship Maximum number of unloaders allowed to be used simultaneously for direct loading ; 3. Each ship Loading and unloading Mineral species , Mineral Quantity , element attributes ; 4. Each ship Loading and unloading The first Name of the consignor , mineral quantity , Single mixed stack type , 0 single pile, 1 non-mixed ore, 2 mixed ore; 5. Each ship Loading and unloading The first The allowable range of elements when mixing ore for each consignor ; 6. Theoretically, direct loading can be paired with one or two vessels Paired mineral species ; 7. Theoretically, direct loading can be paired with one or two vessels Name of the second-leg shipper ; 8. Total number of ship unloaders ; 9. Material reclaiming efficiency of a single ship unloader per unit time period ; 10. Reclaiming efficiency of a single bucket wheel excavator per unit time period .
[0050] Decision variables 1. Time Ship To the ship Direct loading ore ; 2. Time Ship Ore entering the stockpile ; 3. Time Ship Number of ship unloaders used in the yard ; 4. Time yard to ship The mine .
[0051] The specific process of calculating decision variables includes the following steps:
[0052] Step 1: Input the current berth status at each discrete time, i.e., the dynamic attributes listed in the information list.
[0053] Step 2, complete the instantaneous decision of the free berth at each discrete moment and the state transition to the next moment. First, determine whether the berth preparation time is full. If not, no berthing will be arranged, and it will still be free at the beginning of the next time period; if it is full, determine whether the current time period belongs to the allowable range of the berthing time of the next ship. If not, no berthing will be arranged, and it will still be free at the next moment; if it does, determine whether the ship type of the next berthing ship conflicts with the ships parked at other berths. If there is a conflict, no berthing will be arranged, and it will still be free at the next moment; if there is no conflict, determine whether the ship type of the next berthing ship and the ships parked at other berths have filled the berthing safety interval time. If not, no berthing will be arranged, and it will still be free at the beginning of the next time period; if it meets the requirements, arrange the next ship to berth, and change the current state of the berth to the information of the next ship. The conflict combination and safety interval time are used for unloading berths.
[0054] Step 3, when the berth is busy, if the ship has not completed the pre-loading and unloading process time, the transportation task will not be arranged, and the remaining process time of one time period will be reduced at the beginning of the next moment, and the other attributes will remain unchanged; if the pre-loading and unloading process has been completed, it is determined whether there is any remaining quantity / quantity to be loaded. If so, the direct loading decision and state transfer are completed first, and then the entry and exit decision and state transfer are completed; if there is no remaining quantity / quantity to be loaded, it is determined whether the current time period belongs to the allowable range of the current ship's departure time. If not, the initial attributes of the next moment remain unchanged; if it does, the ship is arranged to leave, and the current state of the berth is changed to idle, and the initial berth preparation time at the next moment is increased by one time period.
[0055] Step 4: Complete the direct loading task decision. Identify the judgment rule for direct loading operation: Determine whether there is a ship in the collection among the stopped ships. The paired ship in → Determine whether the ore type to be loaded and unloaded by the paired ship at this stage is → Determine whether the unloading stage is loading The owner's ore → Determine whether the remaining quantity of the direct-loaded ore unloaded from the paired ship is greater than the quantity to be loaded.
[0056] If the above rules are met, then the paired ships that meet the rules The prerequisite for direct installation is met. However, it is necessary to ensure that each paired ship that is ultimately scheduled for direct installation They must be different, because the second-pass vessel can only use one process at a time. It is also necessary to ensure that the total number of unloaders does not exceed , unloading The total number of ship unloaders used shall not exceed After the above conditions are met, for each paired ship Arrange a direct installation process and unloader, it is possible to determine the direct transfer of each pair within the period. Quantitative The next moment, Boat Reduction in the amount of mineral residues , Boat The amount of ore to be loaded is reduced .
[0057] Step 5: When all possible direct-fitting counterparts are completed or there is no direct-fitting counterpart, the entry and exit decision is made.
[0058] For the unloading berth, the approach operation is carried out: the approach process is arranged for the ships with remaining capacity according to the rule of 2 or 3 unloaders with one belt, and 3 are given priority. It is necessary to ensure that the number of approach belts called does not exceed the remaining available after the direct loading decision, and the number of unloaders called does not exceed the remaining available after the direct loading decision. The total number of ship unloaders used shall not exceed If unloading A total of If a ship unloader is used for the yard, it can be determined that the ship will be transferred to the yard during this period. The order of minerals is as follows: The order in which the goods are unloaded is as follows. The amount of minerals After all uninstallation is completed, start uninstallation Planting mines. The next moment, The remaining amount of the mineral species being unloaded by the ship is decreasing .
[0059] Carry out exit operation for loading berth: it can be determined that the yard needs to be transferred to the ship during this period The order of minerals is as follows: The order in which the goods are loaded is in sequence. The amount of minerals After all the installation is completed, start installing Planting mines. The next moment, The amount of minerals that are currently being loaded on the ship has decreased Elemental attributes and other mine-related parameters will be allocated to each entry and exit task and serve as the basis for obtaining yard transportation tasks.
[0060] Step S203, determining the yard transportation task according to the loading and unloading volume between the yard and the ship, the yard transportation task includes the stacks corresponding to the in-and-out cargo and the quantity of the loading and unloading equipment resources used.
[0061] In some of the embodiments, the yard transportation task also includes: the number of stacks corresponding to the ore mixing task and the number of loading and unloading equipment resources used.
[0062] After the transportation task decision is determined, the next step is to determine the stockpile decision, including which stockpiles the incoming transportation tasks will enter, which stockpiles the outgoing transportation tasks will be taken from, which bucket wheel machines will be used, and how to use the remaining bucket wheel machines for ore mixing operations. The following lists the important sets, parameters, and decision variables of the preliminary mathematical model of the stockpile decision module.
[0063] 1. Collection 1. On-site missions within time , ; 2. Missions within time , ; 3. Bucket wheel excavator , ; 4. Mixed ore batches , ; 5. Stacking in yard , ; 6. Finished ore stacking Batch collection , ; 7. Yard and aisle , ; 8. Entry and exit tasks Optional stacking in accordance with the mineral properties , ; 9. Bucket wheel excavator Working stacking , ; 10. Bucket wheel excavator Tasks that can be worked on , ; 11. Bucket wheel excavator Work Tasks Optional stacking , .
[0064] (II) Parameters 1. Mission The amount of minerals ; 2. Mission Mineral Type ; 3. Mission The mineral density ; 4. Mineral Type In the pile Height limit ; 5. Mixed ore batches The remaining mixed ore ; 6. Mixed ore batches Finished Minerals ; 7. Mixed ore batches Silicon content of finished ore ; 8. Mixed ore batches Raw material minerals 1 ; 9. Mixed ore batches Raw material minerals 2 ; 10. Stacking Starting position ; 11. Stacking The end position ; 12. Stacking The pile road ; 13. Stacking The amount of minerals ; 14. Stacking Mineral Type ; 15. Stacking Element attributes ; 16. Stacking The eigenvector of ; 17. Bucket wheel excavator Work Tasks Optimal stacking at ; 18. Bucket wheel excavator Work Tasks The impact value of the evaluation function on the yard .
[0065] Decision variables Will the task Assigned to bucket wheel machine .
[0066] The specific process of calculating decision variables includes the following steps: Step 1: Arrange the decision variables in the transport module into the input set of the yard module and Please note that if multiple processes are arranged for unloading, they also need to be recorded as different tasks and assigned to different bucket wheel machines later.
[0067] Step 2: According to the task The mineral types, elemental properties, allowed elemental property ranges, and the mineral types and elemental properties of the existing stacks are used to determine whether it is possible to work on the stacks. , the entry mission Can be an empty set, which means that an empty field is needed. If it is an empty set, it means that the first-leg ship corresponding to the second-leg ship will unload in the next time or the finished ore will be mixed out in the next time, and the allocation model will not assign this task. Therefore, at least The allocation model needs to be repeated before the discrete time of the task. The task is assigned to a bucket wheel machine.
[0068] Step 3: If a bucket wheel machine of Included A subset of , and the bucket wheel machine can complete The task type (in or out) is belong .if belong , for and The intersection of .
[0069] For every bucket wheel machine And the tasks it can work on calculate , the yard status scoring function is , Used to control the implementation of longer idle gaps: , , is a convex function, which means that when the idle gap becomes longer, the marginal contribution to the scoring function gradually decreases. Are adjacent stacks on the same aisle The length of the gap between ), or the gap between the head and tail of the stack closest to the edge. Used to control the dispersion of minerals on the pile: , , which means that the more aisles the same mineral occupies, the better, but occupying too many aisles will reduce the marginal benefit. of Is a vector that records the types of minerals in each pile The weight and.
[0070] The task Arrange in Each stack in In, according to Calculate the length of the updated stack after this task is completed; if If it is an empty set, stack it from the free gap; thus, calculate the impact on the evaluation function, select the stack with the largest positive impact, and assign its value to .
[0071] Step 4: Construct the following planning model to assign tasks to bucket wheel machines and solve them directly. Ensure that in each discrete time period, each bucket wheel machine can only work on one task; each task can only be assigned to one bucket wheel machine; in each discrete time period, different bucket wheel machines cannot work on the same stack when doing their respective tasks, which can ensure the problem of safety limit; ; ; ; ; Step 5. After the task is assigned, at the beginning of each time period, make the following judgments on the current stockpile status and the stacking arrangement given in the previous allocation model: whether all the tasks in this discrete time period have been given in the previous allocation model; whether the stacking arranged for the incoming task can still accommodate the ore volume of the incoming task; whether the stacking arranged for the outgoing task still exists at this moment or whether it can meet the outgoing ore volume.
[0072] Step 6, when all three conditions are met, execute all inbound and outbound tasks in this time period according to the results of the allocation model. Identify idle belts and idle bucket wheels in this time period. The belts that need attention are: ABC line of the second part of the inbound and A line of the outbound. Combined with the idle bucket wheels, the first set of available blending processes can be determined. When the first set of blending processes is idle, the first set is used first. Then determine the available second set of blending processes based on the number of idle bucket wheels. As long as there are unfinished blending batches, they will be arranged in this discrete time period.
[0073] Step 7: Transfer the stockpile state to the next discrete time period according to the entry and exit tasks and the ore mixing tasks. If the stockpile does not generate a new stack, directly cover the original stack or extend the number of meters; if a new stack is generated, leave or do not leave a gap for material removal according to requirements. The length of the stack is reduced from left to right.
[0074] Step 8: If any of the above three conditions is not met, a new round of allocation model is required. Read the latest status and repeat steps 2 to 7.
[0075] Step 9: After all the entry and exit arrangements within the decision time range are completed, identify the process number to be used based on the selection of the belt conveyor and bucket wheel excavator.
[0076] Through the above production scheduling method, on the one hand, the direct loading coefficient can be increased, and a direct loading process with fewer belt conveyors can be used, thereby reducing energy consumption per unit time, saving space, and facilitating yard turnover. On the other hand, since the relationship between process energy consumption and flow rate is relatively small, the flow rate of the belt conveyor is increased within the safe flow rate range, the operation time is reduced, and significant energy consumption reduction is achieved.
[0077] The embodiment of the present application also provides a production scheduling system for a dock. Figure 3 is a structural block diagram of a production scheduling system for a terminal according to an embodiment of the present application, such as Figure 3 As shown, the system includes: The berthing and unberthing module 31 is used to obtain the berthing plan of the ship to be docked, which includes the berthing sequence and berthing berth; taking the preparation process duration of the ship, the berthing time period of the berth and the berthing safety rules as constraint conditions, the berthing sequence and berthing berth are optimized according to the preset constraint targets to obtain the optimal berthing plan, wherein the preset constraint targets are the optimal direct loading coefficient and operation duration of the berthing operation; The transportation task module 32 is used to determine the loading and unloading transportation tasks according to the optimal berthing plan. The loading and unloading transportation tasks include the loading and unloading volume between the yard and the ship, the loading and unloading volume between the ships, and the number of loading and unloading equipment resources used; The yard decision module 33 is used to determine the yard transportation task according to the loading and unloading volume between the yard and the ship. The yard transportation task includes the stacking corresponding to the in-and-out cargo and the number of loading and unloading equipment resources used.
[0078] In some of the embodiments, the berthing and unberthing module 31 is used to: when the berthing priorities of the ships to be docked are the same, determine the berthing order according to the arrival order of the ships to be docked; when there are high-priority ships with higher berthing priorities and low-priority ships with lower berthing priorities among the ships to be docked, determine multiple berthing orders according to the arrival time and berthing priority.
[0079] In some of the embodiments, the preset constraint target is: to make "the total operation time for all ships to be berthed to complete the berthing operation + α×the sum of the time when all ships to be berthed do not meet the direct loading operation conditions when performing berthing operations" achieve the minimum value; where α is a coefficient used to adjust the importance of the direct loading coefficient.
[0080] In some of the embodiments, the transport task module 32 is used to determine multiple time points with preset time intervals in a future time period, and obtain the berth status of each berth at the terminal at the initial time point; according to the optimal berthing plan, decide the berth status and loading and unloading transport tasks at the current time point at each time point; and arrange the berthing and unberthing of the ships to be docked according to the berth status and the completion progress of the loading and unloading transport tasks.
[0081] In some of the embodiments, the yard transportation task also includes: the number of stacks corresponding to the ore mixing task and the number of loading and unloading equipment resources used.
[0082] Figure 4 is a production scheduling flow chart of the production scheduling system of the terminal according to an embodiment of the present application. Figure 4 The algorithm logic of the production scheduling method is demonstrated in the paper. Time is the decision-making scope, Internal The scheduling system will make decisions for the terminal in three main modules based on the current system status: berthing and unberthing module, transportation task module, and yard decision module, and reflect The system status of a discrete time period. The berthing and unberthing module uses a planning model to solve the berthing positions of a batch of ships that have not yet docked at the port and the berthing order of ships docked at each berth. The transportation task module is guided by the berthing and unberthing module, and uses the prescribed decision rules and state transfer to decide the transportation task within each discrete time period and give the direct loading process. The yard decision module is guided by the transportation task module, and uses the yard evaluation function and allocation planning model to give the stacking selection and corresponding process of the in-and-out yard transportation task, and uses idle equipment for ore mixing. Since stacking is the lowest priority process at the terminal, the frequency of using the stacking process is almost in the single digit each year. In the early algorithm debugging, the stacking process is not considered in the yard decision module.
[0083] It should be noted that the above modules can be functional modules or program modules, and can be implemented by software or hardware. For modules implemented by hardware, the above modules can be located in the same processor; or the above modules can be located in different processors in any combination.
[0084] An embodiment of the present application further provides an electronic device, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
[0085] Optionally, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.
[0086] Optionally, in this embodiment, the processor may be configured to execute the dock production scheduling method via a computer program.
[0087] It should be noted that the specific examples in this embodiment can refer to the examples described in the above embodiments and optional implementation modes, and this embodiment will not be described in detail here.
[0088] In addition, in combination with the dock production scheduling method in the above embodiment, the present application embodiment can provide a storage medium for implementation. The storage medium stores a computer program; when the computer program is executed by a processor, any of the dock production scheduling prediction methods in the above embodiment is implemented.
[0089] Those skilled in the art should understand that the technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0090] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.
Claims
1. A method for scheduling production at a wharf, characterized in that: include: Obtaining a berthing plan for a ship to be docked, the berthing plan including the berthing sequence and berthing berths; Taking the preparation process duration of the ship, the berthing time period of the berth and the berth safety rules as constraint conditions, the berthing sequence and berthing berths are optimized according to the preset constraint targets to obtain the optimal berthing plan, wherein the preset constraint targets are the optimal direct loading coefficient and operation duration of the berthing operation; Determine the cargo handling and transportation tasks according to the optimal berthing plan, wherein the cargo handling and transportation tasks include the cargo handling volume between the yard and the ship, the cargo handling volume between the ships, and the number of cargo handling equipment resources used; The yard transportation task is determined according to the loading and unloading volume between the yard and the ship, and the yard transportation task includes the stacks corresponding to the in-and-out cargo and the quantity of the loading and unloading equipment resources used.
2. A dock production scheduling method according to claim 1, characterized in that: Obtaining the berthing plan of the vessel to be docked includes: In the case where the berthing priorities of the ships to be docked are the same, determining the berthing order of the ships to be docked according to the arrival order of the ships to be docked; In the case that there are high-priority ships with higher berthing priorities and low-priority ships with lower berthing priorities among the ships to be docked, a plurality of the berthing orders at the port are determined according to the arrival time and the berthing priority.
3. A dock production scheduling method according to claim 1, characterized in that: The preset constraint target is: The minimum value is obtained by making "the total operation time for all ships to be berthed to complete the berthing operation + α × the sum of the time when all ships to be berthed do not meet the direct loading operation conditions when performing berthing operations"; where α is the coefficient used to adjust the importance of the direct loading coefficient.
4. A dock production scheduling method according to claim 1, characterized in that: According to the optimal berthing plan, the loading and unloading transportation tasks are determined to include: Determine multiple time points with preset time intervals in the future time period, and obtain the berth status of each berth at the terminal at the initial time point; According to the optimal berthing plan, the berthing status and loading and unloading tasks at the current time point are determined at each time point; and according to the completion progress of the berthing status and loading and unloading tasks, the berthing and unberthing arrangements of the ship to be docked are made.
5. A dock production scheduling method according to claim 1, characterized in that: The yard transportation task also includes: the number of stacks corresponding to the ore mixing task and the number of loading and unloading equipment resources used.
6. A production scheduling system for a dock, characterized in that: include: The berthing and unberthing module is used to obtain the berthing plan of the ship to be docked, and the berthing plan includes the berthing sequence and berthing berth; Taking the preparation process duration of the ship, the berthing time period of the berth and the berth safety rules as constraint conditions, the berthing sequence and berthing berths are optimized according to the preset constraint targets to obtain the optimal berthing plan, wherein the preset constraint targets are the optimal direct loading coefficient and operation duration of the berthing operation; A transportation task module, used to determine the loading and unloading transportation task according to the optimal berthing plan, wherein the loading and unloading transportation task includes the loading and unloading volume between the yard and the ship, the loading and unloading volume between the ships, and the number of loading and unloading equipment resources used; The yard decision module is used to determine the yard transportation task according to the loading and unloading volume between the yard and the ship. The yard transportation task includes the stacking corresponding to the in-and-out cargo and the number of loading and unloading equipment resources used.
7. A dock production scheduling system according to claim 6, characterized in that: The preset constraint target is: The minimum value is obtained by making "the total operation time for all ships to be berthed to complete the berthing operation + α × the sum of the time when all ships to be berthed do not meet the direct loading operation conditions when performing berthing operations"; where α is the coefficient used to adjust the importance of the direct loading coefficient.
8. A dock production scheduling system according to claim 6, characterized in that: The transportation task module is used to determine multiple time points with preset time intervals in a future time period, and obtain the berth status of each berth at the terminal at the initial time point; according to the optimal berthing plan, decide the berth status and loading and unloading transportation tasks at the current time point at each time point; and arrange the berthing and unberthing of the ship to be docked according to the berth status and the completion progress of the loading and unloading transportation tasks.
9. An electronic device comprising a memory and a processor, characterized in that: A computer program is stored in the memory, and the processor is configured to run the computer program to execute the production scheduling method for a terminal according to any one of claims 1 to 5.
10. A storage medium, characterized in that: The storage medium stores a computer program, wherein the computer program is configured to execute the production scheduling method for a terminal according to any one of claims 1 to 5 when running.
Citation Information
Patent Citations
One-way channel ship berthing and departing planning algorithm
CN115239181A
Intelligent bulk cargo ship planning and automatic classification method
CN116502866A
Intelligent ship berthing method and system
CN118313631A
Ship demand analysis-based berth allocation method and system
CN118446463A
Berth control expert system
JP1991189702A
Cited By
Method for acquiring target production scheduling plan of wharf and electronic device
CN119130299A
A method and electronic device for obtaining a target production schedule for a terminal
CN119130299B
