An engine optimization method, device, equipment, storage medium and program product

Abstract

This application discloses an engine optimization method, apparatus, device, storage medium, and program product. The method includes: obtaining S engines to be replaced in an application and selecting an engine replacement mode; if the engine replacement mode is a first single engine part optimization mode and S is 1, then determining the target replacement part; generating K candidate replacement methods based on multiple engines in an engine database and the target replacement part; and obtaining the target optimized engine based on the optimal candidate replacement method among the K candidate replacement methods; if the engine replacement mode is a multi-engine part interchange mode and S is greater than 1, then generating an optimal batch part replacement scheme from the engine parts contained in each of the S engines to be replaced; and obtaining the target optimized engine corresponding to each of the S engines to be replaced based on the optimal batch part replacement scheme. Using this application, the automated generation of engine part replacement schemes can be achieved.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to an engine optimization method, apparatus, device, storage medium, and program product. Background Technology

[0002] As the culmination of modern industrial technology, aero engines are hailed as the "flower of industry." Their operational reliability, service life, and maintenance efficiency directly determine the operating costs, flight safety, and market competitiveness of airlines and aircraft operators, making them core equipment in the aviation operation system. With the rapid development of the air transport industry, airline fleets are constantly expanding, and the number of engines in service is continuously increasing. Engines of different service ages and operating conditions coexist, and the wear and tear of engine parts (such as fans / low-pressure compressors, high-pressure compressors, combustion chambers, high-pressure turbines, and low-pressure turbines) varies significantly. To extend the overall service life of engines, reduce maintenance costs, and improve the overall operational efficiency of the fleet, parts replacement has become a crucial means in aero engine maintenance. By replacing well-maintained parts with severely worn ones, engine performance can be quickly restored, avoiding downtime and spare engine leasing expenses due to a single part failure, while fully utilizing the remaining service life of each part to maximize asset value. Therefore, how to scientifically and rationally plan parts replacement schemes among engines has become a key requirement for airlines and aircraft operators to improve maintenance levels and control operating costs. In existing technologies, the implementation of engine component interchangeability mainly relies on manual experience. The specific process involves maintenance personnel manually recording and statistically analyzing the operating parameters of each engine (such as runtime, cycle count, exhaust temperature margin, etc.), the wear status and remaining lifespan of each component, and combining this with their accumulated maintenance experience to determine which engines can interchange components, which components to interchange, and the appropriate interchange sequence. Finally, a component interchange plan is formulated and executed. However, this manual experience-based component interchange method is no longer sufficient to meet the refined and efficient requirements of modern aero-engine maintenance. Specifically: First, manual decision-making is highly subjective, has low accuracy, and is prone to errors. Second, it is inefficient and cannot meet the maintenance needs of large-scale fleets. As the fleet size expands, the number of engines and components increases significantly. Manually statistically analyzing the status information of each engine and component requires substantial manpower and time, the formulation of interchange plans is time-consuming, it is difficult to quickly respond to engine maintenance needs, and it cannot effectively improve overall operational efficiency. In summary, existing methods for interchangeing engine parts rely on manual decision-making, which suffers from low accuracy and inefficiency, and cannot meet the needs of airlines and aircraft operators for refined, efficient, and low-cost parts interchangeability. Summary of the Invention

[0003] This application provides an engine optimization method, apparatus, device, storage medium, and program product, which can automate and precisely optimize engine parts replacement, improve the efficiency and rationality of parts replacement, thereby maximizing engine life and fleet operating efficiency, and reducing maintenance costs.

[0004] One embodiment of this application provides an engine optimization method, the method comprising: In the application, obtain S engines to be replaced and select the engine replacement mode for the S engines to be replaced; S is a positive integer; If the engine replacement mode is indicated as the first single engine part optimization mode and S is 1, then the target replacement part is determined from the M engine parts in the engine to be replaced. Based on the multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the best candidate replacement method among the K candidate replacement methods, the engine to be replaced is simulated and assembled to obtain the target optimized engine; K is a positive integer. If the engine replacement mode is indicated as a multi-engine parts interchange mode, and S is greater than 1, then an optimal batch parts replacement scheme is generated from the engine parts contained in the S engines to be replaced. Based on the engine parts indicated by the optimal batch parts replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

[0005] One embodiment of this application provides an engine optimization device, the device comprising: The mode selection module is used to obtain S engines to be replaced in the application and select the engine replacement mode for the S engines to be replaced; S is a positive integer. The first optimization module is used to determine the target replacement part from M engine parts in an engine to be replaced if the engine replacement mode is indicated as the first single engine part optimization mode and S is 1. Based on multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the best candidate replacement method among the K candidate replacement methods, a simulated assembly is performed on an engine to be replaced to obtain the target optimized engine; K is a positive integer. The second optimization module is used to generate the optimal batch part replacement scheme from the engine parts contained in the S engines to be replaced if the engine replacement mode is indicated as a multi-engine part interchange mode and S is greater than 1. Based on the engine parts indicated by the optimal batch part replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

[0006] In one alternative implementation, when the first optimization module determines the target replacement part from M engine parts in an engine to be replaced, the first optimization module is specifically used to perform the following operations: Get the remaining cycle number for each of the M engine parts in the engine to be replaced; The engine part with the minimum number of remaining cycles among the M engine parts is identified as the target replacement part.

[0007] In one optional implementation, when the first optimization module generates K candidate replacement methods based on multiple engines in the engine database and the target replacement parts, the first optimization module is specifically used to perform the following operations: From a database of engines, select Q candidate engines that have the same engine model as the engine to be replaced; Q is a positive integer. From Q candidate engines, obtain the first candidate engine part of the same type as the target replacement part; Obtain the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts. Based on the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts, generate an initial candidate part set from the Q first candidate engine parts. For the first candidate engine part in the initial candidate part set, perform date availability verification, and form a target candidate part set including K first candidate engine parts by the first candidate engine parts that pass the date availability verification. Based on the K first candidate engine parts in the target candidate parts set, generate K candidate replacement methods.

[0008] In one optional implementation, when generating an initial candidate part set from the Q first candidate engine parts based on the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts, the first optimization module is specifically used to perform the following operations: If the restriction state type of the target replacement part is an unrestricted state type, then the first candidate engine parts among the Q first candidate engine parts whose remaining cycle number is greater than or equal to the target remaining cycle number are formed into an initial candidate part set; the target remaining cycle number is the remaining cycle number corresponding to the target replacement part. If the restriction status type of the target replacement part is a restricted status type, then obtain the operable cycle number threshold corresponding to the engine to be replaced, and obtain the cumulative operating cycle number corresponding to Q first candidate engine parts respectively. Among the Q first candidate engine parts, the first candidate engine parts whose cumulative operating cycle number is less than the operable cycle number threshold and whose remaining cycle number is greater than or equal to the target remaining cycle number are formed into an initial candidate part set.

[0009] In one possible implementation, the K candidate replacement methods include candidate replacement method A. i , where i is a positive integer less than or equal to K; the first optimization module is also used to perform the following operations: According to candidate replacement method A i And the remaining engine parts in an engine to be replaced, determine candidate replacement method A. i The minimum remaining cycle number of the corresponding candidate optimized engine; remaining engine parts refer to the engine parts in an engine to be replaced, excluding the target replacement part; Based on candidate replacement method A i The minimum remaining cycle count of the corresponding candidate optimized engine and the remaining cycle count of the target replacement part are used to generate the cycle count improvement for a replacement engine. According to candidate replacement method A i The first candidate engine part and the target replacement part are indicated, and the amount of improvement for each individual part is determined for the target replacement part. The target improvement amount for each cycle is determined based on the improvement amount for the number of cycles and the improvement amount for a single part. If candidate replacement method A i If the restriction state type of the first candidate engine part indicated is the restricted state type, then it will be replaced by candidate replacement method A. i The candidate replacement method A is determined by the cumulative number of operating cycles of the indicated first candidate engine part and the threshold number of operating cycles corresponding to an engine to be replaced. i The corresponding improved value for the remaining number of runnable loops; The target loop improvement and the remaining runnable loop improvement are weighted and summed to obtain candidate replacement method A. i The corresponding optimization score; When the optimization scores corresponding to the K candidate replacement methods are obtained, the candidate replacement method with the highest optimization score is determined as the optimal candidate replacement method among the K candidate replacement methods.

[0010] In one optional implementation, when the first optimization module determines the target cyclic improvement amount based on the improvement amount of the number of cycles and the improvement amount of a single part, the first optimization module is specifically used to perform the following operations: If the improvement in the number of cycles is greater than the first value, then the improvement in the number of cycles is determined as the target improvement in the number of cycles; If the improvement amount of the cycle number is less than or equal to the first value, then the maximum value between the improvement amount of a single part and the first value is determined as the target cycle improvement amount.

[0011] In one alternative implementation, the first optimization module is also used to perform the following operations: If candidate replacement method A i If the constraint state type of the indicated first candidate engine part is an unrestricted state type, then obtain the weighting coefficient for the target cycle improvement amount, and determine the product between the weighting coefficient and the target cycle improvement amount as candidate replacement method A. i The corresponding optimization score.

[0012] In one alternative implementation, the engine optimization device further includes a third optimization module, which is specifically used to perform the following operations: If the engine replacement mode is indicated as the second single engine part optimization mode, and S is 1, then based on M engine parts in an engine to be replaced, N part replacement methods are generated; the part replacement method is used to indicate the number and type of engine parts to be replaced in an engine to be replaced; M and N are both positive integers. Based on multiple engines and N parts replacement methods in the engine database, generate T parts replacement combinations; each parts replacement combination contains M engine parts. Based on the second candidate engine part indicated by the optimal part replacement combination among T part replacement combinations, a simulated assembly of an engine to be replaced is performed to obtain the target optimized engine; T is a positive integer.

[0013] In one optional implementation, the N part replacement methods include part replacement method A. i , where i is a positive integer less than or equal to N; the third optimization module is used to generate T parts replacement combinations based on the engines in the engine database and N parts replacement methods. Specifically, the third optimization module performs the following operations: From a database of engines, select Q candidate engines that have the same engine model as the engine to be replaced; Q is a positive integer. If part replacement method A iIf the number of parts to be replaced is 1, then from the Q candidate engines, second candidate engine parts of the same type as the part to be replaced are obtained. Based on the restriction state type of the part to be replaced and the remaining cycle number corresponding to the Q second candidate engine parts, a set of candidate parts including at least one second candidate engine part is generated. Based on each second candidate engine part in the set of candidate parts and a first other engine part, a part replacement combination is generated for each second candidate engine part. The first other engine part refers to the engine parts in a engine to be replaced other than the part to be replaced. If part replacement method A i If the number of parts to be replaced is not 1, then part replacement method A will be used. i Multiple replacement parts in the engine are grouped into a single part group. From Q candidate engines, candidate part groups of the same type as the part group are obtained. Based on the restriction state type of the second candidate engine parts in the candidate part group and the remaining cycle number of the second candidate engine parts in the Q candidate part groups, a list of candidate part groups including at least one candidate part group is generated. Based on each candidate part group in the list of candidate part groups and the second other engine parts, a part replacement combination for each candidate part group is generated. The second other engine parts refer to the engine parts in an engine to be replaced, excluding the multiple replacement parts.

[0014] In one alternative implementation, the third optimization module is also used to perform the following operations: Based on the remaining cycle number of engine parts in the T parts replacement combinations and the remaining cycle number of M engine parts in the engine to be replaced, determine the minimum cycle optimization amount corresponding to each parts replacement combination and the part improvement amount corresponding to each parts replacement combination. Obtain predefined sorting rules, sort the T parts replacement combinations according to the predefined sorting rules, the minimum loop optimization amount and part improvement amount corresponding to each part replacement combination, and the number of second candidate engine parts indicated in each part replacement combination, to obtain the sorted T parts replacement combinations. The part replacement combination that ranks first among the T sorted part replacement combinations is determined as the optimal part replacement combination among the T part replacement combinations.

[0015] In one optional implementation, when the second optimization module generates the optimal batch parts replacement plan from the engine parts contained in the S engines to be replaced, the second optimization module is specifically used to perform the following operations: Based on S engines to be replaced, generate a list of parts exchange methods for each of the S engines to be replaced. Based on S engines to be replaced and a list of parts exchange methods for each of the S engines to be replaced, P batch parts replacement schemes are generated; each batch parts replacement scheme includes the quantity and type of engine parts used after replacing the engine parts in each of the S engines to be replaced. Obtain the total improvement amount corresponding to each batch of parts replacement scheme. Based on the batch of parts replacement scheme with the largest total improvement amount among the P batch of parts replacement schemes, generate the optimal batch of parts replacement scheme.

[0016] In one optional implementation, when the second optimization module generates a list of parts exchange methods for each of the S engines to be replaced, the second optimization module is specifically used to perform the following operations: Based on the model numbers of the S engines to be replaced, the S engines are grouped into D sets of engines; each set of engines contains at least two engines to be replaced; D is a positive integer less than S; the D sets of engines include engine set B. j j is a positive integer less than or equal to D; For engine set B j For each engine part in each engine to be replaced, a candidate part list is generated; a candidate part list is used to indicate the available parts corresponding to an engine part. According to engine set B j The corresponding candidate part list is filtered to obtain engine set B. j The list of parts exchange methods for each engine to be replaced; the parts exchange method list is used to indicate one or more parts exchange methods corresponding to the engine parts of the engine to be replaced.

[0017] In one optional implementation, when the second optimization module generates P batch parts replacement schemes based on S engines to be replaced and a list of parts exchange methods corresponding to each of the S engines to be replaced, the second optimization module is specifically used to perform the following operations: According to engine set B j For each engine to be replaced, a list of parts exchange methods is generated, and a global conflict matrix is ​​created; the global conflict matrix is ​​used to indicate the mutual exclusion relationship between at least two parts exchange methods. Obtain predefined filtering rules, and based on the predefined filtering rules and engine set B... j The list of parts exchange methods for each engine to be replaced is used to generate an initial batch parts replacement plan; Using the global conflict matrix as a constraint, a set of batch part replacement sub-schemes is obtained from the initial batch part replacement scheme; the set of batch part replacement sub-schemes includes one or more batch part replacement sub-schemes. When the set of batch parts replacement sub-schemes corresponding to each engine set is obtained, P batch parts replacement schemes are formed according to the set of batch parts replacement sub-schemes corresponding to each engine set; a batch parts replacement scheme includes one batch parts replacement sub-scheme corresponding to each engine set.

[0018] In one alternative implementation, the P batch part replacement schemes include batch part replacement scheme C. z z is a positive integer less than or equal to P; the second optimization module is used to obtain the total improvement amount corresponding to each batch part replacement scheme. When generating the optimal batch part replacement scheme based on the batch part replacement scheme with the largest total improvement amount among the P batch part replacement schemes, the second optimization module is specifically used to perform the following operations: Obtain batch parts replacement solution C z The net improvement corresponding to each part exchange method, and the acquisition of batch part replacement scheme C. z The amount of engine improvement associated with the engine to be replaced; Based on batch parts replacement scheme C z The net improvement corresponding to each part exchange method, and the batch part replacement scheme C. z The associated engine improvement amount for the engine to be replaced generates a batch parts replacement plan C. z The corresponding total improvement; When the total improvement amount corresponding to each of the P batch part replacement schemes is obtained, the batch part replacement scheme with the largest total improvement amount among the P batch part replacement schemes is determined as the initial optimal batch part replacement scheme. From the initial optimal batch part replacement scheme, remove the part exchange methods whose net improvement is less than or equal to the first value to obtain the optimal batch part replacement scheme.

[0019] In one alternative implementation, when the application retrieves S engines to be replaced, the mode selection module specifically performs the following operations: In response to an input operation in the application for a minimum remaining cycle number threshold, the minimum remaining cycle number for each engine is obtained from the engine database, and the engines in the engine database whose minimum remaining cycle number is less than the minimum remaining cycle number threshold are identified as S engines to be replaced. Alternatively, in response to an input operation in the application for changing the engine model, identify S engines in the engine database that have the model number of the engine to be replaced. Alternatively, in response to an input operation in the application for changing the engine identifier, identify the engines in the engine database that are identified as engines to be replaced as engines to be replaced as S engines. Alternatively, in response to an input operation in the application regarding a maintenance cycle time period, identify S engines in the engine database whose maintenance cycles fall within the maintenance cycle time period as engines to be replaced.

[0020] One embodiment of this application provides a computer device, including a processor, a memory, and an input / output interface; The processor is connected to a memory and an input / output interface, respectively. The input / output interface is used to receive and output data, the memory is used to store computer programs, and the processor is used to call the computer programs to cause the computer device containing the processor to execute the method in one aspect of the embodiments of this application.

[0021] One aspect of this application provides a computer-readable storage medium storing a computer program adapted to be loaded and executed by a processor, so that a computer device having the processor performs the method of one aspect of this application.

[0022] One aspect of this application provides a computer program product comprising a computer program stored in a computer-readable storage medium. A processor of a computer device reads the computer program from the computer-readable storage medium and executes the computer program, causing the computer device to perform the methods provided in various optional embodiments of this application. In other words, when the computer program is executed by the processor, it implements the methods provided in various optional embodiments of this application.

[0023] Implementing the embodiments of this application will have the following beneficial effects: In this embodiment, S engines to be replaced are obtained in the application, and an engine replacement mode is selected for the S engines to be replaced; S is a positive integer; if the engine replacement mode indicates a first single engine part optimization mode and S is 1, then a target replacement part is determined from M engine parts in an engine to be replaced. Based on multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the optimal candidate replacement method among the K candidate replacement methods, a simulated assembly is performed on an engine to be replaced to obtain a target optimized engine; K is a positive integer; if the engine replacement mode indicates a multi-engine part interchange mode and S is greater than 1, then an optimal batch part replacement scheme is generated from the engine parts contained in the S engines to be replaced. According to the engine parts indicated by the optimal batch part replacement scheme, a batch simulated assembly is performed on the S engines to be replaced to obtain the target optimized engines corresponding to the S engines to be replaced. Through the above process, by selecting different engine replacement modes and analyzing S engines to be replaced, the system automatically generates the optimal part replacement scheme corresponding to either single-engine part optimization or multi-engine part interchange modes. This achieves precise adaptation of engine replacement modes, covering the needs of different operation and maintenance scenarios (part optimization for a single engine, batch part interchange between multiple engines), significantly improving the adaptability and targeting of part replacement in different scenarios, and avoiding the unreasonable solutions caused by indiscriminate and uniform processing in manual decision-making. Simultaneously, it implements an engine part interchange method that does not rely on human experience. Through standardized steps such as data acquisition via application, mode-based planning, database support, and simulated assembly, it achieves intelligent and data-driven part replacement decision-making, thereby improving the efficiency and rationality of part replacement, maximizing engine life and fleet operating efficiency, and reducing operation and maintenance costs. Attached Figure Description

[0024] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0025] Figure 1 This is a network interaction architecture diagram provided in an embodiment of this application; Figure 2 This is a scenario illustration of an engine optimization method provided in an embodiment of this application. Figure 1 ; Figure 3 This is a flowchart illustrating an engine optimization method provided in an embodiment of this application. Figure 1 ; Figure 4 This is a flowchart illustrating an engine optimization method provided in an embodiment of this application. Figure 2 ; Figure 5 This is a scenario illustration of an engine optimization method provided in an embodiment of this application. Figure 2 ; Figure 6 This is a schematic diagram of a sorting process scenario provided in an embodiment of this application; Figure 7 This is a schematic diagram of an engine optimization device provided in an embodiment of this application; Figure 8 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0026] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0027] If this application requires the collection of object data (such as user data), a prompt interface or pop-up window will be displayed before and during the collection process. This prompt interface or pop-up window is used to inform the user that certain data is being collected. The data acquisition steps will only begin after the user confirms the prompt interface or pop-up window; otherwise, the process will end. Furthermore, the acquired user data will be used in reasonable and legal scenarios or for legitimate purposes. Optionally, in scenarios where user data needs to be used but user authorization has not been obtained, authorization can be requested from the user, and the user data can only be used after authorization is granted.

[0028] It is understood that, in the specific embodiments of this application, the user data involved requires user permission or consent when the following embodiments of this application are applied to specific products or technologies, and the collection, use and processing of the relevant data must comply with the relevant laws, regulations and standards of the relevant regions.

[0029] In the embodiments of this application, please refer to Figure 1 , Figure 1 This is a network interaction architecture diagram provided in an embodiment of this application, such as... Figure 1As shown, the system includes a server 101 and a cluster of service devices. The cluster of service devices may include service devices 102a, 102b, 102c, ..., 102n. Communication connections can exist between the service devices in the cluster; for example, there is a communication connection between service devices 102a and 102b, and between service devices 102a and 102c. Simultaneously, any service device in the cluster can have a communication connection with the server 101; for example, there is a communication connection between service device 102a and server 101. Optionally, the communication connection between service device 102a and any other service device (e.g., service device 102b) can be achieved through a communication connection between service device 102a and server 101, and a communication connection between server 101 and service device 102b. The communication connection method is not limited; it can be established directly or indirectly through wired communication, wireless communication, or other methods. This application does not impose any restrictions on this method.

[0030] It should be understood that any business device in server 101 and the business device cluster can have an application installed. When this application runs on each business device and server 101, each business device can communicate with the aforementioned... Figure 1 The servers 101 shown interact with each other, enabling them to receive data or instructions from each business device. This application can be a client application with the ability to display text, images, and other data information, such as an engine module swap optimization tool. This application can provide users with optimized parts swapping schemes between different engines. It can automatically analyze and identify which parts should be replaced in the target engine, or between which engines and in what manner parts should be swapped, thereby maximizing engine life and improving overall operating efficiency.

[0031] This engine optimization method can be executed by any single business device or server 101 in the business device cluster, or by any single business device and server 101 in the business device cluster together; there are no restrictions on this.

[0032] The following example illustrates this engine optimization method using a combination of business device 102b and server 101. An object using business device 102b can open the application within it and input the replacement engine identifier for the engine to be replaced. In response to this input, business device 102b identifies S engines (S=1) in the engine database that match the replacement engine identifier. It should be noted that the engine database is accessible to business device 102b.

[0033] Furthermore, the object using business device 102b can select an engine replacement mode for the S engines to be replaced in the application. Business device 102b can obtain the engine replacement mode for the S engines in response to the selection operation. Business device 102b can then send the S engines to be replaced and their replacement modes to server 101 through the application. Server 101 can obtain the S engines to be replaced and their replacement modes, perform optimization analysis based on the S engines to be replaced and their replacement modes, and obtain the optimal parts replacement plan. This optimal parts replacement plan indicates how to replace engine parts in the S engines to be replaced, and which engine's engine parts to replace them with.

[0034] It should be noted that when the engine replacement mode is indicated as the first single engine part optimization mode, the optimal part replacement scheme is the optimal candidate replacement method; when the engine replacement mode is indicated as the multi-engine part interchange mode, the optimal part replacement scheme is the optimal batch part replacement scheme.

[0035] Server 101 can return the optimal parts replacement plan to business device 102b. Business device 102b can then simulate the assembly of the S engines to be replaced according to the optimal parts replacement plan, obtaining the target optimized engines corresponding to the S engines to be replaced. The simulated assembly refers to the process of virtually matching, combining, and assembling the matched engine parts with the engines to be replaced according to the optimal parts replacement plan, without performing actual physical disassembly and assembly operations, to obtain the optimized structure and state of the target optimized engine.

[0036] It should be noted that the engines and engine parts mentioned above are not physical entities, but rather identifiers or information used to indicate physical entities. In other words, the engine to be replaced mentioned above is not the physical entity of the engine, but rather information used to indicate the physical entity of the engine to be replaced, such as identification information, simulation image information, or engine unique name information.

[0037] It is understood that the business equipment and server mentioned in the embodiments of this application can also be a type of computer equipment. Specifically, the business equipment mentioned above can be an electronic device, including but not limited to mobile phones, tablets, desktop computers, laptops, handheld computers, augmented reality / virtual reality (AR / VR) devices, wearable devices, and other mobile internet devices (MIDs) with network access capabilities. Figure 1 As shown, the service device can be a mobile phone (as shown in service device 102a), a desktop computer (as shown in service device 102b), a tablet computer (as shown in service device 102c), and a laptop computer (as shown in service device 102n), etc. Figure 1 Only a portion of the devices are listed. The servers mentioned above can be standalone physical servers, server clusters consisting of multiple physical servers, or distributed systems.

[0038] For details, please see Figure 2 , Figure 2 This is a scenario illustration of an engine optimization method provided in an embodiment of this application. Figure 1 Taking a computer device as the executing entity as an example, the computer device can be such as... Figure 1 The shown device or server 101 can be any one of the service devices or servers 101 combined. For example... Figure 2 As shown, computer device 201 can have multiple applications installed, such as Figure 2The computer device 201 shown in the diagram has a corresponding display interface 202, which includes applications A01, A02, and A03. Taking application A01 as an example of the application mentioned in this embodiment, the computer device 201 can respond to a trigger operation by an object (i.e., a user using the computer device 201) on application A01 and display the application page 203 corresponding to application A01 in the display interface 202 of the computer device 201. The application page 203 can display a component 203a for inputting the engine to be replaced (with the prompt message "Please enter the engine to be replaced") and a component 203b for selecting the engine replacement mode (with the prompt message "Please select the engine replacement mode"). The engine replacement mode can include, but is not limited to, a first single engine part optimization mode, a second single engine part optimization mode, and a multi-engine part interchange mode.

[0039] Furthermore, an object using computer device 201 can input the replacement engine identifier of the engine to be replaced via component 203a on the application page 203 of the application. Computer device 201 can respond to the input operation for the replacement engine identifier in the application and identify the engine corresponding to that replacement engine identifier as the engine to be replaced. The number of engines to be replaced can be one or more. Furthermore, an object using computer device 201 can select an engine replacement mode via component 203b on the application page 203 of the application. Computer device 201 can respond to the selection operation on component 203b and identify the selected engine replacement mode as the engine replacement mode for the engine to be replaced.

[0040] Computer device 201 can perform optimization scheme analysis based on the engine to be replaced and the engine replacement mode for the engine to be replaced, and obtain the optimal part replacement scheme. Here, taking the engine to be replaced as engine A, and the engine replacement mode for engine A as the first single engine part optimization mode as an example, computer device 201 can determine the target replacement part from M engine parts in engine A. Here, taking the M engine parts as engine part a (remaining cycle number: 800), engine part b (remaining cycle number: 1000), engine part c (remaining cycle number: 2000), and engine part d (remaining cycle number: 2000) as an example, the minimum remaining cycle number of engine A is the remaining cycle number of engine part a, which is 800. Computer device 201 can determine the engine part with the smallest remaining cycle number as the target replacement part, that is, the target replacement part is engine part a. Computer device 201 can generate K candidate replacement methods 205 based on multiple engines in engine database 204 and the target replacement part (engine part a). It should be noted that a candidate replacement method refers to an optional execution plan generated after selecting the target replacement part and combining multiple engines and the target replacement part in the engine database, which is used to guide the replacement of engine parts. The computer device 201 can select the optimal optional execution plan from K candidate replacement methods 205 according to preset rules, as the optimal candidate replacement method 206.

[0041] It should be noted that one possible preset rule is to sort the minimum remaining cycle number of the engine obtained after replacing engine parts in the K candidate replacement methods, and determine the candidate replacement method ranked first as the optimal candidate replacement method.

[0042] Furthermore, the computer device can display the optimal candidate replacement method 206 in the parts replacement recommendation information 207a on the application page 207. Optionally, the parts replacement recommendation information 207a can also display the top-ranking candidate replacement methods among the K candidate replacement methods 205, determined by sorting according to preset rules.

[0043] Application page 207 can also display a simulation assembly component 207b (with a prompt: Perform simulation assembly?). Users can click the confirmation component 207c within the simulation assembly component 207b. Computer device 201 can respond to the confirmation operation on confirmation component 207c and, based on the first candidate engine part indicated by the optimal candidate replacement method 206 (e.g., engine part x, with 1200 remaining cycles), perform a simulation assembly of engine A to obtain the target optimized engine. As shown on application page 208, computer device 201 can display engine A, and the target optimized engine obtained after replacing engine part a in engine A with engine part x. As shown on display page 208, the target optimized engine includes M engine parts: engine part x (remaining cycles: 1200), engine part b (remaining cycles: 1000), engine part c (remaining cycles: 2000), and engine part d (remaining cycles: 2000). Understandably, the minimum remaining cycle count for the target engine at this point is the remaining cycle count corresponding to engine part b, which is 1000. Compared to the minimum remaining cycle count for engine A (800), this represents an increase of 200 remaining cycle counts, thus achieving the goal of optimizing engine A. Engine part x is of the same type as engine part a, for example, both being low-pressure turbines.

[0044] Through the above process, by selecting different engine replacement modes and analyzing S engines to be replaced, the system automatically generates the optimal part replacement scheme corresponding to either single-engine part optimization or multi-engine part interchange modes. This achieves precise adaptation of engine replacement modes, covering the needs of different operation and maintenance scenarios (part optimization for a single engine, batch part interchange between multiple engines), significantly improving the adaptability and targeting of part replacement in different scenarios, and avoiding the unreasonable solutions caused by indiscriminate and uniform processing in manual decision-making. Simultaneously, it implements an engine part interchange method that does not rely on human experience. Through standardized steps such as data acquisition via application, mode-based planning, database support, and simulated assembly, it achieves intelligent and data-driven part replacement decision-making, thereby improving the efficiency and rationality of part replacement, maximizing engine life and fleet operating efficiency, and reducing operation and maintenance costs.

[0045] Further, please see Figure 3 , Figure 3 This is a flowchart illustrating an engine optimization method provided in an embodiment of this application. Figure 1 This engine optimization method can be executed by computer equipment, which can be, for example, Figure 1The shown service device or server 101 can also be a device composed of any service device and server 101. The engine optimization method may include at least the following steps S301-S303: Step S301: Obtain S engines to be replaced in the application and select the engine replacement mode for the S engines to be replaced; S is a positive integer.

[0046] In this embodiment of the application, the computer device can obtain S engines to be replaced in an application. The S engines to be replaced can be manually input by an object using the computer device, including the engine model corresponding to each of the S engines to be replaced, and the engine parts corresponding to each engine to be replaced, etc.

[0047] Optionally, in response to an input operation in the application specifying a minimum remaining cycle number threshold, the computer device can retrieve the minimum remaining cycle number for each engine from the engine database, and identify S engines in the engine database whose minimum remaining cycle number is less than the minimum remaining cycle number threshold as engines to be replaced. That is, when the user inputs "800" as the minimum remaining cycle number threshold in the application, the computer device can respond to this input operation and identify S engines in the engine database whose minimum remaining cycle number is less than 800 as engines to be replaced.

[0048] Optionally, in response to an input operation in the application specifying a replacement engine model, the computer device can identify S engines in the engine database that match the replacement engine model as the S engines to be replaced. That is, when the user inputs "CFM56-7B" as the replacement engine model in the application, the computer device can identify S engines in the engine database that match the "CFM56-7B" model as the S engines to be replaced.

[0049] Optionally, in response to an input operation in the application for replacing the engine identifier, the computer device can identify S engines in the engine database that are identified as having the engine identifier for replacement. That is, when an applicant inputs "CFM56-7B-20240518-001" as the engine identifier for replacement in the application, the computer device can identify S engines (where S=1) in the engine database that are identified as having the engine identifier "CFM56-7B-20240518-001".

[0050] Optionally, in response to an input operation in the application regarding a maintenance cycle time period, the computer device can identify S engines in the engine database whose maintenance cycles fall within that time period as engines to be replaced. That is, assuming the current time is October, when an object inputs "October-December" as the maintenance cycle time period in the application, it indicates a need to select engines that require maintenance within the next three months. The computer device can then identify S engines in the engine database whose maintenance cycles fall within that time period as engines to be replaced. For example, if an engine in the engine database has a maintenance cycle of November 10th, the computer device can identify that engine as one of the S engines to be replaced.

[0051] Optionally, the computer equipment can also identify S engines to be replaced based on a specific aircraft type or optimization potential. For example, if the specific aircraft type is a narrow-body aircraft, the computer equipment can select all engines operating on that narrow-body aircraft from the engine database as the S engines to be replaced. Alternatively, it can select engines with a large number of candidate engine parts available for exchange (i.e., engines with high optimization potential) as the S engines to be replaced.

[0052] It should be noted that S is a positive integer, meaning that S engines to be replaced can be a single engine or multiple engines to be replaced.

[0053] Furthermore, users of the computer device can select engine replacement modes for the S engines to be replaced within the application. These engine replacement modes include, but are not limited to, a first single-engine part optimization mode, a second single-engine part optimization mode, and a multi-engine part interchange mode. Different engine replacement modes are used to indicate different engine part replacement methods for the S engines to be replaced. For example, the first single-engine part optimization mode indicates a method of replacing one engine part in one of the S engines to be replaced, in order to optimize the lifespan (i.e., minimum remaining cycles) of that engine; the second single-engine part optimization mode indicates a method of replacing one engine part, or a combination of multiple engine parts, in one of the S engines to be replaced, in order to optimize the lifespan of that engine; and the multi-engine part interchange mode indicates a method of interchangeable engine parts among multiple engines to optimize the lifespan of all engines to be replaced.

[0054] When the object selects the first single engine part optimization mode, the computer device can respond to the selection operation for the first single engine part optimization mode and determine the first single engine part optimization mode as the engine replacement mode for S engines to be replaced; when the object selects the second single engine part optimization mode, the computer device can respond to the selection operation for the second single engine part optimization mode and determine the second single engine part optimization mode as the engine replacement mode for S engines to be replaced; when the object selects the multi-engine part interchange mode, the computer device can respond to the selection operation for the multi-engine part interchange mode and determine the multi-engine part interchange mode as the engine replacement mode for S engines to be replaced.

