CN115424747B - Core loading scheme local search method and system - Google Patents
Core loading scheme local search method and system Download PDFInfo
- Publication number
- CN115424747B CN115424747B CN202210853082.9A CN202210853082A CN115424747B CN 115424747 B CN115424747 B CN 115424747B CN 202210853082 A CN202210853082 A CN 202210853082A CN 115424747 B CN115424747 B CN 115424747B
- Authority
- CN
- China
- Prior art keywords
- core
- algorithm
- scheme
- local search
- symmetric
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 239000000446 fuel Substances 0.000 claims abstract description 107
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 78
- 230000000712 assembly Effects 0.000 claims description 81
- 238000000429 assembly Methods 0.000 claims description 81
- 238000012216 screening Methods 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 6
- 206010011906 Death Diseases 0.000 claims description 4
- 238000005457 optimization Methods 0.000 abstract description 4
- 238000011156 evaluation Methods 0.000 description 12
- 238000013461 design Methods 0.000 description 10
- 238000005192 partition Methods 0.000 description 6
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 6
- 230000009257 reactivity Effects 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000000875 corresponding effect Effects 0.000 description 3
- 238000012854 evaluation process Methods 0.000 description 3
- 238000013075 data extraction Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000003758 nuclear fuel Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G21—NUCLEAR PHYSICS; NUCLEAR ENGINEERING
- G21C—NUCLEAR REACTORS
- G21C17/00—Monitoring; Testing ; Maintaining
- G21C17/06—Devices or arrangements for monitoring or testing fuel or fuel elements outside the reactor core, e.g. for burn-up, for contamination
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Analysis (AREA)
- Algebra (AREA)
- Pure & Applied Mathematics (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Mathematical Optimization (AREA)
- Computational Mathematics (AREA)
- Plasma & Fusion (AREA)
- High Energy & Nuclear Physics (AREA)
- Monitoring And Testing Of Nuclear Reactors (AREA)
Abstract
The invention belongs to the technical field of scheme optimization, and provides a method and a system for locally searching a reactor core loading scheme, wherein the method comprises the following steps: acquiring a local search space, and dividing the local search space into a plurality of sub-search areas; determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space; according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm; searching in all schemes according to the economic index to obtain an optimal scheme; all schemes obtained through the combination algorithm, the arrangement algorithm and the rotation algorithm obviously enlarge the search space of the reactor core loading scheme and improve the economy of the designed reactor core loading scheme in the refueling cycle.
Description
Technical Field
The invention belongs to the technical field of scheme optimization, and particularly relates to a method and a system for locally searching a reactor core loading scheme.
Background
At the end of each operating cycle of the pressurized water reactor, a portion of all fuel assemblies are removed, new fuel assemblies are loaded and all fuel assembly locations are rearranged to achieve as good fuel economy as possible. Typical modern pressurized water reactors are loaded with 157 cartridges of fuel assemblies, and the number of possible core loading scenarios is very large. Thus, an initial scenario is typically determined empirically, then the positions of a few cartridges of fuel assemblies are adjusted based on the evaluation results of the initial scenario and a new scenario is obtained, and the evaluation-adjustment-evaluation process is repeated until a scenario that meets the safety design requirements and that is as optimal as possible for overall economy is obtained.
The economy of the core loading scenario and the number of evaluation scenarios obtained by the refueling design are positively correlated, and the number of core loading scenarios currently evaluated by the design method is very limited. The fuel assembly position adjustment modes used in the adjustment scheme process comprise: exchange of any two position fuel assemblies, exchange of a fuel assembly in an oblique symmetrical position, rotation of the fuel assembly position, etc. Due to the lack of a reactor core loading scheme generation method based on the rules, only a small number of schemes can be generated for evaluation and comparison at each time of adjustment, and a local optimal scheme with better economy cannot be obtained.
In summary, the inventors have found that the currently commonly employed core loading solution design method relies heavily on engineering experience, and how to adjust the fuel assembly position is determined entirely by engineering experience. The core loading scheme evaluation process comprises the steps of core parameter calculation, data extraction, core scheme economic parameter calculation, comparison and the like, and the core loading scheme evaluation efficiency is low; currently, the core loading scenario evaluation process is manually completed, and the evaluation of a large-batch core loading scenario cannot be completed in a limited time.
Disclosure of Invention
In order to solve the problems, the invention provides a method and a system for locally searching a reactor core loading scheme, which can directly obtain a locally optimal solution, and expand the searching range of the reactor core loading scheme, thereby improving the economy of the designed reactor core loading scheme.
In a first aspect, the present invention provides a method for local search of a core loading solution, comprising:
acquiring a local search space, and dividing the local search space into a plurality of sub-search areas;
determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space;
according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm;
searching in all schemes according to the economic index to obtain an optimal scheme.
Further, the local search space is divided into a quarter symmetric core local search space and an eighth symmetric core local search space according to the difference of core symmetry.
Further, for a quarter symmetric core, the total number of solutions obtained by the combining algorithm is:
wherein K is the number of loading areas, m k For the number of component positions, n k The number of the fuel assemblies;
for an eighth symmetric core, the total number of solutions obtained by the combining algorithm is:
wherein n is k4 And m k4 The number of the fuel assemblies is quarter symmetrical, and the number of the assembly positions is quarter symmetrical; n is n k8 And m k8 The number of the fuel assemblies is one eighth of the number of the symmetrical fuel assemblies and the number of the positions of the assemblies respectively;
the number of protocols after batch alignment is:
wherein B is the batch number; m is m b Is a different batch of fuel assemblies; m is the number of combinations of fuel assemblies; b is the batch number; i is a position number.
Further, for a quarter symmetric core, the total number of solutions obtained by the permutation algorithm is:
wherein K is the number of loading areas, m k For the number of component positions, n k The number of the fuel assemblies; considering the rotation of each arrangement of schemes, the total scheme number:
for an eighth symmetric core, the total number of solutions obtained by the permutation algorithm is:
wherein n is k4 And m k4 The number of the fuel assemblies of the quarter-symmetric reactor core and the number of the positions of the assemblies are respectively; n is n k8 And m k8 The number of the fuel assemblies of the eighth symmetric reactor core and the number of the positions of the assemblies are respectively;
if n k8 >m k8 And the fuel assemblies of the eighth symmetric core are divided into 2 quarter symmetric core fuel assemblies, and the total scheme number is:
if the exchange of the symmetrical components inside the quarter-symmetric core is considered, the total solution number is:
if the rotation of the fuel assembly is considered, then the total number of schemes is calculated by the rotation algorithm:
further, the number of total stacks of fuel assemblies corresponding to the fuel assembly positions of each sub-search area is consistent with the number of fuel assemblies provided.
Further, firstly, carrying out scheme screening by using a combination algorithm to obtain a primary scheme number, then, carrying out screening in the primary scheme by using an arrangement algorithm to obtain a further scheme number, and finally, carrying out screening in the further scheme by using a rotation algorithm to obtain a final scheme number; screening in the preliminary protocol may be repeated using an alignment algorithm.
Further, the economic indicators include end-of-life core burnup, cycle length, and average burnup of the discharge assembly.
In a second aspect, the present invention also provides a local search system for a core loading solution, comprising:
acquiring a local search space, and dividing the local search space into a plurality of sub-search areas;
determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space;
according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm;
searching in all schemes according to the economic index to obtain an optimal scheme.
In a third aspect, the present invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the core loading plan local search method described in the first aspect when executing the program.
In a fourth aspect, the present invention also provides a computer readable storage medium having stored thereon a computer program which when executed by a processor implements the steps of the core loading plan local search method described in the first aspect.
Compared with the prior art, the invention has the beneficial effects that:
according to the invention, according to the number of loading areas, the number of assembly positions and the number of fuel assemblies, all schemes of a search space are calculated through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm, all schemes of a defined local space can be generated according to the position adjustment rules of various fuel assemblies, and an optimal reactor core loading scheme can be given after automatic evaluation according to economic indexes; all schemes obtained through the combination algorithm, the arrangement algorithm and the rotation algorithm obviously enlarge the search space of the reactor core loading scheme and improve the economy of the designed reactor core loading scheme in the refueling cycle.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments and are incorporated in and constitute a part of this specification, illustrate and explain the embodiments and together with the description serve to explain the embodiments.
FIG. 1 is a flow chart of embodiment 1 of the present invention;
FIG. 2 is a flow chart of a type-matched core loading scheme partition combining algorithm of embodiment 1 of the present invention;
FIG. 3 is a flow chart of a type-matched core loading scheme partition permutation rotation algorithm of embodiment 1 of the present invention;
FIG. 4 is an initial scheme loading diagram of embodiment 2 of the present invention;
FIG. 5 is a loading diagram of a search scheme according to embodiment 2 of the present invention;
FIG. 6 is an initial version loading diagram of embodiment 3 of the present invention;
fig. 7 is a search scheme loading diagram of embodiment 3 of the present invention.
The specific embodiment is as follows:
the invention will be further described with reference to the drawings and examples.
It should be noted that the following detailed description is illustrative and is intended to provide further explanation of the present application. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
Example 1:
as shown in fig. 1, the present invention provides a local search method for a reactor core loading scheme, which belongs to a local search method for a pressurized water reactor refueling design reactor core loading scheme, and comprises:
acquiring a local search space, and dividing the local search space into a plurality of sub-search areas;
determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space;
according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm;
searching in all schemes according to the economic index to obtain an optimal scheme.
First, determining a local search space of a core loading scheme; the method comprises the following steps:
the local search space is defined before each search is performed. The local search space may be composed of 1 or more search areas, which are independent of each other. The size of the local search space is determined according to the amount of the computing resources and the accepted evaluation time; specifically, when the local search space is acquired, the local search space can be defined by expert knowledge experience, and can be defined based on the core loading scheme actually adopted in the previous cycle, the local search space determines the searching direction of the refueling scheme, and the local search space is divided into a plurality of sub-search areas as much as possible so as to reduce the number of the core loading schemes in the space.
The local search space may be divided into a quarter local search space and an eighth local search space according to the difference of core symmetry. The quarter local search space can ensure the quarter symmetry of the core loading scheme; the eighth local search space may guarantee eighth symmetry of the core loading scheme. The quarter local search space includes 2 types of fuel assemblies according to the number of full core fuel assemblies corresponding to each location; the eighth local search space includes 3 types of fuel assemblies.
The number of full stacks of fuel assemblies corresponding to each sub-region of fuel assembly position in the local search space is consistent with the number of fuel assemblies provided.
Then, a core loading scheme is generated; the method comprises the following steps:
type matching partition combining algorithm:
assuming a total of K loading regions, a total of m for each region k Component positions, n k K=1, 2,3, …, K.
For a quarter-symmetric core, the total number of solutions obtained by the zone-combining algorithm is:
for an eighth symmetric core, assume that the number of quarter symmetric fuel components and the number of locations for each region are n, respectively k4 ，m k4 The number of the eighth symmetrical fuel components and the number of the positions are respectively n k8 ，m k8 The following steps are:
at this time, the total number of schemes obtained by the type matching combination is:
after the combinations of schemes are obtained, each specific combination needs to be arranged in "batches" in order to obtain a batch scheme. Assuming a total of m fuel assemblies, the different batches of fuel assemblies are m b The following steps are:
the number of protocols after "batch" alignment was:
the core loading scheme type matching partition combination algorithm is divided into two steps, and N is used in the 1 st step combination All combining schemes are generated by the algorithm of (2) and N is used in step 2 B Generates a batch recipe for each combination recipe.
Type matching partition permutation rotation algorithm:
assuming a total of K loading regions, a total of m for each region k Component positions, n k K=1, 2,3, …, K, for a quarter symmetric core, all but the center assembly corresponds to 4 fuel assemblies of the full core, for an eighth symmetric core, the fuel assemblies on the symmetry axis correspond to 4 fuel assemblies of the full core, and the fuel assemblies on the non-symmetry axis correspond to 8 fuel assemblies of the full core.
For a quarter symmetric core, the total solution number is:
if the rotation of each arrangement of schemes is further considered, the total number of schemes:
wherein,
for an eighth symmetric core, assume that the number of quarter symmetric fuel components and the number of locations for each region are n, respectively k4 ，m k4 Eighth ofA symmetrical fuel component number and position number n respectively k8 ，m k8 The following steps are:
at this time, the total number of schemes is:
if n k8 >m k8 And an eighth symmetric 8-cartridge fuel assembly can be divided into 2 quarter symmetric fuel assemblies, then the total number of schemes is:
if the exchange of the symmetrical components inside the quarter-symmetric core is considered, the total solution number is:
if the rotation of the fuel assembly is further considered, the total number of schemes:
finally, evaluating the core loading scheme; the method comprises the following steps:
the evaluation of the core loading strategy can be accomplished automatically using a large-scale clustered computer, including mission execution, data extraction, and core loading strategy economic index calculation and comparison.
The core loading scenario generation algorithm based on the present embodiment can generate all scenarios defining the search space, i.e., input files of the core program, according to templates, and then submit the input files to the clusterThe computer's job management system evaluates the core loading plan. Extracting economic index of the reactor core loading scheme from calculation output of the reactor core program according to the keywords after the evaluation is completed, and comparing the scheme quality; the key word can be the end-of-life core burnup, fuel assembly burnup distribution and power factor F ΔH And F Q Etc.
The embodiment is applicable to the economic indexes of various search targets. The economic indicators of the common reactor core loading scheme include the end-of-life reactor core burnup, the cycle length, the average burnup of the discharge assembly and the like. Different economic indexes can be defined according to different search targets, and the different economic indexes only affect the evaluation and comparison process of the reactor core loading scheme, and have no influence on the generation process of the reactor core loading scheme.
The optimal scheme in the current local space can be given according to the evaluation result of the reactor core loading scheme, the scheme can be used as a final optimal scheme, and new local search space can be defined based on the scheme to continue searching and optimizing. In this embodiment, all the schemes defining the search space may be given, i.e. the exhaustion method, so that the optimal scheme in the local space may be directly given by comparing the economic indicators after the core loading scheme is evaluated. The new search space is defined based on the local optimal scheme, and the search is repeated to continuously approach the global optimal scheme.
The method for searching the partial search of the refueling scheme includes defining a partial search space, generating a core loading scheme and automatically evaluating the core loading scheme for 3 steps. The core step of the refueling scheme searching method is the generation of a reactor core loading scheme, the reactor core loading scheme generating method simulates the replacement rule of fuel assemblies in the actual refueling design, the number of the rated reactor core loading schemes is increased, and the economical efficiency of the reactor core loading scheme is obviously improved.
One of the partition combination algorithm, the alignment algorithm, and the rotation algorithm with type matching may be used alone or in combination when generating the core loading scheme. Which algorithm is specifically used to generate the core loading scheme depends on the goodness of the initial core loading scheme, and when the initial screening of the core loading scheme is performed, a combination method is preferentially used, and the combination algorithm can be used for determining the positions of fuel assemblies with larger reactivity, such as fuel assemblies of different batches; in fine tuning of the core loading scheme, a ranking method is preferably used, and a ranking algorithm can be used to determine the locations of similar reactive fuel assemblies, such as the same batch of fuel assemblies; when the power peak of the reactor core loading scheme is finally optimized, a rotation method is preferentially adopted, and a rotation algorithm can be used for determining the positions of the symmetrical position fuel assemblies; it can be understood that, firstly, a combination algorithm is utilized to perform scheme screening to obtain a preliminary scheme number, then an arrangement algorithm is utilized to perform screening in the preliminary scheme to obtain a further scheme number, and finally, a rotation algorithm is utilized to perform screening in the further scheme to obtain a final scheme number; wherein the screening in the preliminary protocol can be repeated using an alignment algorithm.
The use of an eighth of the local search space may allow the core to meet greater symmetry while reducing the number of fuel assemblies contained in the search space.
The search may be performed by redefining a local search space based on the core loading scheme searched for in the present embodiment, and this process may be repeated until the local optimum core loading scheme obtained by the search is unchanged.
According to the method, parallel evaluation of all core loading schemes in the search space is generated through the method for searching the material changing scheme, so that the locally optimal core loading scheme is given, the design efficiency of the core loading scheme can be greatly improved, and the comprehensive economy of the core loading scheme is obviously improved. For pressurized water reactor cores of different types of square fuel assemblies, the method for locally searching the loading scheme of the reactor core of the refueling design has universality.
Example 2:
for the purpose of explanation and verification of the method in example 1, in this example, the application process and effect of the refueling scheme are explained by taking the pressurized water reactor nuclear power plant a 2 nd cycle refueling design loaded with 157 square fuel assemblies as an example. The initial scheme of the search is a scheme obtained through engineering repeated optimization, and the comprehensive economy is very close to a local optimal solution. The goal of the search is to obtain a core loading solution with greater burnup of the discharge.
Considering that the initial solution is already very close to the locally optimal solution, the following strategy is adopted to define a local search space, S1, fuel assemblies with similar reactivity are defined as a search space, and a reactor core loading solution is generated by using a permutation algorithm; s2, defining the fuel assembly with large fuel gradient inside the fuel assembly as a search space, and generating a reactor core loading scheme by using a rotation algorithm.
The total number of generated and evaluated scenarios is 1104, and table 1 shows comparison of the search results and the economic parameters of the initial core loading scenario, and it can be seen that the search scenario has greater unloading burnup without changing the economic and safety parameters of other cores.
Table 1 comparison of search results and initial core loading scenario economics parameters
Implementation example 3:
for the purpose of explanation and verification of the method in example 1, in this example, the 3 rd cycle refueling design of a pressurized water reactor nuclear power plant B loaded with 157 square fuel assemblies is taken as an example, and the application process and effect of the refueling scheme are explained. The initial solution for searching is designed by referring to the reactor core loading solution of the previous cycle, and the solution is not subjected to engineering optimization, so that the solution has poor economy, and the method in the invention is used for searching the initial solution for a plurality of times. The goal of the search is to obtain a core loading solution with a longer cycle length, with the safety limits met.
Considering that the initial scheme has low economical efficiency, the following strategy is adopted to define a local search space, S1, fuel assemblies with similar reactivity are defined as the same batch, and the arrangement positions of different reactive fuel assemblies are determined by using a combined algorithm reactor core loading scheme; s2, defining fuel assemblies near the center of the reactor core and the outermost side of the reactor core as two sub-areas of a local search space, and generating a reactor core loading scheme by using an arrangement algorithm; s3, defining a batch F1 and a batch F2 with larger reactivity difference as a local search space, and generating a reactor core loading scheme by using a permutation algorithm; and S4, defining the fuel assemblies with similar reactivities as a local search space based on the search results in the step S3, and generating a reactor core loading scheme by using a rotation algorithm.
The total number of generated and evaluated schemes is 11000, and the comparison of the search results and the economic parameters of the initial reactor core loading scheme is given in table 2, so that the cycle length is obviously increased, and the requirement of a search target is met; the power peak factor is slightly increased but still within the safety limits; the reduced burnup of the off-gas indicates that the increase in cycle length is achieved primarily by burning the new fuel assembly.
TABLE 2 comparison of search results and initial core loading scenario economics parameters
Example 4:
the embodiment provides a reactor core loading scheme local search system, which comprises:
acquiring a local search space, and dividing the local search space into a plurality of sub-search areas;
determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space;
according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm;
searching in all schemes according to the economic index to obtain an optimal scheme.
The working method of the system is the same as that of the core loading scheme local search method of embodiment 1, and will not be repeated here.
Example 5:
the present embodiment provides an electronic device including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the steps in the core loading scheme local search method of embodiment 1 are implemented when the processor executes the program.
Example 6:
the present embodiment provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps in the core loading scheme local search method described in embodiment 1.
The above description is only a preferred embodiment of the present embodiment, and is not intended to limit the present embodiment, and various modifications and variations can be made to the present embodiment by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present embodiment should be included in the protection scope of the present embodiment.
Claims (7)
1. A method of local search for a core loading scenario, comprising:
acquiring a local search space, and dividing the local search space into a plurality of sub-search areas;
determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space;
according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm;
searching in all schemes according to the economic index to obtain an optimal scheme;
the local search space is divided into a quarter symmetrical core local search space and an eighth symmetrical core local search space according to the difference of core symmetry;
for a quarter-symmetric core, the total number of solutions obtained by the combining algorithm is:
wherein K is the number of loading areas, m k For the number of component positions, n k The number of the fuel assemblies;
for an eighth symmetric core, the total number of solutions obtained by the combining algorithm is:
wherein n is k4 And m k4 The number of the fuel assemblies of the quarter-symmetric reactor core and the number of the positions of the assemblies are respectively; n is n k8 And m k8 The number of the fuel assemblies of the eighth symmetric reactor core and the number of the positions of the assemblies are respectively;
the number of protocols after batch alignment is:
wherein B is the batch number; m is m b Is a different batch of fuel assemblies; m is the number of combinations of fuel assemblies; b is the batch number; i is a position number;
for a quarter-symmetric core, the total number of solutions obtained by the permutation algorithm is:
wherein K is the number of loading areas, m k For the number of component positions, n k The number of the fuel assemblies;
considering the rotation of each arrangement of schemes, the total scheme number:
for an eighth symmetric core, the total number of solutions obtained by the permutation algorithm is:
wherein n is k4 And m k4 The number of the fuel assemblies of the quarter-symmetric reactor core and the number of the positions of the assemblies are respectively; n is n k8 And m k8 The number of the fuel assemblies of the eighth symmetric reactor core and the number of the positions of the assemblies are respectively;
if n k8 >m k8 And the fuel assemblies of the eighth symmetric core are divided into 2 quarter symmetric core fuel assemblies, and the total scheme number is:
if the exchange of the symmetrical components inside the quarter-symmetric core is considered, the total solution number is:
if the rotation of the fuel assembly is considered, then the total number of schemes is calculated by the rotation algorithm:
2. the core loading plan local search method of claim 1, wherein the number of full stacks of fuel assemblies corresponding to each sub-search zone fuel assembly location corresponds to the number of fuel assemblies provided.
3. The local search method of a reactor core loading scheme as claimed in claim 1, wherein scheme screening is performed by using a combination algorithm to obtain a preliminary scheme number, then screening is performed in the preliminary scheme by using an arrangement algorithm to obtain a further scheme number, and finally screening is performed in the further scheme by using a rotation algorithm to obtain a final scheme number; screening in the preliminary protocol may be repeated using an alignment algorithm.
4. The core loading plan local search method of claim 1, wherein the economic indicators include end-of-life core burnup, cycle length, and discharge assembly average burnup.
5. A core loading solution local search system, comprising:
a space division module configured to: acquiring a local search space, and dividing the local search space into a plurality of sub-search areas;
a component number determination module configured to: determining a number of loading regions through the plurality of sub-search regions, and determining a number of component positions and a number of fuel components in the local search space;
a computing module configured to: according to the number of loading areas, the number of component positions and the number of fuel components, calculating to obtain all schemes of the search space through one or more of a combination algorithm, an arrangement algorithm and a rotation algorithm;
a search module configured to: searching in all schemes according to the economic index to obtain an optimal scheme;
the local search space is divided into a quarter symmetrical core local search space and an eighth symmetrical core local search space according to the difference of core symmetry;
for a quarter-symmetric core, the total number of solutions obtained by the combining algorithm is:
wherein K is the number of loading areas, m k For the number of component positions, n k The number of the fuel assemblies;
for an eighth symmetric core, the total number of solutions obtained by the combining algorithm is:
wherein n is k4 And m k4 The number of the fuel assemblies of the quarter-symmetric reactor core and the number of the positions of the assemblies are respectively; n is n k8 And m k8 The number of the fuel assemblies of the eighth symmetric reactor core and the number of the positions of the assemblies are respectively;
the number of protocols after batch alignment is:
wherein B is the batch number; m is m b Is a different batch of fuel assemblies; m is the number of combinations of fuel assemblies; b is the batch number; i is a position number;
for a quarter-symmetric core, the total number of solutions obtained by the permutation algorithm is:
wherein K is the number of loading areas, m k For the number of component positions, n k The number of the fuel assemblies;
considering the rotation of each arrangement of schemes, the total scheme number:
for an eighth symmetric core, the total number of solutions obtained by the permutation algorithm is:
wherein n is k4 And m k4 The number of the fuel assemblies of the quarter-symmetric reactor core and the number of the positions of the assemblies are respectively; n is n k8 And m k8 The number of the fuel assemblies of the eighth symmetric reactor core and the number of the positions of the assemblies are respectively;
if n k8 >m k8 And the fuel assemblies of the eighth symmetric core are divided into 2 quarter symmetric core fuel assemblies, and the total scheme number is:
if the exchange of the symmetrical components inside the quarter-symmetric core is considered, the total solution number is:
if the rotation of the fuel assembly is considered, then the total number of schemes is calculated by the rotation algorithm:
6. an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps in the core loading scheme local search method of any one of claims 1-4 when the program is executed.
7. A computer readable storage medium having stored thereon a computer program which when executed by a processor implements the steps in the core loading plan local search method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210853082.9A CN115424747B (en) | 2022-07-20 | 2022-07-20 | Core loading scheme local search method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210853082.9A CN115424747B (en) | 2022-07-20 | 2022-07-20 | Core loading scheme local search method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115424747A CN115424747A (en) | 2022-12-02 |
| CN115424747B true CN115424747B (en) | 2024-01-23 |
Family
ID=84196063
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210853082.9A Active CN115424747B (en) | 2022-07-20 | 2022-07-20 | Core loading scheme local search method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115424747B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004258037A (en) * | 2003-02-25 | 2004-09-16 | Westinghouse Electric Co Llc | Method of establishing loaded pattern of nuclear reactor core fuel assembly |
| CN102332315A (en) * | 2007-09-26 | 2012-01-25 | 大亚湾核电运营管理有限责任公司 | Refueling method for fuel assemblies of reactor core of PWR (pressurized water reactor) nuclear power plant |
| CN107301314A (en) * | 2017-05-23 | 2017-10-27 | 西安交通大学 | A kind of computational methods searched for for fast neutron reactor balanced recycle |
| CN107977504A (en) * | 2017-11-28 | 2018-05-01 | 广东核电合营有限公司 | A kind of asymmetric in-core fuel management computational methods, device and terminal device |
| CN114254803A (en) * | 2021-11-10 | 2022-03-29 | 中广核研究院有限公司 | Reloading loading scheme search optimization method |
-
2022
- 2022-07-20 CN CN202210853082.9A patent/CN115424747B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004258037A (en) * | 2003-02-25 | 2004-09-16 | Westinghouse Electric Co Llc | Method of establishing loaded pattern of nuclear reactor core fuel assembly |
| FR2853987A1 (en) * | 2003-02-25 | 2004-10-22 | Westinghouse Electric Cy Llc | METHOD FOR ESTABLISHING A LOAD PLAN FOR FUEL ASSEMBLIES IN THE HEART OF A NUCLEAR REACTOR |
| CN102332315A (en) * | 2007-09-26 | 2012-01-25 | 大亚湾核电运营管理有限责任公司 | Refueling method for fuel assemblies of reactor core of PWR (pressurized water reactor) nuclear power plant |
| CN107301314A (en) * | 2017-05-23 | 2017-10-27 | 西安交通大学 | A kind of computational methods searched for for fast neutron reactor balanced recycle |
| CN107977504A (en) * | 2017-11-28 | 2018-05-01 | 广东核电合营有限公司 | A kind of asymmetric in-core fuel management computational methods, device and terminal device |
| CN114254803A (en) * | 2021-11-10 | 2022-03-29 | 中广核研究院有限公司 | Reloading loading scheme search optimization method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115424747A (en) | 2022-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP0786782B1 (en) | Method for determining nuclear core loading arrangement | |
| Möhring et al. | Linear preselective policies for stochastic project scheduling | |
| EP3961431B1 (en) | Method and apparatus for grouping transactions that need to be serially executed based on a sequence of transactions in one block of a blockchain | |
| Mosayebi et al. | Tuning genetic algorithm parameters using design of experiments | |
| CN108920412B (en) | Algorithm automatic tuning method for heterogeneous computer system structure | |
| EP0823712B1 (en) | Method and system for determining nuclear reactor core control blade positioning | |
| CN105810254B (en) | Lack the Restart Method and system in group cross-section library for making reactor nuclear design | |
| CN115424747B (en) | Core loading scheme local search method and system | |
| CN109299101B (en) | Data retrieval method, device, server and storage medium | |
| Gao et al. | Internally induced branch-and-cut acceleration for unit commitment based on improvement of upper bound | |
| CN113421073A (en) | Method and apparatus for concurrently executing transactions in a blockchain | |
| Stover et al. | Optimization of BWR fuel management using an accelerated exhaustive search algorithm | |
| CN112947932B (en) | Method and device for optimizing vectorization in compiling process and electronic equipment | |
| Snipes et al. | H mode power threshold database for ITER | |
| CN112214521A (en) | Rule query method, device, equipment and computer storage medium | |
| Bożejko et al. | Blocks for two-machines total weighted tardiness flow shop scheduling problem | |
| CN114168314B (en) | Multithreading concurrent data index batch processing method and device and storage medium | |
| CN110069527A (en) | A kind of GPU and CPU isomery accelerated method of data base-oriented | |
| CN113505017A (en) | Problem troubleshooting method, device, storage medium and equipment | |
| CN111090638B (en) | Comparison method and device for transaction functions in database migration | |
| CN114168594A (en) | Secondary index creating method, device, equipment and storage medium of horizontal partition table | |
| CN116975126B (en) | Data query method, device, computing equipment and computer readable storage medium | |
| CN116305793A (en) | Safety constraint unit combination calculation method based on pre-solving-accurate solving double-layer iteration | |
| Apurba | A Comprehensive Survey on Optimizing Storage Models, Data Layouts, and System Catalogs | |
| Shifatul | A Comprehensive Survey on Optimizing Storage Models, Data Layouts, and System Catalogs s |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: No. 29 Hong Cao Road, Xuhui District, Shanghai Applicant after: Shanghai Nuclear Engineering Research and Design Institute Co.,Ltd. Address before: No. 29 Hong Cao Road, Xuhui District, Shanghai Applicant before: SHANGHAI NUCLEAR ENGINEERING RESEARCH & DESIGN INSTITUTE Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |