Dynamic steam distribution method based on circular queue algorithm

Abstract

The invention relates to the technical field of industrial automation control, and discloses a steam dynamic distribution method based on a circular queue algorithm, which comprises the following steps: step 1, starting to receive steam demand information from all tanks, judging whether the steam demands of all tanks are met, and if not, entering step 2; if all the conditions are met, fuel adding is stopped, and steam supply is reduced; and step 2, performing priority ranking on the steam requirements of the tanks, dynamically distributing steam according to the priority, and preferentially distributing the steam to the sugar boiling tanks. According to the method, the steam distribution priorities of the two tanks are dynamically distributed in real time through the circular queue algorithm, the resource utilization rate can be remarkably increased, the priority can be dynamically adjusted according to real-time data through the algorithm, reasonable distribution and effective utilization of resources can be ensured, and the resource utilization rate is improved. The method is of great significance in improving the production efficiency, reducing the cost and guaranteeing the stable operation of the key process.

Description

Technical Field

[0001] The present invention relates to the technical field of industrial automation control, and particularly to a steam dynamic allocation method based on a circular queue algorithm. Background Art

[0002] Due to the continuous growth of technological innovation and market demand, the new energy, semiconductor, and robotics fields have become new growth points in the automation market. At the same time, some traditional fields such as printing and food industries have also shown a certain growth rate, which benefits from the requirements of equipment renewal and the intelligent and automated transformation of traditional industries. Along with the wave of the fourth industrial revolution, the global manufacturing industry is undergoing a transformation towards digitalization, networking, and intelligence. The introduction and integration of technologies such as big data, artificial intelligence, 5G, and visual recognition will profoundly change the automation industry and the enterprises it serves, becoming a new growth engine. In the future, the integration of new technologies and automation control will raise the productivity level of factories to a brand-new height.

[0003] Fixed capacity: The capacity of a circular queue is fixed and cannot be dynamically expanded. When the queue is full, new elements cannot be inserted, which may lead to data loss or processing delays. Fixed element type: A circular queue can only store elements of the same type and cannot store elements of different types, which limits its flexibility in some application scenarios.

[0004] Implementation complexity: The implementation of a circular queue is relatively complex and requires considering the condition judgments of queue full and empty, as well as the management of head and tail pointers, which increases the programming difficulty and the possibility of errors.

[0005] False overflow phenomenon: Although a circular queue can avoid the "false overflow" phenomenon of an array, in some cases, if the head and tail pointers are not properly processed, the queue may appear full while there is actually space, or appear not full while there is actually no available space.

[0006] Synchronization and transmission delay: In a redundant system, synchronization and transmission changes require a certain amount of computing time, which will affect the time lag between two CPUs. Especially in the RUN-Redundant system state, the time lag may be more obvious.

[0007] Response time impact: During the download process in the RUN-Redundant system state, the response time of the system will be limited. The more changes the user program contains, the greater the impact on the response time. Summary of the Invention

[0008] The purpose of the present invention is to provide a steam dynamic allocation method based on a circular queue algorithm to solve the problems raised in the above background art.

[0009] To achieve the above object, the present invention provides the following technical solution: A steam dynamic allocation method based on a circular queue algorithm, comprising the following method steps: Step 1: Start, receive steam demand information from all tanks, and determine whether the steam demands of all tanks are met. If not, proceed to Step 2; if all are satisfied, stop adding fuel and reduce steam supply. Step 2: Sort the steam demands of each tank according to priority, dynamically allocate steam according to the priority, first allocate steam to the sugar boiling tank, and then use the excess steam for other purposes; at the same time, adjust the steam supply for low-priority tanks to optimize the energy efficiency of the overall industrial production process. Step 3: Dynamically adjust the steam supply of the sugar boiling tank and each low-priority tank according to the circular queue algorithm, first allocate steam to the sugar boiling tank, and then use the excess steam for other purposes. Step 4: After the demand of the sugar boiling tank is fully met, the system will, according to the preset circular queue logic, first allocate steam to the sugar boiling tank. If not satisfied, use the excess steam for other purposes and end.