[0055] Step S302: If the engine replacement mode is indicated as the first single engine part optimization mode and S is 1, then the target replacement part is determined from the M engine parts in the engine to be replaced. Based on the multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the best candidate replacement method among the K candidate replacement methods, the engine to be replaced is simulated and assembled to obtain the target optimized engine; K is a positive integer.

[0056] In this embodiment of the application, if the engine replacement mode is indicated as the first single engine part optimization mode, and S is 1, that is, S engines to be replaced are one engine to be replaced (at this time S=1), and the engine replacement mode for the one engine to be replaced is the first single engine part optimization mode, then the computer device can select one engine part from the M engine parts in one engine to be replaced as the target replacement part.

[0057] It should be noted that the M engine parts can include the fan / low-pressure compressor (LPC), high-pressure compressor (HPC), combustor chamber & high-pressure turbine (CC & HPT), and low-pressure turbine (LPT), etc. Each of the M engine parts has a corresponding number of remaining cycles (or life-limited parts cycle remaining, LLP CR). The number of remaining cycles refers to the number of remaining flight cycles that an engine part can safely operate under its current condition; it is a core quantitative indicator for measuring the remaining usable life of that engine part. The overall lifespan of an engine can be determined by the engine part with the fewest remaining cycles (i.e., the minimum number of remaining cycles).

[0058] For example, the remaining cycle counts of engine parts of an engine are 1000, 2000, 3000, and 4000, respectively, with a minimum remaining cycle count of 1000, meaning that the engine needs maintenance after running 1000 cycles.

[0059] Furthermore, the computer equipment can generate K candidate replacement methods based on multiple engines in the engine database and the target replacement part. That is, assuming the target replacement part is a low-pressure turbine (remaining cycle count: 500), the computer equipment can obtain engines with low-pressure turbines from multiple engines in the engine database. Note that the engine model is the same as the model of the engine to be replaced mentioned above. The computer equipment can filter based on the remaining cycle count of the low-pressure turbine in each engine, identifying low-pressure turbines with a remaining cycle count greater than 500 as K candidate engine parts, and then generating K candidate replacement methods based on these K candidate engine parts. Each candidate replacement method corresponds to one candidate engine part. For example, an optional representation of a candidate replacement method could be "Target replacement part: Low-pressure turbine of engine A (remaining cycle count: 500), Candidate engine part: Low-pressure turbine of engine B (remaining cycle count: 1000)". Here, K is a positive integer.

[0060] Furthermore, the computer equipment can determine the optimal candidate replacement method from K candidate replacement methods, and then simulate the assembly of an engine to be replaced based on the first candidate engine part indicated by the optimal candidate replacement method among the K candidate replacement methods, to obtain the target optimized engine.

[0061] The specific implementation method of the computer device determining the optimal candidate replacement method from K candidate replacement methods can be as follows: the computer device can obtain the improvement value of the remaining runnable loops and the target loop improvement amount corresponding to each candidate replacement method, perform weighted summation on the target loop improvement amount and the improvement value of the remaining runnable loops to obtain the optimization score corresponding to each candidate replacement method, and determine the candidate replacement method with the largest optimization score among the K candidate replacement methods as the optimal candidate replacement method.

[0062] Step S303: If the engine replacement mode is indicated as a multi-engine parts interchange mode and S is greater than 1, then the optimal batch parts replacement scheme is generated from the engine parts contained in the S engines to be replaced. Based on the engine parts indicated by the optimal batch parts replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

[0063] In this embodiment, if the engine replacement mode is indicated as a multi-engine parts interchange mode, and S is greater than 1 (meaning S engines to be replaced are multiple engines to be replaced, where S is greater than 1), and the engine replacement mode for these multiple engines to be replaced is a multi-engine parts interchange mode, then the computer device can generate an optimal batch parts replacement scheme from the engine parts contained in each of the S engines to be replaced, perform batch simulation assembly on the S engines to be replaced, and obtain the target optimized engines corresponding to the S engines to be replaced. In other words, the computer device can analyze and combine the engine parts contained in each of the S engines to be replaced to obtain an optimal batch parts replacement scheme. After executing this optimal batch parts replacement scheme, the overall performance of the S engines to be replaced can be improved, resulting in an overall performance improvement in the S target optimized engines compared to the overall performance of the S engines to be replaced.

[0064] Specifically, the computer equipment can generate all possible combinations of interchangeable engine parts based on the engine parts in S engines to be replaced, resulting in P batch part replacement schemes. Each batch part replacement scheme includes the quantity and type of engine parts used after replacing the engine parts in each of the S engines to be replaced. Furthermore, the computer equipment can obtain the total improvement amount corresponding to each batch part replacement scheme, and generate the optimal batch part replacement scheme based on the scheme with the largest total improvement among the P schemes.

[0065] Through the above process, by selecting different engine replacement modes and analyzing S engines to be replaced, the system automatically generates the optimal part replacement scheme corresponding to either single-engine part optimization or multi-engine part interchange modes. This achieves precise adaptation of engine replacement modes, covering the needs of different operation and maintenance scenarios (part optimization for a single engine, batch part interchange between multiple engines), significantly improving the adaptability and targeting of part replacement in different scenarios, and avoiding the unreasonable solutions caused by indiscriminate and uniform processing in manual decision-making. Simultaneously, it implements an engine part interchange method that does not rely on human experience. Through standardized steps such as data acquisition via application, mode-based planning, database support, and simulated assembly, it achieves intelligent and data-driven part replacement decision-making, thereby improving the efficiency and rationality of part replacement, maximizing engine life and fleet operating efficiency, and reducing operation and maintenance costs.

[0066] Further, please see Figure 4 , Figure 4 This is a flowchart illustrating an engine optimization method provided in an embodiment of this application. Figure 2 This engine optimization method can be executed by computer equipment, which can be, for example, Figure 1 The shown service device or server 101 can also be a device composed of any service device and server 101. The engine optimization method may include at least the following steps S401-S404: Step S401: Obtain S engines to be replaced in the application and select the engine replacement mode for the S engines to be replaced; S is a positive integer.

[0067] In this embodiment of the application, the specific implementation of step S401 can be found in [reference needed]. Figure 3 The specific process described in step S301 of the embodiment will not be repeated here.

[0068] Step S402: If the engine replacement mode is indicated as the first single engine part optimization mode and S is 1, then the target replacement part is determined from the M engine parts in the engine to be replaced. Based on the multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the best candidate replacement method among the K candidate replacement methods, the engine to be replaced is simulated and assembled to obtain the target optimized engine; K is a positive integer.

[0069] In this embodiment, if the engine replacement mode is indicated as the first single-engine part optimization mode, and S is 1, meaning S engines to be replaced constitute one engine to be replaced, then the computer device can optimize the engine parts in that one engine to be replaced. Specifically, the computer device can determine the target replacement part from the engine parts to be replaced; it can generate K candidate replacement methods based on multiple engines in the engine database and the target replacement part; and according to the first candidate engine part indicated by the optimal candidate replacement method among the K candidate replacement methods, it can simulate the assembly of one engine to be replaced to obtain the target optimized engine. Here, K is a positive integer.

[0070] In one embodiment, the specific implementation process of a computer device determining a target replacement part from a set of engine parts to be replaced can be as follows: the computer device can obtain the remaining cycle counts corresponding to M engine parts in an engine to be replaced; the engine part with the smallest remaining cycle count among the M engine parts is determined as the target replacement part. Here, the remaining cycle count (LLPCR) of an engine part indicates the remaining usable life of that engine part. The engine part with the smallest remaining cycle count among the M engine parts in the engine to be replaced (i.e., the target replacement part) determines the overall lifespan of the engine to be replaced. By replacing the target replacement part with an engine part with a higher remaining cycle count, the overall lifespan of the engine to be replaced can be increased. An optional implementation instruction for determining the target replacement part can be found in "currentMinLlpCr=min(LLPCR values ​​of M engine parts)", where "currentMinLlpCr" indicates the smallest remaining cycle count among the M engine parts.

[0071] It should be noted that the M engine parts include, but are not limited to, the fan / low-pressure compressor (LPC), the high-pressure compressor (HPC), the combustion chamber and high-pressure turbine (CC&HPT), and the low-pressure turbine (LPT). Among these, HPC and CC&HPT are engine parts subject to CSPR (Cycle Since Part Replacement, i.e., cumulative operating cycles). This means that HPC and CC&HPT have a maximum operating cycle limit after replacement, and their remaining lifespan is determined by the cumulative operating cycle count. In other words, once the cumulative operating cycle count reaches the limit, they can no longer be used. For example, the CSPR limit (operating cycle threshold) for a narrow-body engine is 5,000 cycles. When the cumulative operating cycle count of an HPC part used in that narrow-body engine reaches 5,000, the part can be considered unusable for further repair.

[0072] In one embodiment, the computer device can generate K candidate replacement methods based on multiple engines in an engine database and a target replacement part. Specifically, the computer device can obtain Q candidate engines with the same engine model as the engine to be replaced from the multiple engines in the engine database, where Q is a positive integer. From the Q candidate engines, a first candidate engine part of the same type as the target replacement part can be obtained; the restriction state type of the target replacement part and the remaining cycle number corresponding to each of the Q first candidate engine parts can be obtained; based on the restriction state type of the target replacement part and the remaining cycle number corresponding to each of the Q first candidate engine parts, an initial candidate part set is generated from the Q first candidate engine parts; the date availability of the first candidate engine parts in the initial candidate part set is verified; the first candidate engine parts that pass the date availability verification are combined into a target candidate part set including K first candidate engine parts; and K candidate replacement methods are generated based on the K first candidate engine parts in the target candidate part set.

[0073] It should be noted that when screening engine parts, the computer equipment can only select engine parts from engines with the same model number as the engine to be replaced, and replace the target replacement part in the engine to be replaced. That is, the computer equipment can obtain the engine model number of the engine to be replaced and, based on that model number, select Q candidate engines with the same model number from multiple engines in the engine database. Furthermore, the computer equipment can determine the type of the target replacement part (hereinafter, we will use HPC parts as an example), and can select HPC parts as the first candidate engine parts from the Q candidate engines. The computer equipment can obtain the restriction status type of the target replacement part, and the remaining cycle number corresponding to each of the Q first candidate engine parts. Specifically, if the target replacement part is a fan / low-pressure compressor or a low-pressure turbine, the restriction status type of the target replacement part can be determined to be an unrestricted state type. Optionally, if the target replacement part is a high-pressure compressor (HPC) or a combustion chamber and high-pressure turbine (CC&HPT), the restriction status type of the target replacement part can be determined to be a restricted state type.

[0074] Furthermore, the specific implementation process of the computer device generating an initial candidate part set from the Q first candidate engine parts based on the constraint state type of the target replacement part and the remaining cycle number corresponding to each of the Q first candidate engine parts can be as follows: If the constraint state type of the target replacement part is an unrestricted state type, the computer device can form an initial candidate part set from the Q first candidate engine parts whose remaining cycle number is greater than or equal to the target remaining cycle number. Here, the target remaining cycle number is the remaining cycle number corresponding to the target replacement part. For example, if the target remaining cycle number is 800, and the Q first candidate engine parts include part 1 (remaining cycle number: 500), part 2 (remaining cycle number: 2000), and part 3 (remaining cycle number: 1500), the computer device can form an initial candidate part set from parts 2 and 3. That is, the initial candidate part set includes two first candidate engine parts, namely part 2 and part 3.

[0075] Optionally, if the restriction status type of the target replacement part is a restricted status type, the computer device can obtain a threshold for the number of operable cycles corresponding to the engine to be replaced, and obtain the cumulative number of operable cycles corresponding to Q first candidate engine parts. The first candidate engine parts among the Q first candidate engine parts whose cumulative number of operable cycles is less than the threshold for the number of operable cycles (i.e., operable cycle number threshold filtering) and whose remaining number of cycles is greater than or equal to the target remaining number of cycles can be formed into an initial candidate part set. For example, continuing with the target replacement part being an HPC part (LLP CR: 800), assuming the runnable cycle count threshold is 5000, the Q first candidate engine parts include part 4 (LLP CR: 500, CSPR: 4500), part 5 (LLP CR: 1500, CSPR: 5500), and part 6 (LLP CR: 2000, CSPR: 2000). It can be understood that although part 5 has a remaining cycle count (800) greater than the target remaining cycle count (500), its cumulative runnable cycle count (5500) is greater than the runnable cycle count threshold (500), which does not meet the requirements. The computer equipment can form the initial candidate part set with part 6, whose cumulative runnable cycle count is less than the runnable cycle count threshold and whose remaining cycle count is greater than or equal to the target remaining cycle count. That is, at this time, the initial candidate part set contains only one first candidate engine part (part 6).

[0076] The operable cycle count threshold is used to indicate the upper limit of the cumulative operating cycle count for engine parts of restricted status type (HPC and CC&HPT). That is, when the cumulative operating cycle count of an engine part of restricted status type reaches the operable cycle count threshold, it can be considered that the engine part can no longer be repaired and used.

[0077] Furthermore, the computer equipment can perform date availability verification on the first candidate engine parts in the initial candidate parts set, and form a target candidate parts set including K first candidate engine parts by selecting the first candidate engine parts whose part base date (as_of_date) is less than or equal to the engine base date (engine.as_of_date, the base date of the engine to be replaced) from the initial candidate parts set, and form a target candidate parts set including K first candidate engine parts by selecting the first candidate engine parts.

[0078] It should be noted that the baseline date is used to indicate that the status or data of the engine part / engine is valid on or before this date. Selecting the first candidate engine part that passes the date availability verification is to ensure that the baseline date of the selected first candidate engine part is no later than the baseline date of the corresponding engine to be replaced, thereby avoiding matching an engine part in a "future state" with an engine in a "past state".

[0079] For example, if the base date of the engine to be replaced is May 10th, and the initial candidate parts set contains two first-choice engine parts, candidate part a (base date of May 8th, xx) and candidate part b (base date of May 12th, xx), the computer can organize candidate part a into a target candidate parts set including K first-choice engine parts. That is, if the status of the engine to be replaced on May 10th is "operational data up to May 10th," and the status of candidate part b is updated on May 12th (later than the engine base date), it indicates that the status data of candidate part b on May 10th is unreliable or ineffective. Therefore, candidate part b is excluded, ensuring that the selected first-choice engine parts match the status of the engine to be replaced in the time dimension, avoiding parts replacement errors caused by data misalignment.

[0080] The computer device can generate K candidate replacement methods based on K first candidate engine parts in the target candidate parts set. A candidate replacement method refers to an optional execution plan generated after selecting the target replacement part and combining it with the first candidate engine parts. It is used to indicate the replacement object and the target of the replacement method. For example, one set of K optional candidate replacement methods can be represented as shown in Table 1: Table 1

[0081] As shown in Table 1, a candidate replacement method may include, but is not limited to, information such as the engine to be replaced identifier (used to indicate the engine to be replaced), the target replacement part (i.e. the object to be replaced), the candidate engine identifier (used to indicate the candidate engine), the first candidate engine part (i.e. the replacement target), and the remaining cycle number of the first candidate engine part.

[0082] In one embodiment, the K candidate replacement methods include candidate replacement method A i , where i is a positive integer less than or equal to K. The computer device can then select replacement method A. i And the remaining engine parts in an engine to be replaced, determine candidate replacement method A. iThe minimum remaining cycle count for the corresponding candidate optimized engine. Specifically, the computer equipment can determine the remaining cycle count and candidate replacement method A for each of the remaining engine parts in an engine to be replaced. i The minimum value between the remaining cycle numbers of the first candidate engine parts is determined as candidate replacement method A. i The minimum remaining cycle count for the corresponding candidate optimized engine. For example, an engine to be replaced includes engine part a (remaining cycle count: 800), engine part b (remaining cycle count: 1000), engine part c (remaining cycle count: 2000), and engine part d (remaining cycle count: 2000). Candidate replacement method A... i The remaining cycle number for the first candidate engine part (e.g., referred to as engine part y) is 1500, where engine part a is the target replacement part. It can be understood that candidate replacement method A... i The corresponding candidate engines for optimization include engine part y (remaining cycles: 1500), engine part b (remaining cycles: 1000), engine part c (remaining cycles: 2000), and engine part d (remaining cycles: 2000). The minimum remaining cycle count among the four engine parts is the remaining cycle count of engine part b (which is 1000). Therefore, candidate replacement method A... i The minimum remaining cycle number for the corresponding candidate optimized engine is 1000.

[0083] In this context, "remaining engine parts" refers to the engine parts in an engine that are not targeted for replacement. For example, in the example above, the remaining engine parts include engine part b, engine part c, and engine part d.

