Method for optimizing a large-scale industrial facility, especially a power plant

• US 20040244378A1
• Filed: 03/04/2004
• Published: 12/09/2004
• Est. Priority Date: 09/12/2001
• Status: Active Grant

• Current Assignee: General Electric Technology GmbH (GE Aerospace)
• Original Assignee: Alan Bird
• Inventors: Bird, Alan
• Granted Patent: US 7,165,404 B2
• Time in Patent Office: Days
• US Class Current: 60/670
• CPC Class Codes: F01K 13/02 Controlling, e.g. stopping or starting
• CPC Class Codes: G05B 13/024 in which a parameter or coefficient is automatically adjusted to optimise the performance

Abstract

The invention relates to a method for optimizing a large-scale industrial facility, especially a power plant, consisting of m subassemblies (BGj), wherein j=1(1)m) and wherein the following steps are successively carried out: comparing the parameters (KGj) of all subassemblies (BG1 to BGj) with predetermined reference values (RWj); detecting the subassemblies (Bgi) with i=1(1)m, whose parameters (KG1) are worse than the reference values (RWi) and optimizing the subassemblies (BG1) whose parameters (KGi) are worse than the reference values (RW1).

Claims

1. A method for optimizing a large-scale industrial facility, in particular a power station, comprising m assemblies (BG_j, where j=1(1) . . . m), characterized by the following steps:

comparison of characteristic variables (KG_j) of all the assemblies (BG₁ to BGj) with predetermined reference values (RW_j),

determination of those assemblies (BG_i, where i=1(1) . . . m) whose characteristic variables (KG_i) are poorer than the reference values (RW_i),

optimization of the assemblies (BG_i) whose characteristic variables (KG_i) are poorer than the reference values (RW_i).

2. The method as claimed in claim 1, characterized in that the optimization of an assembly (BG_i) includes the following method steps:

subdivision of the assembly (BG_i) into subassemblies (UBG_p, where p=1(1) . . . n)

comparison of characteristic variables (UKG_p) of all the subassemblies (UBG_i to BG_p) with predetermined reference values (URW_p),

determination of those subassemblies (UBG₁, where 1=1(1) . . . n), whose characteristic variables (UKG₁) are poorer than the reference values (URW₁),

optimization of subassemblies (BG₁) whose characteristic variables (KG_i) are poorer than the reference values (URW₁).

3. The method as claimed in claim 2, characterized in that the subassemblies (UBG_P) are if necessary optimized once or more using the method as claimed in claim 2.

4. The method as claimed in one of the preceding claims,

characterized in that the predetermined reference values (RW_i, URW₁) are of a technical nature.

5. The method as claimed in claim 4, characterized in that the predetermined reference values (RW_i, URW₁) comprise efficiencies, emissions, powers, reliability, maintenance requirement and remaining lives.

6. The method as claimed in one of the preceding claims, characterized in that the predetermined reference values (RW_i, URW₁) are of a financial nature and include, in particular, costs and proceeds.

7. The method as claimed in one of the preceding claims, characterized in that the assemblies (BG_i, where i=1(1) . . . m) whose characteristic variables (KG_i) are poorer than the reference values (RW_i) are investigated and optimized in terms of their technical improvement potentials in the sequence of the discrepancy (RW_i−

KG_i).

8. The method as claimed in one of the preceding claims, characterized in that the assemblies (BG_i, where i=1(1) . . . m) whose characteristic variables (KG_i) are poorer than the reference values (RW_i) are investigated and optimized in terms of their technical improvement potentials in sequence such that the assembly (BG_i, where i=1(1) . . . m) which has the best cost/effectiveness ratio is the first to be optimized.

9. The method as claimed in one of the preceding claims, characterized in that the assemblies (BG_i, where i=1(1) . . . m) whose characteristic variables (KG_i) are poorer than the reference values (RW_i) are investigated and optimized in terms of their technical improvement potentials in sequence such that the assembly (BG_i, where i=1(1) . . . m) which involves the least capital outlay is the first to be optimized.

10. The method as claimed in one of the preceding claims, characterized in that the method is applied to a power station, in particular to a steam power station.

11. The method as claimed in claim 9, characterized in that the power station has at least one boiler (BG₁), at least one steam turbine (BG₂), at least one condenser (BG₃), at least one boiler feed water pump (BG₄), at least one generator (BG₅), and at least one flue gas cleaning device (BG₆).

12. The method as claimed in claim 10 or 11, characterized in that the boiler (BG₁) has at least some of the following subassemblies:

a fuel supply (1), an air supply (2) with a fan, an air preheater (3), a high-pressure steam boiler (4), a superheater (5) and/or ash extraction (17).

13. The method as claimed in one of claims 10 to 12, characterized in that the steam turbine (BG₂) has the following subassemblies:

a high-pressure part (6), an intermediate superheater (7) and/or a low-pressure part (8).

14. The method as claimed in one of claims 10 to 13, characterized in that the condenser (BG₃) has the following subassemblies:

a cooling water pump (20), a cooling tower (18) and/or an additional water pump (19).

15. The method as claimed in one of claims 10 to 14, characterized in that the generator (BG₅) has the following subassemblies:

a 3-phase AC generator (21) and a DC excitation machine (22).

16. The method as claimed in one of claims 10 to 15, characterized in that the flue gas cleaning device (BG₆) has the following assemblies:

a flue gas dust extractor (16) and/or a flue gas fan (16).

19. A large-scale industrial facility, in particular a power station, characterized in that this facility has been optimized in accordance with one of the methods claimed in claims 1 to 16.

17. A computer program, characterized in that the computer program is suitable for carrying out one of the preceding methods.

18. The computer program as claimed in claim 17, characterized in that the computer program can be stored in a storage medium.