[0010] Preferably, determine whether there is no steam in all tanks. If there is, perform initialization processing on the steam in the tanks. If not, proceed to Step 3.

[0011] Preferably, determine whether the steam has met the demand of the sugar boiling tank. If it has, use the excess steam for other purposes. If not, continue to allocate and adjust the steam according to the circular queue algorithm, and first allocate steam to the sugar boiling tank.

[0012] The present invention provides a steam dynamic allocation method based on a circular queue algorithm. It has the following beneficial effects: (1) According to the requirements of the project plan and the situation of the hardware platform, the present invention designs a circular queue algorithm to dynamically adjust the steam allocation priorities of the sugar boiling and power generation tanks in real time, realizing intelligent control. By designing the circular queue algorithm and combining intelligent control technology, the present invention successfully realizes the real-time dynamic adjustment of the steam allocation priorities of the sugar boiling and power generation tanks, which not only improves the resource utilization efficiency but also ensures the timely steam demand of key processes in case of emergency.

[0013] (2) By using the circular queue algorithm to perform real-time dynamic allocation of the steam allocation priorities of the two tanks, the present invention can significantly improve the resource utilization rate. This algorithm can not only dynamically adjust the priorities according to real-time data but also ensure the reasonable allocation and effective utilization of resources, which is of great significance for improving production efficiency, reducing costs, and ensuring the stable operation of key processes. Description of the Drawings

[0014] Figure 1 This is the schematic diagram of the circular queue algorithm of the present invention; Figure 2 This is the priority judgment of the present invention. After judging that the gas tank 1 reaches the demand, the steam distribution result view for the gas tank 2 is executed; Figure 3 This is the priority judgment view of the present invention for the gas tank 2. Detailed implementation manners

[0015] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without making creative efforts shall fall within the protection scope of the present invention.

[0016] Examples of the embodiments are shown in the accompanying drawings, where the same or similar reference numerals represent the same or similar elements or elements with the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to explain the present invention and should not be construed as a limitation of the present invention.

[0017] A preferred embodiment of a steam dynamic distribution method based on a circular queue algorithm provided by the present invention is as Figures 1-3 shown: A steam dynamic distribution method based on a circular queue algorithm includes the following method steps: Step 1: Start, receive steam demand information from all tanks, and judge whether the steam demands of all tanks are satisfied. If not, enter Step 2; if all are satisfied, stop adding fuel and reduce the steam supply; through the implementation of this Step 1, the optimization of steam use in the entire production process is achieved.

[0018] Step 2: Sort the steam demands of each tank according to priority, dynamically distribute steam according to the priority, first distribute steam to the sugar boiling tank, and then use the excess steam for other purposes; at the same time, adjust the steam supply for the low-priority tanks to optimize the energy efficiency of the overall industrial production process; during this process, the advantages of the circular queue algorithm are fully exerted. By processing and analyzing real-time data, it is ensured that the sugar boiling tank can obtain sufficient steam supply during the peak demand period, thereby effectively improving the sugar quality and output. At the same time, during the non-peak period, the algorithm can automatically adjust and reasonably distribute the remaining steam to other tanks to achieve the goal of energy conservation and emission reduction.

[0019] Judge whether there is no steam in all tanks. If there is steam in all tanks, initialize the steam in the tanks. If there is no steam in all tanks, then enter Step 3; Step 3: According to the circular queue algorithm, dynamically adjust the steam supply of the sugar boiling tank and each low-priority tank. First, allocate steam to the sugar boiling tank, and then use the excess steam for other purposes. Through the implementation of this Step 3, the dynamic allocation mechanism ensures the optimal allocation of production efficiency and energy, and further improves the intelligent level of industrial production. In Step 3, through the real-time monitoring and data analysis of the sugar boiling tank and low-priority tanks, the circular queue algorithm can flexibly respond to changes in production demand and achieve the optimal allocation of resources. This not only improves the operating efficiency of the equipment but also significantly reduces energy consumption, providing a strong guarantee for sustainable production. On this basis, the enterprise can more precisely control the production process and enhance its market competitiveness.

[0020] Judge whether the steam has met the requirements of the sugar boiling tank. If it has been met, use the excess steam for other purposes. If not, continue to allocate and adjust the steam according to the circular queue algorithm, and give priority to allocating steam to the sugar boiling tank.

[0021] Step 4: After the requirements of the sugar boiling tank are fully met, the system will, in accordance with the preset circular queue logic, first allocate steam to the sugar boiling tank. If not met, use the excess steam for other purposes, and end. During this process, the system will also record and analyze the steam usage data in real time to continuously optimize the allocation strategy to adapt to the demand changes in different production stages. In addition, through the linkage with other intelligent systems, such as weather forecasting and energy management systems, the predictability and accuracy of steam allocation can be further improved.

[0022] The circular queue algorithm based on Siemens PLC. Specifically, this algorithm is mainly applied in Siemens PLC (Programmable Logic Controller) programming to implement data structures and logic processing, especially in scenarios that require processing first-in, first-out (FIFO) queues, priority queues, etc. As a core component in the field of industrial automation, Siemens PLC is widely used in the production lines and automation control systems of various factories. The circular queue algorithm plays an important role in it, which can improve production efficiency and quality and solve complex problems in equipment control.

[0023] In summary, due to its First-In-First-Out (FIFO) characteristic, the circular queue is very suitable for managing requests that need to be processed in chronological order. In the steam distribution system, the circular queue algorithm can dynamically adjust the steam distribution priority to ensure efficient resource utilization. Dynamic priority: Dynamically calculate and adjust the priority of steam distribution requests based on real-time data (steam pressure) and preset rules. Resource optimization: Give priority to meeting urgent or important needs, and at the same time release the space of processed requests to avoid resource waste and congestion. Intelligent decision-making: Design an algorithm that comprehensively considers factors such as urgency and equipment status to dynamically calculate the priority. Queue management: Adjust the request order according to the priority and process them in turn to ensure reasonable resource allocation.

[0024] It should be noted that in this article, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the term "comprising", "including" or any other variant thereof is intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements not only includes those elements, but also includes other elements not expressly listed, or also includes elements inherent to such process, method, article or device.

[0025] Finally, it should be noted that the above are only preferred embodiments of the present invention and are not used to limit the present invention. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.

Claims

1. A steam dynamic allocation method based on a circular queue algorithm, characterized in that: The method includes the following steps: Step 1: Start by receiving steam demand information from all tanks and determining whether the steam demand of all tanks is met. If not, proceed to step 2; if all are met, stop adding fuel and reduce the steam supply. Step 2: Prioritize the steam demand of each tank and dynamically allocate steam according to the priority, giving priority to the sugar-boiling tank and using the excess steam for other purposes; at the same time, adjust the steam supply for low-priority tanks to optimize the energy efficiency of the overall industrial production process; Step 3: According to the circular queue algorithm, the steam supply of the sugar boiling tank and each low-priority tank is dynamically adjusted, the steam is preferentially allocated to the sugar boiling tank, and the excess steam is used for other purposes; Step 4: After the demand of the sugar boiling pot is fully met, the system will allocate steam to the sugar boiling pot first according to the preset circular queue logic. If it is not met, the excess steam will be used for other purposes and the process ends.

2. A steam dynamic allocation method based on a circular queue algorithm according to claim 1, characterized in that: Determine whether there is no steam in all the tanks. If there is, initialize the steam in the tanks. If there is no steam, go to step 3.

3. The steam dynamic allocation method based on the circular queue algorithm according to claim 1 is characterized in that: Determine whether the steam has met the needs of the sugar-boiling pot. If so, use the excess steam for other purposes. If not, continue to distribute and adjust the steam according to the circular queue algorithm, and give priority to allocating steam to the sugar-boiling pot.

Images