[0084] Furthermore, computer equipment can be based on candidate replacement method A i The minimum remaining cycle count for the corresponding candidate optimized engine and the remaining cycle count for the target replacement part are used to generate an improvement in the cycle count for a given engine to be replaced. Specifically, the computer equipment can convert candidate replacement method A... i The difference between the minimum remaining cycle count of the corresponding candidate optimized engine and the remaining cycle count corresponding to the target replacement part is determined as the cycle count improvement amount for a replacement engine. As shown in “minLlpCrImprovement=proposedMinLlpCr-currentMinLlpCr”, where minLlpCrImprovement indicates the cycle count improvement amount for a replacement engine, and proposedMinLlpCr indicates the candidate replacement method A. iThe minimum remaining cycle number for the corresponding candidate optimized engine, currentMinLlpCr, is used to indicate the remaining cycle number corresponding to the target replacement part (i.e., the minimum remaining cycle number corresponding to the engine to be replaced). Continuing with the example above, "minLlpCrImprovement = remaining cycle number of engine part b - remaining cycle number of engine part a, i.e., 1000 - 800 = 200".

[0085] Computer equipment can be replaced according to candidate replacement method A i The computer equipment identifies the first candidate engine part and the target replacement part, and determines the amount of improvement required for each individual part relative to the target replacement part. Specifically, the computer equipment can select candidate replacement method A. i The difference between the remaining cycle number of the indicated first candidate engine part and the remaining cycle number corresponding to the target replacement part is determined as the single part improvement amount for the target replacement part. As shown in “individualImprovement=candidate.llp_cr-currentModule.llp_cr”, where individualImprovement indicates the single part improvement amount for the target replacement part, and candidate.llp_cr indicates candidate replacement method A. i The remaining cycle count of the first candidate engine part indicated, currentModule.llp_cr is used to indicate the remaining cycle count corresponding to the target replacement part. Continuing with the example above, "individualImprovement = remaining cycle count of engine part y - remaining cycle count of engine part a, i.e., 1500 - 800 = 700".

[0086] Furthermore, the computer device can determine the target cycle improvement amount based on the cycle number improvement amount and the individual part improvement amount. Specifically, if the cycle number improvement amount is greater than a first value, then the cycle number improvement amount is determined as the target cycle improvement amount; if the cycle number improvement amount is less than or equal to the first value, then the maximum value between the individual part improvement amount and the first value is determined as the target cycle improvement amount. The first value can be 0. That is, when minLlpCrImprovement > 0, cyclesImprovement = minLlpCrImprovement. Here, cyclesImprovement is used to indicate the target cycle improvement amount. When minLlpCrImprovement ≤ 0, cyclesImprovement = max(0, individualImprovement).

[0087] Furthermore, if candidate replacement method Ai If the restriction state type of the first candidate engine part indicated is the restricted state type, then the computer equipment can use candidate replacement method A. i The candidate replacement method A is determined by the cumulative number of operating cycles of the indicated first candidate engine part and the threshold number of operating cycles corresponding to an engine to be replaced. i The corresponding improved value for the remaining runnable loops. Specifically, the computer device can be replaced using method A. i The difference between the cumulative number of operating cycles of the indicated first candidate engine part and the threshold number of operating cycles is determined as the candidate improvement value; the maximum value between the first value and the candidate improvement value can be determined as candidate replacement method A. i The corresponding improvement value for the remaining runnable loops. As shown in "csprRemaining=max(0,csprLimit-candidate.cslpr)", where csprRemaining indicates the candidate replacement method A. i The corresponding remaining runnable loop count improvement value, csprLimit is used to indicate the runnable loop count threshold, and candidate.cslpr is used to indicate the candidate replacement method A. i The cumulative number of operating cycles for the indicated first candidate engine part.

[0088] It should be noted that when the constraint state type of the target replacement part is the restricted state type, i.e., candidate replacement method A... i The first candidate engine part indicated is in a restricted state type, as shown in Table 1, which lists K candidate replacement methods, including candidate replacement method A. i Candidate replacement method A i It may also include the cumulative number of operating cycles of the first candidate engine part.

[0089] The computer equipment can perform a weighted summation of the target loop improvement and the remaining runnable loop improvement to obtain candidate replacement method A. i The corresponding optimization score. Specifically, the computer equipment can obtain a first weight for the improvement amount of the target loop and a second weight for the improvement value of the remaining runnable loops. The product of the first weight and the improvement amount of the target loop is determined as the weighted target loop improvement amount. The product of the second weight and the improvement value of the remaining runnable loops is determined as the weighted improvement value of the remaining runnable loops. The sum of the weighted target loop improvement amount and the weighted improvement value of the remaining runnable loops is determined as candidate replacement method A. i The corresponding optimization score.

[0090] Optionally, the computer device can standardize the improvement value of the remaining runnable loops to obtain a score for the remaining runnable loops. As shown in “if csprRemaining>0:csprScore=min(csprRemaining / 1000,10);else:csprScore=0”, csprScore is the score for the remaining runnable loops. That is, when the improvement value of the remaining runnable loops (csprRemaining) is greater than the first value (i.e., 0), the minimum value between the ratio of csprRemaining to 1000 and the second value (i.e., 10) is determined as the score for the remaining runnable loops. When the improvement value of the remaining runnable loops (csprRemaining) is less than or equal to the first value (i.e., 0), the first value (i.e., 0) is determined as the score for the remaining runnable loops. Furthermore, the computer device can perform a weighted summation of the target loop improvement amount and the score for the remaining runnable loops to obtain candidate replacement method A. i The corresponding optimization score. The specific implementation of this process can be found in the above-described weighted summation of the target loop improvement and the remaining runnable loop improvement values ​​to obtain candidate replacement method A. i The specific description of the corresponding optimization score will not be repeated here. As shown in "optimizationScore=llpCrImprovement×0.7+csprScore×0.3", optimizationScore is used to indicate the candidate replacement method A. i The corresponding optimization scores are as follows: llpCrImprovement is the target loop improvement amount, and csprScore is the score for the remaining runnable loops. The first weight is 0.7 and the second weight is 0.3.

[0091] Optionally, if candidate replacement method A i If the constraint state type of the indicated first candidate engine part is the unrestricted state type, then the computer equipment can obtain the weighting coefficient for the target cycle improvement amount, and determine the product between the weighting coefficient and the target cycle improvement amount as candidate replacement method A. i The corresponding optimization score. It should be noted that the weighting coefficient for the improvement amount of the target loop can be the first weight mentioned above for the improvement amount of the target loop. As shown in "optimizationScore=llpCrImprovement×0.7+0", this means that when candidate replacement method A... i When the restricted state type of the indicated first candidate engine part is the unrestricted state type, the first candidate engine part is not subject to CSPR restrictions, that is, there is no remaining runnable cycle improvement value and the remaining runnable cycle score, which is 0.

[0092] When the computer device obtains the optimization scores corresponding to the K candidate replacement methods, it can determine the candidate replacement method with the highest optimization score as the optimal candidate replacement method among the K candidate replacement methods.

[0093] Please see also Figure 5 , Figure 5 This is a scenario illustration of an engine optimization method provided in an embodiment of this application. Figure 2 .like Figure 5 As shown, taking engine A as an example, the M engine parts in engine A are the fan / low-pressure compressor (remaining cycles: 1400), high-pressure compressor (remaining cycles: 800), combustion chamber and high-pressure turbine (remaining cycles: 2000), and low-pressure turbine (remaining cycles: 2000). The computer equipment can determine that the high-pressure compressor 501 in engine A is the target replacement part. Furthermore, the computer equipment can obtain Q candidate engines (Q=4 in this case) with the same engine model as engine A from multiple engines in the engine database 502, resulting in... Figure 5 The candidate engine list shown in 503 contains four candidate engines.

[0094] As shown in the candidate engine list 503, there are four candidate engines: Engine 1, Engine 2, Engine 3, and Engine 4. Each candidate engine includes four engine components: a fan / low-pressure compressor, a high-pressure compressor, a combustion chamber and high-pressure turbine, and a low-pressure turbine. It should be noted that the values ​​not individually marked in candidate engine list 503 represent the remaining cycle count for the corresponding engine component. For example, the first unmarked value, 800, represents the remaining cycle count for the fan / low-pressure compressor component in Engine 1. The high-pressure compressor and combustion chamber and high-pressure turbine components are in a restricted state, and their cumulative operating cycle count is limited by the operable cycle count threshold. For example, the remaining cycle count (LLP CR) and cumulative operating cycle count (CSPR) of the high-pressure compressor in Engine 1 are 2000. The remaining cycle counts or cumulative operating cycle counts for the engine components in the other engines are shown in candidate engine list 503 and will not be detailed here.

[0095] Furthermore, the computer equipment can select from the Q candidate engines a first candidate engine part of the same type as the target replacement part (i.e., high-pressure compressor 501), and obtain the following: Figure 5The candidate engine parts list 504 shows Q first candidate engine parts (Q=4 at this time), including the high-pressure compressors corresponding to the four engines: engine 1, engine 2, engine 3, and engine 4. Let's assume the high-pressure compressor of engine 1 is called high-pressure compressor a, the high-pressure compressor of engine 2 is called high-pressure compressor b, the high-pressure compressor of engine 3 is called high-pressure compressor c, and the high-pressure compressor of engine 4 is called high-pressure compressor d.

[0096] The computer equipment can generate an initial candidate part set from the four first candidate engine parts based on the constraint state type of the high-pressure compressor 501 and the remaining cycle number corresponding to each of the four first candidate engine parts. It can then perform date availability verification on the first candidate engine parts in the initial candidate part set, and form a target candidate part set including K first candidate engine parts from the first candidate engine parts that pass the date availability verification. Assuming that the date availability verification of each first candidate engine part passes, the target candidate part set including K first candidate engine parts can be generated as follows: Figure 5 As shown in the target candidate parts set 505, since the restricted state type of high-pressure compressor 501 is a restricted state type (taking the operable cycle number threshold corresponding to engine A as an example of 5000), high-pressure compressor b has a CSPR (6000) greater than the operable cycle number threshold, so high-pressure compressor b is excluded. High-pressure compressor d has an LLP CR (500) less than the target remaining cycle number (800, the remaining cycle number corresponding to high-pressure compressor 501), so high-pressure compressor d is excluded. At this time, the first candidate engine parts with a CSPR less than the operable cycle number threshold and a remaining cycle number greater than or equal to the target remaining cycle number include only high-pressure compressor a and high-pressure compressor c. That is to say, the target candidate parts set 505 includes two first candidate engine parts, namely the high-pressure compressor of engine 1 and the high-pressure compressor of engine 2.

[0097] Furthermore, the computer device generates K candidate replacement methods based on the two first candidate engine parts in the target candidate part set 505, as shown in the K candidate replacement method list 506. The candidate replacement method list 506 includes two candidate replacement methods, namely candidate replacement method 1 and candidate replacement method 2. Each candidate replacement method includes information such as the engine to be replaced, the target replacement part, the candidate engine, the first candidate engine part, LLP CR, and CSPR.

[0098] At this point, the computer equipment can calculate the minimum remaining cycle number of the candidate optimized engine corresponding to candidate replacement method 1 and the minimum remaining cycle number of the candidate optimized engine corresponding to candidate replacement method 2. Specifically, the minimum remaining cycle number corresponding to candidate replacement method 1 is the remaining cycle number of the fan / low-pressure compressor of engine A (i.e., 1400); the minimum remaining cycle number corresponding to candidate replacement method 2 is also the remaining cycle number of the high-pressure compressor c (i.e., 1200).

[0099] The computer equipment can determine the improvement amount of the corresponding number of cycles by the difference between the minimum remaining number of cycles corresponding to each candidate replacement method and the remaining number of cycles corresponding to the target replacement part. For example, as shown in the data comparison list 507 corresponding to the candidate replacement method list 506, the improvement amount of cycles for candidate replacement method 1 is "1400-800=600", and the improvement amount of cycles for candidate replacement method 2 is "1200-800=400". The computer equipment can also determine the improvement amount of a single part for the target replacement part by the difference between the remaining number of cycles for the first candidate engine part indicated by each candidate replacement method and the remaining number of cycles for the target replacement part. For example, as shown in the data comparison list 507, the improvement amount of a single part for candidate replacement method 1 is "2000-800=1200", and the improvement amount of a single part for candidate replacement method 2 is "1200-800=400".

[0100] At this point, the improvement in the number of cycles for both candidate replacement methods is greater than the first value (i.e., 0). The target improvement in the number of cycles for candidate replacement method 1 is the improvement in the number of cycles corresponding to candidate replacement method 1, which is 600; the target improvement in the number of cycles for candidate replacement method 2 is the improvement in the number of cycles corresponding to candidate replacement method 2, which is 400. The computer equipment can determine the difference between the cumulative number of operating cycles of the first candidate engine part indicated by each candidate replacement method and the threshold of the number of operating cycles corresponding to engine A as the improvement value of the remaining number of operating cycles for the corresponding candidate replacement method. As shown in data comparison list 507, the improvement value of the remaining number of operating cycles for candidate replacement method 1 is "5000-2000=3000", and the improvement value of the remaining number of operating cycles for candidate replacement method 2 is "5000-4000=1000". The score of the remaining number of operating cycles for candidate replacement method 1 is "3000 / 1000=3", and the score of the remaining number of operating cycles for candidate replacement method 2 is "1000 / 1000=1". The optimization score for candidate replacement method 1 is "0.7×600+0.3×3=420.9", and the optimization score for candidate replacement method 2 is "0.7×400+0.3×1=280.3".

[0101] Therefore, the candidate replacement method with the highest optimization score is candidate replacement method 1, and the computer equipment can determine candidate replacement method 1 as the optimal candidate replacement method. In other words, the computer equipment can simulate the assembly of engine A based on the first candidate engine part (i.e., high-pressure compressor a) indicated by candidate replacement method 1, to obtain the target optimized engine. The target optimized engine includes the fan / low-pressure compressor, combustion chamber and high-pressure turbine, low-pressure turbine in engine A, and high-pressure compressor a in engine 1.

[0102] By employing a series of steps—"identifying the target replacement part from M engine parts to be replaced," "generating K candidate replacement methods based on multiple engines and the target replacement part in the engine database," and "selecting the optimal candidate replacement method and performing simulated assembly to obtain the target optimized engine"—this approach avoids the problems of inaccurate judgment of part wear, misselection of unnecessary parts, or omission of critical wear parts caused by manual experience. It ensures that replacement actions focus on parts that truly need optimization, reducing cost waste from ineffective replacements, and maximizing the utilization of healthy parts in the engine to be replaced, thus improving part utilization. The generation of K candidate replacement methods supported by the engine database overcomes the limitations of manual experience. Utilizing the accumulated status data of multiple engines and parts in the database, it provides multiple feasible replacement schemes for a single engine, providing sufficient data support for selecting the optimal solution. The simulated assembly step of the optimal candidate replacement method verifies the feasibility of the scheme before actual replacement, proactively avoiding rework caused by parts incompatibility or substandard engine performance after replacement. This reduces engine downtime, lowers maintenance costs, and ensures that the performance of the target optimized engine after replacement meets expectations, improving the operational reliability and remaining service life of a single engine.

[0103] Step S403: If the engine replacement mode is indicated as the second single engine part optimization mode and S is 1, then based on the M engine parts in an engine to be replaced, N part replacement methods are generated; based on the multiple engines in the engine database and the N part replacement methods, T part replacement combinations are generated; according to the second candidate engine part indicated by the optimal part replacement combination in the T part replacement combinations, a simulated assembly is performed on an engine to be replaced to obtain the target optimized engine.

[0104] In this embodiment, if the engine replacement mode is indicated as the second single-engine part optimization mode, and S is 1, then the computer device can generate N part replacement methods based on M engine parts in an engine to be replaced. The part replacement method indicates the quantity and type of engine parts to be replaced in an engine to be replaced; M and N are both positive integers. Specifically, the computer device can iterate and combine the M engine parts in the engine to be replaced, sequentially generating a first part replacement method including any one engine part, a second part replacement method including any two engine parts, and so on, until a third part replacement method including M engine parts is generated. The N part replacement methods include the first, second, and third replacement methods; the number of first replacement methods is M, and each of the M first replacement methods includes one engine part.

[0105] For example, M engine parts can be categorized into four parts: part a, part b, part c, and part d. These four parts are of different types. A computer can iterate through and combine these four engine parts to generate four first-part replacement methods, each including any one of the engine parts: (part a, 1), (part b, 1), (part c, 1), and (part d, 1). Here, (part a, 1) indicates that the first-part replacement method requires only one engine part to be replaced in the engine to be replaced, and the part is of the type corresponding to part a. The computer can also generate six second-part replacement methods, each including any two engine parts: (part a, part b, 2), (part a, part c, 2), (part a, part d, 2), (part b, part c, 2), (part b, d, 2). Wherein, (part a, part b, 2) indicates that the replacement method of the second part is that the number of engine parts to be replaced in the engine to be replaced is 2, and the types are the type corresponding to part a and the type corresponding to part b, respectively.

[0106] Similarly, the computer can generate four fourth-part replacement methods, including any three engine parts: (part a, part b, part c, 3), (part a, part b, part d, 3), (part a, part c, part d, 3), and (part b, part c, part d, 3). It can also generate one third-part replacement method, including four engine parts: (part a, part b, part c, part d, 4). In other words, there are a total of 15 replacement methods (N in total), including four first-part replacement methods, six second-part replacement methods, four fourth-part replacement methods, and one third-part replacement method.

[0107] Optionally, the specific implementation process of the computer device generating N replacement methods based on M engine parts in an engine to be replaced can also be as follows: The computer device can obtain the remaining cycle number corresponding to each of the M engine parts in the engine to be replaced, and determine the engine part with the smallest remaining cycle number among the M engine parts as the priority replacement part. Then, the computer device can generate N replacement methods based on the priority replacement part, or the priority replacement part and a third other engine part. Each replacement method includes the priority replacement part. Continuing with the above example of M engine parts (M=4 in this case), if part a is the priority replacement part, then the N replacement methods are 8 replacement methods, namely (part a, 1), (part a, part b, 2), (part a, part c, 2), (part a, part d, 2), (part a, part b, part c, 3), (part a, part b, part d, 3), (part a, part c, part d, 3), (part a, part b, part c, part d, 4).

[0108] Furthermore, the computer equipment can generate T part replacement combinations based on multiple engines and N part replacement methods from the engine database. Each part replacement combination contains M engine parts. Specifically, the N part replacement methods include part replacement method A. i Let i be a positive integer less than or equal to N. The computer can retrieve Q candidate engines with the same engine model as the engine to be replaced from multiple engines in the engine database. Here, Q is a positive integer. If the parts replacement method A... i The number of parts to be replaced is 1, which means part replacement method A. iIf the replacement method falls under the first part replacement method, the computer device can obtain second candidate engine parts of the same type as the part to be replaced from Q candidate engines. Based on the constraint state type of the part to be replaced and the remaining cycle number corresponding to the Q second candidate engine parts, a set of candidate parts including at least one second candidate engine part is generated. The specific implementation steps of this process can be found in step S402 above, which describes the process of determining the target candidate part set comprising K first candidate engine parts; it will not be repeated here. It is understood that here, part replacement method A... i The part to be replaced in the process corresponds to the target part to be replaced in step S402.

[0109] Furthermore, the computer device can generate a part replacement combination for each second candidate engine part in the set of candidate parts, as well as a first other engine part. This involves combining one second candidate engine part from the set of candidate parts with a first other engine part to obtain a part replacement combination. Here, the first other engine part refers to all engine parts in an engine to be replaced, excluding the part to be replaced. For example, using part replacement method A... i Taking (part a, 1) as an example, where the part to be replaced is part a (assuming the type corresponds to fan / low-pressure compressor), then the first other engine parts include parts b, c, and d. It can be understood that each second candidate engine part in the set of candidate parts is a fan / low-pressure compressor type part selected from the engine parts of Q candidate engines. Taking part z as an example of a second candidate engine part in the set of candidate parts, the part replacement combination for this second candidate engine part can be represented as (part z, part b, part c, part d), used to indicate the part replacement process of replacing part a in the engine to be replaced [which can be represented as (part a, b, c, d)] with part z.

[0110] Optionally, if part replacement method A i If the number of parts to be replaced is not 1, then the computer equipment can use part replacement method A. i Multiple replacement parts are grouped into a single part group. From Q candidate engines, candidate part groups of the same type as the original part group are selected. Part replacement method A is used. iTaking (parts a, b, 2) as an example, the current part group is (parts a, b). The Q candidate part groups obtained by the computer device can be represented as "(parts 7, 8), (parts 9, 10), (parts 11, 12)...". Assuming part a corresponds to a fan / low-pressure compressor and part b corresponds to a high-pressure compressor, then in the above example, parts 7, 9, and 11 are fans / low-pressure compressors from different candidate engines, and parts 8, 10, and 12 are high-pressure compressors from different candidate engines. It should be noted that the second candidate engine part in a candidate part group comes from the same candidate engine. That is, parts 7 and 8 belong to the same candidate engine.

[0111] The computer device can generate a list of candidate parts groups, including at least one candidate parts group, based on the restriction state type of the second candidate engine parts in the candidate parts group and the remaining cycle number of the second candidate engine parts in the Q candidate parts groups. The specific implementation of this process can also refer to the detailed description process in step S402 above, which determines the target candidate parts set comprising K first candidate engine parts, provided that each second candidate engine part in each candidate parts group in the candidate parts group list meets the screening criteria. Here, each second candidate engine part meeting the screening criteria means that when the restriction state type of the second candidate engine part is a restricted state type, the cumulative running cycle number corresponding to the second candidate engine part is less than the runnable cycle number threshold. Furthermore, the computer device can generate a parts replacement combination for each candidate parts group based on each candidate parts group in the candidate parts group list and the second other engine parts. That is, it combines one candidate parts group and the second other engine parts to form a parts replacement combination for that candidate parts group.

[0112] Among them, the second category of other engine parts refers to engine parts in an engine to be replaced, excluding the multiple parts to be replaced. Continuing with part replacement method A... i Taking (parts a, b, 2) as an example, the second other engine parts include parts c and d. If a candidate part group in the list of candidate part groups is (parts 7, 8), then the part replacement combination for that candidate part group can be represented as (parts 7, 8, c, d), which indicates the part replacement process of replacing parts a and b in the engine to be replaced [which can be represented as (parts a, b, c, d)] with parts 7 and 8.

[0113] Furthermore, when T part replacement combinations are generated from N part replacement methods, the computer equipment can determine the minimum cycle optimization amount and the part improvement amount corresponding to each part replacement combination based on the remaining cycle number of engine parts in the T part replacement combinations and the remaining cycle number of M engine parts in the engine to be replaced. Specifically, the computer equipment can determine the minimum remaining cycle number among the remaining cycle numbers of engine parts in each part replacement combination as the first minimum remaining cycle number corresponding to that part replacement combination; the computer equipment can determine the minimum remaining cycle number among the remaining cycle numbers of the M engine parts in the engine to be replaced as the second minimum remaining cycle number corresponding to the engine to be replaced. The computer equipment can determine the difference between the first minimum remaining cycle number and the second minimum remaining cycle number as the minimum cycle optimization amount of the corresponding part replacement combination. An optional method for determining the minimum cycle optimization amount can be found in “minLlpCrImprovement=proposedMinLlpCr-currentMinLlpCr”, where minLlpCrImprovement is the minimum cycle optimization amount for a part replacement combination, proposedMinLlpCr is the first minimum remaining cycle number corresponding to the part replacement combination, and currentMinLlpCr is the second minimum remaining cycle number corresponding to the engine to be replaced.

[0114] Optionally, before obtaining T part replacement combinations, assuming the number of part replacement combinations generated by the N part replacement methods is P, the computer can obtain the minimum cycle optimization amount corresponding to each of the P part replacement combinations. The part replacement combinations with a minimum cycle optimization amount greater than a first value (i.e., 0) are then grouped into T part replacement combinations. In other words, the computer can perform a preliminary screening of the P part replacement combinations, retaining only those that can improve the minimum remaining cycle number (i.e., the minimum cycle optimization amount is greater than 0). Here, T is a positive integer, and P is a positive integer greater than or equal to T.

[0115] Taking a parts replacement combination as an example, the computer equipment can determine the total improvement amount corresponding to the parts replacement combination as the sum of the individual part improvement amounts corresponding to each engine part in the parts replacement combination. The individual part improvement amount corresponding to an engine part is determined by the difference between the remaining cycle number of the engine part and the remaining cycle number of the part to be replaced; the part to be replaced is the engine part in the engine to be replaced. For example, if a parts replacement combination indicates that parts a and b in the engine to be replaced are replaced with parts 7 and 8, then the individual part improvement amount corresponding to part 7 is the remaining cycle number of part 7 minus the remaining cycle number of part a; the individual part improvement amount corresponding to part 8 is the remaining cycle number of part 8 minus the remaining cycle number of part b. The total improvement amount corresponding to the parts replacement combination is the sum of the individual part improvement amounts of part 7 and part 8.

[0116] Furthermore, the computer device can acquire predefined sorting rules, and based on these rules, the minimum loop optimization amount and part improvement amount corresponding to each part replacement combination, and the number of second candidate engine parts indicated in each part replacement combination, sort the T part replacement combinations to obtain the sorted T part replacement combinations. The predefined sorting rules are used to indicate the specific rules for sorting the T part replacement combinations.

[0117] For example, predefined sorting rules may include, but are not limited to, a first priority sorting in descending order based on the minimum cycle optimization amount corresponding to each part replacement combination, a second priority sorting in descending order based on the target cycle improvement amount corresponding to each part replacement combination, a third priority sorting in ascending order based on the number of replaced parts (i.e., second candidate engine parts) in each part replacement combination, and a fourth priority sorting in descending order based on the part improvement amount corresponding to each part replacement combination. The target cycle improvement amount corresponding to each part replacement combination can be determined based on the minimum cycle optimization amount and the part improvement amount corresponding to each part replacement combination. For example, if the minimum cycle optimization amount corresponding to a part replacement combination is greater than a first value (i.e., 0), then the target cycle improvement amount for that part replacement combination is the minimum cycle optimization amount; if the minimum cycle optimization amount corresponding to a part replacement combination is less than or equal to the first value (i.e., 0), then the target cycle improvement amount for that part replacement combination is the maximum value between the part improvement amount and the first value.

[0118] For example, see Figure 6 , Figure 6 This is a schematic diagram of a sorting process scenario provided in an embodiment of this application, such as... Figure 6As shown, the combination of replacing T parts is... Figure 6 Taking the five part replacement combinations in combination list 601 as an example, these include part replacement combination 1, part replacement combination 2, part replacement combination 3, part replacement combination 4, and part replacement combination 5. Each part replacement combination only includes information such as minimum cycle optimization amount, target cycle improvement amount, number of replaced parts, and part improvement amount. The specific values ​​can be found in the corresponding values ​​in combination list 601.

[0119] The computer equipment can first sort the five part replacement combinations in descending order according to the first priority of the predefined sorting rules, that is, according to the minimum cycle optimization amount corresponding to each part replacement combination. It can be understood that since the minimum cycle optimization amount of part replacement combination 4 and part replacement combination 5 is the largest, both being 3000, part replacement combination 4 and part replacement combination 5 should be ranked first. The order between part replacement combination 4 and part replacement combination 5 is determined by the second priority of the predefined sorting rules. However, since the target cycle improvement amount of part replacement combination 4 and part replacement combination 5 is the same, the order between part replacement combination 4 and part replacement combination 5 is further determined by the third priority of the predefined sorting rules, that is, according to the number of replaced parts in each part replacement combination in ascending order. At this time, the number of replaced parts in part replacement combination 4 is 1, and the number of replaced parts in part replacement combination 5 is 3. Therefore, part replacement combination 4 is ranked before part replacement combination 5.

[0120] Following this pattern, the computer equipment continues to sort the remaining 3 parts replacement combinations according to predefined sorting rules, ultimately obtaining T sorted parts replacement combinations, such as... Figure 6 The five part replacement combinations in combination list 602 are shown below. At this point, the sorted order of the five part replacement combinations is: Part Replacement Combination 4, Part Replacement Combination 5, Part Replacement Combination 2, Part Replacement Combination 3, Part Replacement Combination 1.

[0121] Furthermore, the computer equipment can determine the optimal part replacement combination among the T sorted part replacement combinations as the first-ranked part replacement combination among the T part replacement combinations. For example... Figure 6 The five part replacement combinations in the combination list 602 are shown. At this point, the first part replacement combination is part replacement combination 4. That is to say, the optimal part replacement combination is part replacement combination 4.

[0122] The computer equipment can simulate the assembly of an engine to be replaced based on the second candidate engine part indicated by the optimal part replacement combination among T part replacement combinations, and obtain the target optimized engine.

[0123] In one embodiment, the computer device can also generate a parts replacement combination analysis result based on T parts replacement combinations. This analysis result includes, but is not limited to, the first v (e.g., v=20) parts replacement combinations out of the T combinations, and detailed information about those first v combinations. The detailed information for each parts replacement combination includes, but is not limited to: information about the engine to be replaced, information about the candidate engines corresponding to that parts replacement combination, the number of parts for the second candidate engine corresponding to that parts replacement combination, various improvement indicators, CSPR remaining value, and whether the date availability verification has passed. The various improvement indicators may include, but are not limited to, the minimum cycle optimization amount, the target cycle improvement amount, and the part improvement amount corresponding to that parts replacement combination.

[0124] One method for determining the remaining CSPR value corresponding to a part replacement combination is as follows: The computer equipment can obtain the cumulative number of running cycles corresponding to the engine parts with the restricted state type in the part replacement combination, and determine the remaining number of running cycles corresponding to each engine part with the restricted state type by the difference between the threshold of the number of running cycles corresponding to the engine to be replaced and each cumulative number of running cycles. The minimum value among each remaining number of running cycles is determined as the remaining CSPR value corresponding to the part replacement combination.

[0125] This step allows for flexible replacement of single or multiple parts in a single engine. By generating N replacement methods to clarify replacement requirements (which can cover combinations of multiple parts), and combining the engine database to generate T replacement combinations to broaden options, the feasibility of the solution is verified through simulated assembly. Compared to single-part replacement, simultaneous replacement of multiple parts can solve the problem of multiple worn parts in an engine at once, significantly improving the performance recovery efficiency of a single engine, reducing downtime and maintenance costs caused by multiple replacements, and making more rational use of parts resources to maximize the remaining value of parts.

[0126] Step S404: If the engine replacement mode is indicated as a multi-engine parts interchange mode and S is greater than 1, then the optimal batch parts replacement scheme is generated from the engine parts contained in the S engines to be replaced. Based on the engine parts indicated by the optimal batch parts replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

[0127] In this embodiment, if the engine replacement mode is indicated as a multi-engine parts interchange mode, and S is greater than 1, the computer device can generate a list of parts exchange methods corresponding to each of the S engines to be replaced; it can generate P batch parts replacement schemes based on the S engines to be replaced and the list of parts exchange methods corresponding to each of the S engines; then it can obtain the total improvement amount corresponding to each batch parts replacement scheme, and generate the optimal batch parts replacement scheme based on the batch parts replacement scheme with the largest total improvement amount among the P batch parts replacement schemes. A batch parts replacement scheme includes the quantity and type of engine parts used after replacing engine parts in each of the S engines to be replaced.

[0128] Specifically, the process by which the computer device generates a list of parts exchange methods for each of the S engines to be replaced can be as follows: The computer device can group the S engines to be replaced according to their respective model numbers, resulting in D sets of engines. Each set of engines includes at least two engines to be replaced; D is a positive integer less than S. For example, if the S engines to be replaced include three models, X-01, X-02, and X-03, the computer device can group all engines of model X-01 into one set; all engines of model X-02 into another set; and all engines of model X-03 into yet another set.

[0129] Among them, the engine set in group D includes engine set B. j , where j is a positive integer less than or equal to D. Furthermore, the computer device can be a set of engines B. j For each engine part in each engine to be replaced, a candidate part list is generated. Each candidate part list indicates the available parts corresponding to a given engine part. Specifically, taking engine set B... j Taking one engine to be replaced as an example, the computer equipment can generate a candidate list of individual parts for each engine part in the target engine to be replaced. That is, for each engine part, in the engine set B... j Among the other engines to be replaced, look for corresponding engine parts that can be used for exchange.

[0130] For example, suppose the set of engines is B. j This includes H engines to be replaced. The data for these H engines (taking H=5 as an example) is shown in Table 2: Table 2

[0131] As shown in Table 2, the H engines to be replaced include E1, E2, E3, E4 and E5. Each engine to be replaced includes four engine parts: fan / LPC, HPC, CC&HPT and LPT. The remaining cycle number for each engine part and the minimum remaining cycle number (R_min) for the engine to be replaced are shown in Table 2.

[0132] Taking E1 as the target engine to be replaced as an example, the single-part candidate list corresponding to the fan / LPC part in E1 includes H-1 types (i.e., 4 types) of single-part candidate methods, which can be represented as [Fan / LPC of E2, Fan / LPC of E3, Fan / LPC of E4, Fan / LPC of E5]. Each of the H-1 single-part candidate methods corresponding to an engine part corresponds to one of the H-1 engines to be replaced. The H-1 engines to be replaced are the engines other than the target engine among the aforementioned H engines to be replaced.

[0133] The computer equipment can generate a list of multiple candidate parts for each engine part group in the target engine to be replaced. Here, an engine part group is a combination of any number of engine parts from the M engine parts of the target engine to be replaced. Continuing with Table 2 as an example, the engine part groups for E1 can include 11 engine part groups: (Fan / LPC, HPC), (Fan / LPC, CC&HPT), (Fan / LPC, LPT), (HPC, CC&HPT), (HPC, LPT), (CC&HPT, LPT), (Fan / LPC, HPC, CC&HPT), ..., (Fan / LPC, HPC, CC&HPT, LPT).

[0134] Optionally, if a short-board component priority rule (such as focusOnLimiterModules) is enabled, the computer device can generate a multi-component candidate list based on the short-board component in the target engine to be replaced. The short-board component is the engine component with the lowest remaining cycle count in the engine to be replaced. In this case, the short-board component for E1 is CC&HPT, and the engine component groups for E1 can include seven engine component groups: (Fan / LPC, CC&HPT), (HPC, CC&HPT), (CC&HPT, LPT), (Fan / LPC, HPC, CC&HPT), (HPC, CC&HPT, LPT), (Fan / LPC, CC&HPT, LPT), and (Fan / LPC, HPC, CC&HPT, LPT). It should be noted that each engine component group includes the short-board component in the target engine to be replaced.

[0135] Taking engine part group E1 (fan / LPC, HPC) as an example, the multi-part candidate list corresponding to this engine part group includes H-1 types (i.e., 4 types) of multi-part candidate methods, namely [(fan / LPC, HPC) in E2, (fan / LPC, HPC) in E3, (fan / LPC, HPC) in E4, and (fan / LPC, HPC) in E5]. Each multi-part candidate method corresponds to one of the engine part groups for one of the H-1 engines to be replaced. It should be noted that the engine parts in a single multi-part candidate method originate from the same engine to be replaced.

[0136] The computer equipment can generate a candidate parts list for the target engine to be replaced based on the single-part candidate list and the multi-part candidate list corresponding to the target engine to be replaced. Specifically, the computer equipment can obtain the improvement amount of the minimum remaining cycle count for each single-part candidate method in the single-part candidate list corresponding to the target engine to be replaced, and obtain the improvement amount of a single part for each single-part candidate method. Single-part candidate methods with an improvement amount of the minimum remaining cycle count greater than 0, or a single-part improvement amount greater than 0, are combined into an updated single-part candidate list. Similarly, the computer equipment can obtain the improvement amount of the minimum remaining cycle count for each multi-part candidate method in the multi-part candidate list corresponding to the target engine to be replaced, and obtain the improvement amount of a part for each multi-part candidate method. Multi-part candidate methods with an improvement amount of the minimum remaining cycle count greater than 0, or a part improvement amount greater than 0, are combined into an updated multi-part candidate list. Finally, the updated single-part candidate list and the updated multi-part candidate list can be combined to form the candidate parts list for the target engine to be replaced.

[0137] Optionally, when the number of candidate part types (including single-part and multi-part candidate types) in the candidate part list of the target engine to be replaced exceeds a threshold (e.g., 50), the computer device can sort all candidate part types in descending order based on the improvement amount of the minimum remaining cycle number corresponding to each candidate part type, and form a new candidate part list from the top 50 candidate part types. The candidate part list indicates one or more candidate part types corresponding to the engine parts of the engine to be replaced, and the candidate part types include single-part and multi-part candidate types.

[0138] When engine set B is obtained j When given a list of candidate parts for each engine to be replaced in the engine set B, the computer equipment can then use the engine set B as a reference. j The corresponding candidate part list is filtered to obtain engine set B. j The list contains a part exchange method list for each engine to be replaced. The filtering process may include performing runnable cycle count threshold filtering and date availability verification. The specific implementation process of the filtering process can be found in the descriptions of runnable cycle count threshold filtering and date availability verification above, and will not be repeated here. A part exchange method in the part exchange method list indicates the engine parts of the receiving engine and the engine parts of the donor engine corresponding to that part exchange method. For example, an optional part exchange method can be represented as "parts a1 and b1 of engine A (receiving engine) exchanged for parts a2 and b2 of engine B (donor engine)". In this part exchange method, the preceding engine (i.e., engine A) is the receiving engine, and the following engine (i.e., engine B) is the donor engine. That is, the part exchange method is: using parts a2 and b2 of engine B (donor engine) to exchange for parts a1 and b1 of engine A (receiving engine).

[0139] In one embodiment, the specific implementation process of a computer device generating P batch parts replacement schemes based on S engines to be replaced and a list of parts exchange methods corresponding to each of the S engines to be replaced can be as follows: the computer device can generate P batch parts replacement schemes based on the engine set B. jFor each engine to be replaced, a global conflict matrix is ​​created based on the list of parts exchange methods. This global conflict matrix indicates the mutual exclusion between at least two parts exchange methods. Specifically, the engine parts involved in each parts exchange method in the list of parts exchange methods for each engine to be replaced are identified, resulting in consumed parts (swapModuleIds) and released parts (swapAvailableModuleIds) for each exchange method. Taking the aforementioned H engines to be replaced as an example, consumed parts refer to the engine parts indicated by the parts exchange method, used to replace the target engine to be replaced (i.e., the receiving engine) corresponding to that parts exchange method, and originating from the H-1 engines to be replaced (i.e., the donor engines) corresponding to that parts exchange method. Released parts refer to the engine parts released from the target engine to be replaced corresponding to that parts exchange method after the parts exchange method is applied, i.e., the engine parts released from the receiving engine. Continuing with the example above, "exchanging parts a1 and b1 of engine A (receiving engine) for parts a2 and b2 of engine B (donating engine)," the parts consumed in this parts exchange method are parts a2 and b2, and the parts released are parts a1 and b1.

[0140] For example, if a component exchange mode is indicated as "CC&HPT_E1 for CC&HPT_E2", then the consumable component corresponding to this component exchange mode can be represented as [CC&HPT_E2], and the release component corresponding to this single component exchange mode can be represented as [CC&HPT_E1]. If a component exchange mode is indicated as "{fan / LPC_E1,HPC_E1} for {fan / LPC_E4,HPC_E4}", then the consumable component corresponding to this component exchange mode can be represented as [fan / LPC_E4,HPC_E4], and the release component corresponding to this component exchange mode can be represented as [fan / LPC_E1,HPC_E1].

[0141] Computer equipment can construct a global conflict matrix based on the mutual exclusion relationship between the consuming parts corresponding to each part exchange method. For example, if the consuming parts of two part exchange methods indicate the same engine part or the same group of engine parts, but since an engine part can only be used for one exchange at a time and cannot be installed on two different engines simultaneously, the computer equipment can determine that these two part exchange methods are mutually exclusive. It should be noted that engine parts can have unique part identifiers; that is, the part identifier of an engine part uniquely indicates that one engine part. When the part identifiers of the consuming parts in two part exchange methods are the same, it can be determined that the consuming parts of the two part exchange methods indicate the same engine part. A portion of an optional global conflict matrix is ​​shown in Table 3: Table 3

[0142] As shown in Table 3, Swap_A, Swap_B, Swap_C, and Swap_D each correspond to the consumed parts of a specific part exchange method. "True" indicates that the two corresponding part exchange methods conflict, meaning they are mutually exclusive. "False" indicates that the two corresponding part exchange methods do not conflict, meaning they are not mutually exclusive. Table 3 shows that the part exchange methods corresponding to Swap_A and Swap_D are mutually exclusive and cannot be performed simultaneously. That is, if Swap_A is selected for execution, Swap_D cannot be executed; conversely, if Swap_D is selected for execution, Swap_A cannot be executed. The part exchange methods corresponding to Swap_A and Swap_B are not mutually exclusive and can be performed simultaneously.

[0143] Furthermore, the computer device can obtain predefined filtering rules, and based on these predefined filtering rules and the engine set B... j For each engine to be replaced, a list of parts exchange methods is generated to create an initial batch parts replacement plan. An optional predefined filtering rule could be: based on each parts exchange method for engine set B. j The improvement amount of the overall minimum remaining cycle number is used to sort all part exchange methods, resulting in a sorted list. Based on the sorted list, starting with the top-ranked part exchange method, it is sequentially checked whether the current part exchange method has a part consumption conflict with other part exchange methods already selected in the initial scheme. If there is no part consumption conflict, the current part exchange method is selected into the initial scheme, resulting in the initial batch part replacement scheme. It should be noted that if the current part exchange method is the first part exchange method in the sorted list, the initial scheme is empty.

[0144] The computer equipment can obtain a set of batch part replacement sub-schemes from the initial batch part replacement scheme, using a global conflict matrix as constraints. This set of batch part replacement sub-schemes includes one or more batch part replacement sub-schemes. One batch part replacement sub-scheme is used to indicate the replacement of engine set B. j This refers to one possible execution scheme for the part exchange method of each engine to be replaced in the set B. In other words, the initial batch part replacement scheme records the replacement methods for engine set B. j Multiple parts exchange methods for engine parts of each engine to be replaced in the set. A batch parts replacement sub-scheme is to select for engine set B. jThis refers to a set of exchange methods for engine parts of each engine to be replaced. For example, in the initial batch parts replacement plan, there are two exchange methods for engine part a of engine E1: exchanging engine part a of engine E2 for engine part a of engine E1 (referred to as exchange method x1), and exchanging engine part a of engine E4 for engine part a of engine E1 (referred to as exchange method x2). Similarly, in the initial batch parts replacement plan, there are two exchange methods for engine part b of engine E3: exchanging engine part b of engine E5 for engine part b of engine E3 (referred to as exchange method y1), and exchanging engine part b of engine E4 for engine part b of engine E3 (referred to as exchange method y2). A batch parts replacement sub-plan may include exchange method x2 and exchange method y1.

[0145] Once the set of batch parts replacement sub-schemes corresponding to each engine set is obtained, the computer equipment can assemble P batch parts replacement schemes based on the set of batch parts replacement sub-schemes corresponding to each engine set. Each batch parts replacement scheme includes one batch parts replacement sub-scheme corresponding to each engine set.

[0146] In one embodiment, P batch part replacement schemes include batch part replacement scheme C. z Let z be a positive integer less than or equal to P. The computer equipment can obtain the total improvement amount corresponding to each batch of parts replacement scheme. The specific implementation process of generating the optimal batch of parts replacement scheme based on the batch of parts replacement scheme with the largest total improvement amount among P batch of parts replacement schemes can be as follows: The computer equipment can obtain the batch of parts replacement scheme C... z The net improvement corresponding to each part exchange method is determined by the improvement amount of the minimum remaining cycle number of the two engines to be replaced for that part exchange method.

[0147] For example, the data for the three engines to be replaced before the three parts exchange methods are: Engine A: minimum LLP CR = 1000, Engine B: minimum LLP CR = 2000, Engine C: minimum LLP CR = 1500, with a corresponding total initial minimum LLP CR of 4500. If parts exchange method 1 indicates the exchange of Fan / LPC parts between Engine A and Engine B, and the minimum remaining cycle count of Engine A changes from 1000 to 2500, and the minimum remaining cycle count of Engine B changes from 2000 to 1800, then the improvement in the minimum remaining cycle count of Engine A is 1500, and the improvement in the minimum remaining cycle count of Engine B is -200. The net improvement corresponding to this parts exchange method is "1500 + (-200) = 1300". Part exchange method 2 indicates an exchange of HPC parts between engine B and engine C, with engine B's minimum remaining cycles increasing from 1800 to 2200 and engine C's from 1500 to 1600. The improvement in engine A's minimum remaining cycles is 400, and the improvement in engine B's minimum remaining cycles is 100. The net improvement for this part exchange method is "400 + 100 = 500". Part exchange method 3 indicates an exchange of CC & HPT parts between engine C and engine A, with engine C's minimum remaining cycles increasing from 1600 to 1700 and engine A's from 2500 to 2400. The improvement in engine C's minimum remaining cycles is 100, and the improvement in engine A's minimum remaining cycles is -100. The net improvement for this part exchange method is "100 + (-100) = 0".

[0148] The data for the three engines to be replaced after simulating the three parts exchange methods are: "Engine A: minimum LLPCR=2400, Engine B: minimum LLP CR=2200, Engine C: minimum LLP CR=1700", with a corresponding total final minimum LLPCR of 6300.

[0149] Computer equipment can provide batch parts replacement solution C z The sum of the net improvements corresponding to each part exchange method is determined as the first initial total improvement. Continuing with the above three part exchange methods as an example, the first initial total improvement is "1300 + 500 + 0 = 1800". The computer equipment can obtain the batch part replacement plan C. z The associated engine improvement amount for the engine to be replaced. Specifically, computer equipment can handle batch parts replacement plans C. z The difference between the total initial minimum LLP CR and the total final minimum LLP CR corresponding to all part exchange methods in the process is determined as the batch part replacement scheme C. zThe associated engine improvement amount for the engine to be replaced. Continuing with the above three parts exchange methods as examples, the batch parts replacement scheme C... z The associated engine improvement amount for the engine to be replaced is "6300-4500=1800". It should be noted that this is part of the batch parts replacement plan C. z The total initial minimum LLP CR corresponding to all part exchange methods in the data includes only the batch part replacement scheme C. z The minimum LLP CR for the affected engines to be replaced is indicated by the complete parts replacement method. For example, S engines to be replaced are equivalent to 100 engines to be replaced, and the batch parts replacement scheme C... z The entire parts exchange method indicates that only 20 engines to be replaced will participate in the parts exchange process. The computer equipment can determine the minimum LLP CR sum of these 20 engines to be replaced as the batch parts replacement scheme C. z The total initial minimum LLP CR corresponding to all part exchange methods in the system.

[0150] Furthermore, computer equipment can be based on a batch parts replacement scheme C z The net improvement corresponding to each part exchange method, and the batch part replacement scheme C. z The associated engine improvement amount for the engine to be replaced generates a batch parts replacement plan C. z The corresponding total improvement. That is, based on the first initial total improvement and the batch parts replacement plan C. z The associated engine improvement amount for the engine to be replaced generates a batch parts replacement plan C. z The corresponding total improvement. Specifically, if the initial total improvement equals the batch part replacement scheme C... z The associated engine improvement amount for the engine to be replaced will be determined as the first initial total improvement amount for batch parts replacement scheme C. z The corresponding total improvement amount.

[0151] When the total improvement amounts corresponding to P batch part replacement schemes are obtained, the computer equipment can determine the batch part replacement scheme with the largest total improvement amount as the initial optimal batch part replacement scheme. Then, the computer equipment can remove part exchange methods whose net improvement amount is less than or equal to a first value from the initial optimal batch part replacement scheme to obtain the optimal batch part replacement scheme. That is, from the initial optimal batch part replacement scheme, part exchange methods that drag down the overall performance of the S engines to be replaced are eliminated, thereby ensuring optimization of the overall performance of the S engines to be replaced.

[0152] Optionally, the computer equipment can also generate comparative analysis results based on P batch part replacement schemes. These results can be used to illustrate the overall performance optimization information of S target optimized engines obtained after batch simulation assembly of S engines to be replaced according to the engine parts indicated by the optimal batch part replacement scheme, resulting in S target optimized engines for each of the S engines to be replaced. The comparative analysis results may also include, but are not limited to, detailed information on part interchange indicated by the P batch part replacement schemes, and detailed data comparison information between the S engines to be replaced and the batch part replacement scheme after batch simulation assembly. This detailed data comparison information may include the total improvement of the corresponding batch part replacement scheme, the total minimum LLPCR of T engines to be replaced, the LLP CR of the T target optimized engines, the average minimum remaining cycles for each engine (reflecting the average remaining cycles for each engine to be replaced undergoing part interchange), and the improvement in the receiving engine, donor engine, exchanged engine parts, and minimum remaining cycles for each part exchange method in the batch part replacement scheme. The T engines to be replaced are the affected engines among the S engines to be replaced, i.e., the engines to be replaced undergoing part interchange.

[0153] This step enables the interchangeability of parts across multiple engines, achieving batch optimization of engines to meet the operational needs of large-scale fleets and significantly improve operational efficiency. By generating optimal batch parts replacement plans, it achieves comprehensive planning and rational allocation of parts among multiple engines. This fully utilizes the remaining service life of each engine part, optimally allocating parts in good condition among multiple engines to achieve "maximum utilization of resources" and maximize the asset value of each part. Compared to manual, decentralized decision-making, this significantly improves the utilization rate of parts resources and reduces parts procurement and inventory costs. The batch optimization mode can improve the overall performance of multiple engines, avoiding the performance imbalance of the fleet (multiple engines) caused by handling each engine individually in manual decision-making. This helps improve the operational reliability and stability of the entire fleet, reduces various problems caused by individual engine failures, and further ensures aircraft safety by maintaining the overall performance of the entire fleet, thereby enhancing the airline's market competitiveness.

[0154] Through the above process, by selecting different engine replacement modes and analyzing S engines to be replaced, the optimal part replacement scheme corresponding to single-engine part optimization or multi-engine part interchange modes is automatically generated. This achieves flexible adaptation to different operation and maintenance scenarios. For a single engine to be replaced (S=1), the focus can be on the optimization of parts for that single engine, specifically addressing the performance recovery needs of that individual engine. For multiple engines to be replaced (S>1), batch part interchange between multiple engines can be achieved, adapting to centralized operation and maintenance scenarios of large-scale fleets. This significantly improves the adaptability and targeting of part replacement in different scenarios, avoiding the unreasonable solutions caused by indiscriminate and uniform processing in manual decision-making. Simultaneously, relying on the support of the engine database, through scientific part selection, multi-candidate scheme generation, and simulated assembly verification, intelligent and data-driven decision-making for part replacement schemes is achieved. This completely eliminates reliance on human experience, effectively avoiding decision-making errors caused by the subjectivity and bias of manual decision-making, and improving the accuracy and feasibility of the solution. From the perspective of overall operation and maintenance value, this application, by comprehensively planning parts resources, optimizing replacement processes, and verifying the feasibility of the solution in advance, not only maximizes the remaining service life of each part and improves the utilization rate of parts resources, but also significantly shortens the solution formulation and verification cycle. This can improve the efficiency and rationality of parts replacement, maximize engine life and fleet operating efficiency, reduce engine downtime, and lower operation and maintenance costs.

[0155] Further, please see Figure 7 , Figure 7 This is a schematic diagram of an engine optimization device provided in an embodiment of this application. The engine optimization device 700 can be a computer program (including program code, etc.) running on a computer device; for example, the engine optimization device 700 can be application software. The engine optimization device 700 can be used to execute corresponding steps in the method provided in the embodiments of this application. Figure 7 As shown, the engine optimization device 700 can be used for Figure 3 and Figure 4 Specifically, the engine optimization device 700 may include a mode selection module 11, a first optimization module 12, a second optimization module 13, and a third optimization module 14.

[0156] The mode selection module 11 is used to obtain S engines to be replaced in the application and select the engine replacement mode for the S engines to be replaced; S is a positive integer. The first optimization module 12 is used to determine the target replacement part from M engine parts in an engine to be replaced if the engine replacement mode is indicated as the first single engine part optimization mode and S is 1; generate K candidate replacement methods based on multiple engines in the engine database and the target replacement part; and simulate the assembly of an engine to be replaced according to the first candidate engine part indicated by the optimal candidate replacement method among the K candidate replacement methods to obtain the target optimized engine; K is a positive integer. The second optimization module 13 is used to generate the optimal batch part replacement scheme from the engine parts contained in the S engines to be replaced if the engine replacement mode is indicated as a multi-engine part interchange mode and S is greater than 1. Based on the engine parts indicated by the optimal batch part replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

[0157] In one alternative implementation, when the first optimization module 12 determines the target replacement part from M engine parts in an engine to be replaced, the first optimization module 12 is specifically used to perform the following operations: Get the remaining cycle number for each of the M engine parts in an engine to be replaced; The engine part with the minimum number of remaining cycles among the M engine parts is identified as the target replacement part.

[0158] In one optional implementation, when the first optimization module 12 generates K candidate replacement methods based on multiple engines in the engine database and the target replacement parts, the first optimization module 12 is specifically used to perform the following operations: From a database of engines, select Q candidate engines that have the same engine model as the engine to be replaced; Q is a positive integer. From Q candidate engines, obtain the first candidate engine part of the same type as the target replacement part; Obtain the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts. Based on the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts, generate an initial candidate part set from the Q first candidate engine parts. For the first candidate engine part in the initial candidate part set, perform date availability verification, and form a target candidate part set including K first candidate engine parts by the first candidate engine parts that pass the date availability verification. Based on the K first candidate engine parts in the target candidate parts set, generate K candidate replacement methods.

[0159] In one optional implementation, when generating an initial candidate part set from the Q first candidate engine parts based on the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts, the first optimization module 12 is specifically used to perform the following operations: If the restriction state type of the target replacement part is an unrestricted state type, then the first candidate engine parts among the Q first candidate engine parts whose remaining cycle number is greater than or equal to the target remaining cycle number are formed into an initial candidate part set; the target remaining cycle number is the remaining cycle number corresponding to the target replacement part. If the restriction status type of the target replacement part is a restricted status type, then obtain the operable cycle number threshold corresponding to the engine to be replaced, and obtain the cumulative operating cycle number corresponding to Q first candidate engine parts respectively. Among the Q first candidate engine parts, the first candidate engine parts whose cumulative operating cycle number is less than the operable cycle number threshold and whose remaining cycle number is greater than or equal to the target remaining cycle number are formed into an initial candidate part set.

[0160] In one possible implementation, the K candidate replacement methods include candidate replacement method A. i , where i is a positive integer less than or equal to K; the first optimization module 12 is also used to perform the following operations: According to candidate replacement method A i And the remaining engine parts in an engine to be replaced, determine candidate replacement method A. i The minimum remaining cycle number of the corresponding candidate optimized engine; remaining engine parts refer to the engine parts in an engine to be replaced, excluding the target replacement part; Based on candidate replacement method A i The minimum remaining cycle count of the corresponding candidate optimized engine and the remaining cycle count of the target replacement part are used to generate the cycle count improvement for a replacement engine. According to candidate replacement method A i The first candidate engine part and the target replacement part are indicated, and the amount of improvement for each individual part is determined for the target replacement part. The target improvement amount for each cycle is determined based on the improvement amount for the number of cycles and the improvement amount for a single part. If candidate replacement method A i If the restriction state type of the first candidate engine part indicated is the restricted state type, then it will be replaced by candidate replacement method A. i The candidate replacement method A is determined by the cumulative number of operating cycles of the indicated first candidate engine part and the threshold number of operating cycles corresponding to an engine to be replaced. i The corresponding improved value for the remaining number of runnable loops; The target loop improvement and the remaining runnable loop improvement are weighted and summed to obtain candidate replacement method A. i The corresponding optimization score; When the optimization scores corresponding to the K candidate replacement methods are obtained, the candidate replacement method with the highest optimization score is determined as the optimal candidate replacement method among the K candidate replacement methods.

[0161] In one optional implementation, when the first optimization module 12 determines the target cyclic improvement amount based on the improvement amount of the number of cycles and the improvement amount of a single part, the first optimization module 12 is specifically used to perform the following operations: If the improvement in the number of cycles is greater than the first value, then the improvement in the number of cycles is determined as the target improvement in the number of cycles; If the improvement amount of the cycle number is less than or equal to the first value, then the maximum value between the improvement amount of a single part and the first value is determined as the target cycle improvement amount.

[0162] In one alternative implementation, the first optimization module 12 is also used to perform the following operations: If candidate replacement method A i If the constraint state type of the indicated first candidate engine part is an unrestricted state type, then obtain the weighting coefficient for the target cycle improvement amount, and determine the product between the weighting coefficient and the target cycle improvement amount as candidate replacement method A. i The corresponding optimization score.

[0163] In one alternative implementation, the engine optimization device 700 further includes a third optimization module 14, which is specifically used to perform the following operations: If the engine replacement mode is indicated as the second single engine part optimization mode, and S is 1, then based on M engine parts in an engine to be replaced, N part replacement methods are generated; the part replacement method is used to indicate the number and type of engine parts to be replaced in an engine to be replaced; M and N are both positive integers. Based on multiple engines and N parts replacement methods in the engine database, generate T parts replacement combinations; each parts replacement combination contains M engine parts. Based on the second candidate engine part indicated by the optimal part replacement combination among T part replacement combinations, a simulated assembly of an engine to be replaced is performed to obtain the target optimized engine; T is a positive integer.

[0164] In one optional implementation, the N part replacement methods include part replacement method A. i, where i is a positive integer less than or equal to N; the third optimization module 14 is used to generate T parts replacement combinations based on the engines in the engine database and N parts replacement methods. Specifically, the third optimization module 14 is used to perform the following operations: From a database of engines, select Q candidate engines that have the same engine model as the engine to be replaced; Q is a positive integer. If part replacement method A i If the number of parts to be replaced is 1, then from the Q candidate engines, second candidate engine parts of the same type as the part to be replaced are obtained. Based on the restriction state type of the part to be replaced and the remaining cycle number corresponding to the Q second candidate engine parts, a set of candidate parts including at least one second candidate engine part is generated. Based on each second candidate engine part in the set of candidate parts and a first other engine part, a part replacement combination is generated for each second candidate engine part. The first other engine part refers to the engine parts in a engine to be replaced other than the part to be replaced. If part replacement method A i If the number of parts to be replaced is not 1, then part replacement method A will be used. i Multiple replacement parts in the engine are grouped into a single part group. From Q candidate engines, candidate part groups of the same type as the part group are obtained. Based on the restriction state type of the second candidate engine parts in the candidate part group and the remaining cycle number of the second candidate engine parts in the Q candidate part groups, a list of candidate part groups including at least one candidate part group is generated. Based on each candidate part group in the list of candidate part groups and the second other engine parts, a part replacement combination for each candidate part group is generated. The second other engine parts refer to the engine parts in an engine to be replaced, excluding the multiple replacement parts.

[0165] In an alternative implementation, the third optimization module 14 is also used to perform the following operations: Based on the remaining cycle number of engine parts in the T parts replacement combinations and the remaining cycle number of M engine parts in the engine to be replaced, determine the minimum cycle optimization amount corresponding to each parts replacement combination and the part improvement amount corresponding to each parts replacement combination. Obtain predefined sorting rules, sort the T parts replacement combinations according to the predefined sorting rules, the minimum loop optimization amount and part improvement amount corresponding to each part replacement combination, and the number of second candidate engine parts indicated in each part replacement combination, to obtain the sorted T parts replacement combinations. The part replacement combination that ranks first among the T sorted part replacement combinations is determined as the optimal part replacement combination among the T part replacement combinations.

[0166] In one optional implementation, when the second optimization module 13 generates the optimal batch parts replacement plan among the engine parts contained in the S engines to be replaced, the second optimization module 13 is specifically used to perform the following operations: Based on S engines to be replaced, generate a list of parts exchange methods for each of the S engines to be replaced. Based on S engines to be replaced and a list of parts exchange methods for each of the S engines to be replaced, P batch parts replacement schemes are generated; each batch parts replacement scheme includes the quantity and type of engine parts used after replacing the engine parts in each of the S engines to be replaced. Obtain the total improvement amount corresponding to each batch of parts replacement scheme. Based on the batch of parts replacement scheme with the largest total improvement amount among the P batch of parts replacement schemes, generate the optimal batch of parts replacement scheme.

[0167] In one optional implementation, when the second optimization module 13 generates a list of parts exchange methods for each of the S engines to be replaced, the second optimization module 13 is specifically used to perform the following operations: Based on the model numbers of the S engines to be replaced, the S engines are grouped into D sets of engines; each set of engines contains at least two engines to be replaced; D is a positive integer less than S; the D sets of engines include engine set B. j j is a positive integer less than or equal to D; For engine set B j For each engine part in each engine to be replaced, a candidate part list is generated; a candidate part list is used to indicate the available parts corresponding to an engine part. According to engine set B j The corresponding candidate part list is filtered to obtain engine set B. j The list of parts exchange methods for each engine to be replaced; the parts exchange method list is used to indicate one or more parts exchange methods corresponding to the engine parts of the engine to be replaced.

[0168] In one optional implementation, when the second optimization module 13 generates P batch parts replacement schemes based on S engines to be replaced and a list of parts exchange methods corresponding to the S engines to be replaced, the second optimization module 13 is specifically used to perform the following operations: According to engine set B jFor each engine to be replaced, a list of parts exchange methods is generated, and a global conflict matrix is ​​created; the global conflict matrix is ​​used to indicate the mutual exclusion relationship between at least two parts exchange methods. Obtain predefined filtering rules, and based on the predefined filtering rules and engine set B... j The list of parts exchange methods for each engine to be replaced is used to generate an initial batch parts replacement plan; Using the global conflict matrix as a constraint, a set of batch part replacement sub-schemes is obtained from the initial batch part replacement scheme; the set of batch part replacement sub-schemes includes one or more batch part replacement sub-schemes. When the set of batch parts replacement sub-schemes corresponding to each engine set is obtained, P batch parts replacement schemes are formed according to the set of batch parts replacement sub-schemes corresponding to each engine set; a batch parts replacement scheme includes one batch parts replacement sub-scheme corresponding to each engine set.

[0169] In one alternative implementation, the P batch part replacement schemes include batch part replacement scheme C. z z is a positive integer less than or equal to P; the second optimization module 13 is used to obtain the total improvement amount corresponding to each batch part replacement scheme. When generating the optimal batch part replacement scheme based on the batch part replacement scheme with the largest total improvement amount among the P batch part replacement schemes, the second optimization module 13 is specifically used to perform the following operations: Obtain batch parts replacement solution C z The net improvement corresponding to each part exchange method, and the acquisition of batch part replacement scheme C. z The amount of engine improvement associated with the engine to be replaced; Based on batch parts replacement scheme C z The net improvement corresponding to each part exchange method, and the batch part replacement scheme C. z The associated engine improvement amount for the engine to be replaced generates a batch parts replacement plan C. z The corresponding total improvement; When the total improvement amount corresponding to each of the P batch part replacement schemes is obtained, the batch part replacement scheme with the largest total improvement amount among the P batch part replacement schemes is determined as the initial optimal batch part replacement scheme. From the initial optimal batch part replacement scheme, remove the part exchange methods whose net improvement is less than or equal to the first value to obtain the optimal batch part replacement scheme.

[0170] In one alternative implementation, when the mode selection module 11 obtains S engines to be replaced in the application, the mode selection module 11 is specifically used to perform the following operations: In response to an input operation in the application for a minimum remaining cycle number threshold, the minimum remaining cycle number for each engine is obtained from the engine database, and the engines in the engine database whose minimum remaining cycle number is less than the minimum remaining cycle number threshold are identified as S engines to be replaced. Alternatively, in response to an input operation in the application for changing the engine model, identify S engines in the engine database that have the model number of the engine to be replaced. Alternatively, in response to an input operation in the application for changing the engine identifier, identify the engines in the engine database that are identified as engines to be replaced as engines to be replaced as S engines. Alternatively, in response to an input operation in the application regarding a maintenance cycle time period, identify S engines in the engine database whose maintenance cycles fall within the maintenance cycle time period as engines to be replaced.

[0171] Through the above process, by selecting different engine replacement modes and analyzing S engines to be replaced, the optimal part replacement scheme corresponding to single-engine part optimization or multi-engine part interchange modes is automatically generated. This achieves flexible adaptation to different operation and maintenance scenarios. For a single engine to be replaced (S=1), the focus can be on the optimization of parts for that single engine, specifically addressing the performance recovery needs of that individual engine. For multiple engines to be replaced (S>1), batch part interchange between multiple engines can be achieved, adapting to centralized operation and maintenance scenarios of large-scale fleets. This significantly improves the adaptability and targeting of part replacement in different scenarios, avoiding the unreasonable solutions caused by indiscriminate and uniform processing in manual decision-making. Simultaneously, relying on the support of the engine database, through scientific part selection, multi-candidate scheme generation, and simulated assembly verification, intelligent and data-driven decision-making for part replacement schemes is achieved. This completely eliminates reliance on human experience, effectively avoiding decision-making errors caused by the subjectivity and bias of manual decision-making, and improving the accuracy and feasibility of the solution. From the perspective of overall operation and maintenance value, this application, by comprehensively planning parts resources, optimizing replacement processes, and verifying the feasibility of the solution in advance, not only maximizes the remaining service life of each part and improves the utilization rate of parts resources, but also significantly shortens the solution formulation and verification cycle. This can improve the efficiency and rationality of parts replacement, maximize engine life and fleet operating efficiency, reduce engine downtime, and lower operation and maintenance costs.

[0172] Please see Figure 8 , Figure 8 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Figure 8As shown, the computer device 800 in this embodiment may include a processor 801, a network interface 804, and a memory 805. Furthermore, the computer device 800 may also include a user interface 803 and at least one communication bus 802. The communication bus 802 is used to enable communication between these components. The user interface 803 may include a display screen and a keyboard; optionally, the user interface 803 may also include a standard wired interface or a wireless interface. The network interface 804 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 805 may be a high-speed RAM or non-volatile memory, such as at least one disk storage device. Optionally, the memory 805 may also be at least one storage device located remotely from the processor 801. Figure 8 As shown, the memory 805, which is a computer-readable storage medium, may include an operating system, a network communication module, a user interface module, and a device control application.

[0173] Network interface 804 provides network communication elements; user interface 803 is mainly used to provide an input interface for users; and processor 801 can be used to call the device control application stored in memory 805 to perform the following operations: In the application, obtain S engines to be replaced and select the engine replacement mode for the S engines to be replaced; S is a positive integer; If the engine replacement mode is indicated as the first single engine part optimization mode and S is 1, then the target replacement part is determined from the M engine parts in the engine to be replaced. Based on the multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the best candidate replacement method among the K candidate replacement methods, the engine to be replaced is simulated and assembled to obtain the target optimized engine; K is a positive integer. If the engine replacement mode is indicated as a multi-engine parts interchange mode, and S is greater than 1, then an optimal batch parts replacement scheme is generated from the engine parts contained in the S engines to be replaced. Based on the engine parts indicated by the optimal batch parts replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

[0174] Furthermore, it should be noted that embodiments of this application also provide a computer-readable storage medium storing a computer program adapted to be loaded and executed by the processor. Figure 3 or Figure 4For details on the methods provided in each step, please refer to the document. Figure 3 or Figure 4 The implementation methods provided for each step are not repeated here. Furthermore, the beneficial effects of using the same method are also not repeated. For technical details not disclosed in the computer-readable storage medium embodiments involved in this application, please refer to the description of the method embodiments of this application. As an example, a computer program may be deployed to execute on a single computer device, or on multiple computer devices located in one location, or on multiple computer devices distributed across multiple locations and interconnected via a communication network.

[0175] The computer-readable storage medium can be the apparatus provided in any of the foregoing embodiments or the internal storage unit of the computer device, such as the hard disk or memory of the computer device. The computer-readable storage medium can also be an external storage device of the computer device, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., provided on the computer device. Furthermore, the computer-readable storage medium can include both internal storage units and external storage devices of the computer device. The computer-readable storage medium is used to store the computer program and other programs and data required by the computer device. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0176] This application also provides a computer program product, which includes a computer program stored in a computer-readable storage medium. A processor of a computer device reads the computer program from the computer-readable storage medium and executes the computer program, causing the computer device to perform... Figure 3 or Figure 4 The methods provided are among the various optional methods available in the code, so they will not be elaborated upon here.

[0177] The terms "first," "second," etc., in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the term "comprising," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, apparatus, product, or device that includes a series of steps or units is not limited to the listed steps or modules, but may optionally include steps or modules not listed, or may optionally include other step units inherent to these processes, methods, apparatuses, products, or devices.

[0178] In the embodiments of this application, the terms "module" or "unit" refer to a computer program or part of a computer program that has a predetermined function and works with other related parts to achieve a predetermined goal, and can be implemented wholly or partially using software, hardware (such as processing circuitry or memory), or a combination thereof. Similarly, a processor (or multiple processors or memory) can be used to implement one or more modules or units. Furthermore, each module or unit can be part of an overall module or unit that includes the functionality of that module or unit.

[0179] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of each example have been generally described in terms of functionality. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this application.

[0180] The methods and related apparatus provided in this application are described with reference to the method flowcharts and / or structural diagrams provided in this application. Specifically, each block of the method flowcharts and / or structural diagrams, as well as combinations of blocks in the flowcharts and / or block diagrams, can be implemented by a computer program. These computer programs can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable device to create a machine, such that the computer program, executed by the processor of the computer or other programmable device, produces a mechanism for implementing the process... Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The computer program may be a means for performing the functions specified in one or more boxes. These computer programs may also be stored in a computer-readable storage medium that can direct a computer or other programmable device to function in a particular manner, causing the computer program stored in the computer-readable storage medium to produce an article of manufacture including the program means, or to be transmitted via a computer-readable storage medium. The computer program can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The program means is implemented in the process. Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1The functions specified in one or more boxes. These computer programs may also be loaded onto a computer or other programmable device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby providing the computer program executing on the computer or other programmable device with the means to implement the process. Figure 1 A process or multiple processes and / or structures illustrate the steps of the functions specified in one or more boxes.

[0181] The steps in the method of this application embodiment can be adjusted, combined, or deleted according to actual needs.

[0182] The modules in the device of this application embodiment can be merged, divided, and deleted according to actual needs.

[0183] The above-disclosed embodiments are merely preferred embodiments of this application and should not be construed as limiting the scope of this application. Therefore, any equivalent variations made in accordance with the claims of this application shall still fall within the scope of this application.

Claims

1. An engine optimization method, characterized in that, The method includes: The application retrieves S engines to be replaced and selects an engine replacement mode for the S engines to be replaced; S is a positive integer. If the engine replacement mode is indicated as the first single engine part optimization mode, and S is 1, then from the M engine parts in the engine to be replaced, the target replacement part is determined. Based on the multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated. According to the first candidate engine part indicated by the optimal candidate replacement method among the K candidate replacement methods, the engine to be replaced is simulated and assembled to obtain the target optimized engine; K is a positive integer. If the engine replacement mode is indicated as a multi-engine parts interchange mode, and S is greater than 1, then an optimal batch parts replacement scheme is generated from the engine parts contained in the S engines to be replaced. Based on the engine parts indicated by the optimal batch parts replacement scheme, the S engines to be replaced are batch simulated and assembled to obtain the target optimized engines corresponding to the S engines to be replaced.

2. The method according to claim 1, characterized in that, The step of determining the target replacement part from M engine parts in the engine to be replaced includes: Obtain the remaining cycle number for each of the M engine parts in the engine to be replaced; The engine part with the smallest remaining cycle count among the M engine parts is identified as the target replacement part.

3. The method according to claim 1, characterized in that, Based on multiple engines in the engine database and the target replacement part, K ​​candidate replacement methods are generated, including: From a database of engines, select Q candidate engines that have the same engine model as the engine to be replaced; Q is a positive integer. From the Q candidate engines, obtain a first candidate engine part of the same type as the target replacement part; Obtain the restriction state type of the target replacement part and the remaining cycle number corresponding to each of the Q first candidate engine parts. Based on the restriction state type of the target replacement part and the remaining cycle number corresponding to each of the Q first candidate engine parts, generate an initial candidate part set from the Q first candidate engine parts. For the first candidate engine parts in the initial candidate parts set, date availability verification is performed, and the first candidate engine parts that pass the date availability verification are combined into a target candidate parts set including K first candidate engine parts. Based on the K first candidate engine parts in the target candidate parts set, K candidate replacement methods are generated.

4. The method according to claim 3, characterized in that, Based on the constraint state type of the target replacement part and the remaining cycle number corresponding to the Q first candidate engine parts, an initial candidate part set is generated from the Q first candidate engine parts, including: If the restriction state type of the target replacement part is an unrestricted state type, then the first candidate engine parts among the Q first candidate engine parts whose remaining cycle number is greater than or equal to the target remaining cycle number are formed into an initial candidate part set; the target remaining cycle number is the remaining cycle number corresponding to the target replacement part; If the restriction state type of the target replacement part is a restricted state type, then obtain a threshold for the number of operable cycles corresponding to the engine to be replaced, and obtain the cumulative number of operable cycles corresponding to the Q first candidate engine parts respectively. Among the Q first candidate engine parts, the first candidate engine parts whose cumulative number of operable cycles is less than the threshold for the number of operable cycles and whose remaining number of cycles is greater than or equal to the target remaining number of cycles are formed into an initial candidate part set.

5. The method according to claim 1, characterized in that, The K candidate replacement manners include a candidate replacement manner A i i is a positive integer less than or equal to K. The method further includes: According to the candidate replacement mode A i And one of the remaining engine parts in the engine to be replaced, determine the candidate replacement mode A i The minimum remaining cycle number of the corresponding candidate optimized engine; the remaining engine parts refer to the engine parts in the engine to be replaced except the target replacement parts; based on the candidate replacement mode A i a cycle number improvement amount for one of the engines to be replaced is generated based on the minimum remaining cycle number of the corresponding candidate optimized engine and the remaining cycle number corresponding to the target replacement part According to the candidate replacement mode A i The indicated first candidate engine part, and the target replacement part, determine a single part improvement amount for the target replacement part; The target cycle improvement amount is determined based on the improvement amount of the number of cycles and the improvement amount of the single part; if the candidate replacement mode A i if the indicated restriction state type of the first candidate engine part is a restricted state type, then the candidate replacement mode A i if the indicated cumulative operating cycle number of the first candidate engine part, and a threshold value of the operating cycle number corresponding to the engine to be replaced, determine the candidate replacement mode A i the corresponding remaining operating cycle number improvement value; The target cycle improvement quantity and the remaining number of executable cycle improvement values are weighted and summed to obtain the candidate replacement mode A i The corresponding optimization score; When the optimization scores corresponding to the K candidate replacement methods are obtained, the candidate replacement method with the highest optimization score is determined as the optimal candidate replacement method among the K candidate replacement methods.

6. The method according to claim 5, characterized in that, Determining the target cycle improvement amount based on the cycle number improvement amount and the individual part improvement amount includes: If the improvement in the number of cycles is greater than the first value, then the improvement in the number of cycles is determined as the target improvement in the number of cycles; If the improvement amount of the number of cycles is less than or equal to the first value, then the maximum value between the improvement amount of the single part and the first value is determined as the target number of cycle improvements.

7. The method according to claim 5, characterized in that, Also includes: If the candidate replacement mode A i If the indicated limit state type of the first candidate engine part is the unrestricted state type, a weighting coefficient for the target cycle improvement amount is obtained, and a product between the weighting coefficient and the target cycle improvement amount is determined as the candidate replacement mode A i The corresponding optimization score.

8. The method according to claim 1, characterized in that, Also includes: If the engine replacement mode is indicated as the second single engine part optimization mode, and S is 1, then based on M engine parts in one engine to be replaced, N part replacement methods are generated; the part replacement method is used to indicate the number and type of engine parts to be replaced in one engine to be replaced. M and N are both positive integers; Based on multiple engines in the engine database and the N parts replacement methods, T parts replacement combinations are generated; the number of engine parts in each parts replacement combination is M. Based on the second candidate engine part indicated by the optimal part replacement combination among the T part replacement combinations, a simulated assembly of one of the engines to be replaced is performed to obtain the target optimized engine. T is a positive integer.

9. The method according to claim 8, characterized in that, The N number of part replacement modes include a part replacement mode A i i is a positive integer less than or equal to N. The process generates T parts replacement combinations based on the engines in the engine database and the N parts replacement methods, including: From a database of engines, select Q candidate engines that have the same engine model as the engine to be replaced; Q is a positive integer. If the number of the parts to be replaced in the part replacement mode A i is 1, from the Q candidate engines, second candidate engine parts having the same type as the part to be replaced are respectively acquired, a candidate part set including at least one second candidate engine part is generated based on the limit state type of the part to be replaced and the residual cycle numbers respectively corresponding to the Q second candidate engine parts, and a part replacement combination for each second candidate engine part is generated based on each second candidate engine part in the candidate part set and a first other engine part; the first other engine part refers to an engine part in the engine to be replaced except the part to be replaced. If the part replacement method A i If the number of parts to be replaced is not 1, then the part replacement method A will be used. i Multiple replacement parts are grouped into a single part group. From the Q candidate engines, candidate part groups of the same type as the original part group are obtained. Based on the restriction state type of the second candidate engine parts in the candidate part group and the remaining cycle number of the second candidate engine parts in the Q candidate part groups, a list of candidate part groups including at least one candidate part group is generated. Based on each candidate part group in the list of candidate part groups and a second other engine part, a part replacement combination is generated for each candidate part group. The second other engine part refers to an engine part in one of the replacement engines that is not composed of the multiple replacement parts.

10. The method according to claim 8, characterized in that, Also includes: Based on the remaining cycle number of the engine parts in the T parts replacement combinations and the remaining cycle number of the M engine parts in the engine to be replaced, determine the minimum cycle optimization amount corresponding to each parts replacement combination and the part improvement amount corresponding to each parts replacement combination. Obtain a predefined sorting rule, and sort the T parts replacement combinations according to the predefined sorting rule, the minimum loop optimization amount and the part improvement amount corresponding to each part replacement combination, and the number of second candidate engine parts indicated in each part replacement combination, to obtain the sorted T parts replacement combinations. The part replacement combination that ranks first among the T sorted part replacement combinations is determined as the optimal part replacement combination among the T part replacement combinations.

11. The method according to claim 1, characterized in that, The step of generating an optimal batch parts replacement plan from the engine parts contained in the S engines to be replaced includes: Based on the S engines to be replaced, generate a list of parts exchange methods corresponding to the S engines to be replaced; Based on the S engines to be replaced and the list of parts exchange methods corresponding to the S engines to be replaced, P batch parts replacement schemes are generated; each batch parts replacement scheme includes the quantity and type of engine parts used after replacing the engine parts in the S engines to be replaced. Obtain the total improvement amount corresponding to each batch of parts replacement scheme. Based on the batch of parts replacement scheme with the largest total improvement amount among the P batch of parts replacement schemes, generate the optimal batch of parts replacement scheme.

12. The method according to claim 11, characterized in that, The step of generating a list of parts exchange methods for each of the S engines to be replaced includes: Based on the model numbers corresponding to the S engines to be replaced, the S engines to be replaced are grouped into D sets of engines; each set of engines includes at least two engines to be replaced; D is a positive integer less than S; the D sets of engines include engine set B. j j is a positive integer less than or equal to D; For the engine set B j For each engine part in each engine to be replaced, a candidate part list is generated; a candidate part list is used to indicate the available parts corresponding to an engine part. According to the engine set B j The corresponding candidate part list is filtered to obtain the engine set B. j A list of parts exchange methods for each engine to be replaced; the list of parts exchange methods is used to indicate one or more parts exchange methods corresponding to the engine parts of the engine to be replaced.

13. The method according to claim 12, characterized in that, The process of generating P batch parts replacement schemes based on the S engines to be replaced and the parts exchange method list corresponding to the S engines to be replaced includes: According to the engine set B j For each engine to be replaced, a list of parts exchange methods is generated, and a global conflict matrix is ​​created; the global conflict matrix is ​​used to indicate the mutual exclusion relationship between at least two parts exchange methods. Obtain predefined filtering rules, and based on the predefined filtering rules and the engine set B... j The list of parts exchange methods for each engine to be replaced is used to generate an initial batch parts replacement plan; Using the global conflict matrix as a constraint, a set of batch part replacement sub-schemes is obtained from the initial batch part replacement scheme; the set of batch part replacement sub-schemes includes one or more batch part replacement sub-schemes. When the set of batch parts replacement sub-schemes corresponding to each engine set is obtained, P batch parts replacement schemes are formed according to the set of batch parts replacement sub-schemes corresponding to each engine set; a batch parts replacement scheme includes one batch parts replacement sub-scheme corresponding to each engine set.

14. The method according to claim 13, characterized in that, The P batch part replacement schemes include batch part replacement scheme C. z z is a positive integer less than or equal to P; The step of obtaining the total improvement amount corresponding to each batch part replacement scheme, and generating the optimal batch part replacement scheme based on the batch part replacement scheme with the largest total improvement amount among the P batch part replacement schemes, includes: Obtain the batch parts replacement plan C z The net improvement corresponding to each part exchange method, and the acquisition of the batch part replacement scheme C. z The amount of engine improvement associated with the engine to be replaced; Based on the aforementioned batch parts replacement scheme C z The net improvement corresponding to each part exchange method in the above, and the batch part replacement scheme C z The associated engine improvement amount for the engine to be replaced is used to generate the batch parts replacement plan C. z The corresponding total improvement; When the total improvement amount corresponding to the P batch part replacement schemes is obtained, the batch part replacement scheme with the largest total improvement amount among the P batch part replacement schemes is determined as the initial optimal batch part replacement scheme. From the initial optimal batch part replacement scheme, remove the part exchange methods whose net improvement is less than or equal to the first value to obtain the optimal batch part replacement scheme.

15. The method according to claim 1, characterized in that, The step of obtaining S engines to be replaced in the application includes: In response to an input operation in the application for a minimum remaining cycle number threshold, the minimum remaining cycle number corresponding to each engine is obtained from the engine database, and the engines in the engine database whose minimum remaining cycle number is less than the minimum remaining cycle number threshold are identified as S engines to be replaced. Alternatively, in response to an input operation in the application for changing the engine model, the engines in the engine database with the model number of the changed engine are identified as S engines to be replaced. Alternatively, in response to an input operation in the application for changing the engine identifier, the engines in the engine database that are identified as the engine to be replaced are determined as S engines. Alternatively, in response to an input operation in the application regarding a maintenance cycle time period, engines in the engine database whose maintenance cycles fall within the maintenance cycle time period are identified as S engines to be replaced.

16. An engine optimization device, characterized in that, The device includes: The mode selection module is used to obtain S engines to be replaced in the application and select the engine replacement mode for the S engines to be replaced; S is a positive integer. The first optimization module is configured to, if the engine replacement mode is indicated as the first single engine part optimization mode and S is 1, determine the target replacement part from M engine parts in the engine to be replaced, generate K candidate replacement methods based on multiple engines in the engine database and the target replacement part, and simulate the assembly of one of the engines to be replaced according to the first candidate engine part indicated by the optimal candidate replacement method among the K candidate replacement methods to obtain the target optimized engine; K is a positive integer. The second optimization module is used to generate an optimal batch part replacement scheme from the engine parts contained in the S engines to be replaced if the engine replacement mode is indicated as a multi-engine part interchange mode and S is greater than 1. Based on the engine parts indicated by the optimal batch part replacement scheme, the module performs batch simulation assembly on the S engines to be replaced to obtain the target optimized engines corresponding to the S engines to be replaced.

17. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the method of any one of claims 1 to 15.

18. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program adapted to be loaded and executed by a processor to cause a computer device having the processor to perform the method of any one of claims 1 to 15.

19. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 15.

Images