Optimal calculation method for dry waste barrel cake-packed 200L steel barrel

Abstract

The invention belongs to the technical field of radioactive solid waste treatment of a nuclear power plant, and provides an optimal calculation method for loading a dry waste barrel cake into a 200L steel barrel, which comprises the following steps of: defining data, sorting the barrel cake, carrying out barreling calculation, traversing each barrel cake in a sorted set, traversing each steel barrel in a steel barrel set, and calculating the residual height. The steel drum with the minimum W value is selected from the steel drums meeting the conditions and marked as the current optimal steel drum, if the optimal steel exists, updating and recording are carried out, if the steel drums capable of being loaded do not exist, the steel drums are newly added, and the serial numbers, the used height and the remaining height of all the steel drums and the serial number and the thickness of the drum cake loaded in each steel drum are output. According to the method, the steel drums with the fixed height can be filled with the waste drum cakes with the random height as much as possible, the number of the waste steel drums is reduced by 200 liters to the maximum extent, volume reduction of radioactive solid waste is achieved to the maximum extent, and the purchase cost of the steel drums is saved.

Description

Technical Field

[0001] The present application belongs to the technical field of radioactive solid waste treatment in nuclear power plants, and in particular relates to an optimal calculation method for loading dry waste drum cakes into 200L steel drums. Background Art

[0002] During the radioactive solid waste treatment process at nuclear power plants, compressible dry waste (such as contaminated discarded parts and work clothes) is loaded into 160-liter steel drums. These drums are then fed into super compactors for overpressure, which compresses the drums into cakes of random thickness (depending on the compressive strength and hardness of the waste inside) but uniform diameter. These cakes are then loaded into 200-liter drums for cement curing. The internal height of the 200-liter drum is fixed, while the height (thickness) of the cakes is random. Consideration must be given to how to pack the drums to fill them as full as possible, thereby minimizing the number of 200-liter drums used and maximizing the volume reduction of radioactive waste. Summary of the Invention

[0003] The purpose of this application is to provide an optimal calculation method for filling a 200L steel drum with dry waste drum cakes, so as to solve the problem of how to fill a steel drum of fixed height as much as possible with waste drum cakes of random heights.

[0004] In order to achieve the above objectives, this application provides the following technical solutions:

[0005] A preferred calculation method for dry waste drum cakes in 200L steel drums, including:

[0006] Step 1: Data definition: Define the waste bucket cake set I = {i1,i2,…,i n}, where each bucket cake i k Contains the thickness attribute sk and the final loaded steel drum number P k , initially P k Empty; define the steel barrel set B = {b1, b2, ..., b m}, where each steel barrel b j Contains a fixed total internal height C and a used height u that is initially zero j ;

[0007] Step 2: Sort the barrel cakes: Sort all the barrel cakes in set I by thickness s. k Arrange in descending order to obtain the sorted set I';

[0008] Step 3: Bucketing calculation: traverse each bucket cake i in I' k , do the following:

[0009] Traverse each steel barrel b in set B j , if uj +s k ≤C, then calculate the remaining height W=Cu j -s k ;

[0010] Select the steel barrel b with the smallest W value from the steel barrels that meet the conditions j , marked as the current optimal steel barrel;

[0011] If there is an optimal steel barrel, update u j =u j +s k , and record P k =*j*;

[0012] If there is no steel drum that can be loaded, add a new steel drum b m+1 , set u m+1 =s k , and b m+1 Add to set B and record P k =*m+1*;

[0013] Step 4. Result output: Output the number j and used height u of all steel drums j , Residual height Cu j , and the number k of the barrel cakes loaded into each steel barrel and its thickness s k .

[0014] In step 1, the thickness s of each barrel cake in the barrel cake set I is k is an independent attribute, and initially P k Is a null value.

[0015] In step 1, the used height u of each steel barrel in the steel barrel set B is j The initial value is zero and is updated dynamically during the bucketing process.

[0016] In step 2, sorting is achieved by descending order, and the sorting rule is I'=Sort(I,Descending(s k )).

[0017] In step 3, when traversing the steel barrels, the optimal steel barrel is selected according to the following conditions:

[0018] Condition 1: u j +s k ≤C;

[0019] Condition 2: In the steel drum that meets condition 1, select Cu j -s k The smallest steel drum.

[0020] In step 3, if there is an optimal steel barrel b j, then update its used height to u j =u j +s k ; If it does not exist, add a new steel barrel b m+1 The number is *m+1*, and its used height is initialized to u m+1 =s k .

[0021] In step 3, by updating the u of the steel barrel in set B in real time j value, ensuring the dynamic and accurate bucketing calculation.

[0022] In step 4, the output residual height is Cu j , and the information of each steel drum’s loading cake includes its number k and thickness s k .

[0023] Compared with the prior art, the preferred calculation method for dry waste drum cakes in a 200L steel drum provided by this application has the following beneficial effects:

[0024] This application enables the use of random-height waste drum cakes to fill fixed-height steel drums as much as possible. This method, scientifically calculated, minimizes the number of 200-liter waste drums, maximizing the volume reduction of radioactive solid waste and saving on drum procurement costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solution of this application, the following is a brief introduction to the drawings required for the technical description.

[0026] Figure 1 Flowchart of the preferred calculation method for filling 200L steel drums with dry waste drum cakes provided in this application. DETAILED DESCRIPTION

[0027] The following is further explained in detail through specific implementation methods.

[0028] like Figure 1 As shown, the present application provides a preferred calculation method for dry waste barrel cakes to be loaded into a 200L steel drum, comprising the following steps:

[0029] Step 1: Data definition: Define the waste bucket cake set I = {i1,i2,…,i n}, where each bucket cake i k Contains thickness attribute s k And the final steel drum number P k , initially P k Empty; define the steel barrel set B = {b1, b2, ..., b m}, where each steel barrel b jContains a fixed total internal height C and a used height u that is initially zero j ;

[0030] Step 2: Sorting the barrel cakes: Arrange all the barrel cakes in set I in descending order of thickness sk to obtain the sorted set I';

[0031] Step 3: Bucketing calculation: traverse each bucket cake i in I' k , do the following:

[0032] Traverse each steel barrel b in set B j , if u j +s k ≤C, then calculate the remaining height W=Cu j -s k ;

[0033] Select the steel barrel b with the smallest W value from the steel barrels that meet the conditions j , marked as the current optimal steel barrel;

[0034] If there is an optimal steel barrel, update u j =u j +s k , and record P k =*j*;

[0035] If there is no steel drum that can be loaded, add a new steel drum b m+1 , set u m+1 =s k , and b m+1 Add to set B and record P k =*m+1*;

[0036] Step 4. Result output: Output the number j and used height u of all steel drums j , Residual height Cu j , and the number k of the barrel cakes loaded into each steel barrel and its thickness s k .

[0037] In step 1, the thickness s of each barrel cake in the barrel cake set I is k is an independent attribute, and initially P k Is a null value.

[0038] In step 1, the used height u of each steel barrel in the steel barrel set B is j The initial value is zero and is updated dynamically during the bucketing process.

[0039] In step 2, sorting is achieved by descending order, and the sorting rule is I'=Sort(I,Descending(s k )).

[0040] In step 3, when traversing the steel barrels, the optimal steel barrel is selected according to the following conditions:

[0041] Condition 1: u j +s k ≤C;

[0042] Condition 2: In the steel drum that meets condition 1, select Cu j -s k The smallest steel drum.

[0043] In step 3, if there is an optimal steel barrel b j , then update its used height to u j =u j +s k ; If it does not exist, add a new steel barrel b m+1 The number is *m+1*, and its used height is initialized to u m+1 =s k .

[0044] In step 3, by updating the u of the steel barrel in set B in real time j value, ensuring the dynamic and accurate bucketing calculation.

[0045] In step 4, the output residual height is Cu j , and the information of each steel drum’s loading cake includes its number k and thickness s k .

[0046] Example

[0047] The preferred calculation method provided in this embodiment specifically includes the following:

[0048] Step 1: Identify the basic information of all waste drum cakes and drums to be processed. Each waste drum cake needs to record its thickness and the drum number into which it will be placed. Initially, these numbers are unassigned. Each 200-liter drum has a fixed interior height and is initially unoccupied; the occupied height is tracked.

[0049] Step 2: Sort all waste bucket cakes by thickness from largest to smallest.

[0050] Step 3: Process each waste bucket cake in the sorted order. For the waste bucket cake currently being processed, it is necessary to traverse all existing steel drums to determine whether it can be loaded.

[0051] Step 4: Output the usage of all steel drums, including the number of each steel drum, the occupied height, the remaining height, and the number and thickness of the waste drum cake loaded.

[0052] This method can minimize the number of steel drums used, significantly improve the volume reduction efficiency of radioactive waste, and reduce procurement costs.

[0053] In step 1, the bucket cake set is I = {i1,i2,…,i n}: Each item i k There is a thickness s k Each barrel cake has the final barrel serial number P k , the initial value is empty.

[0054] In step 1, the steel barrel set is B={b1,b2,…,b m}, where each steel barrel b j There is a height c and a used height u j .

[0055] In step 1, the thickness of the barrel cake is s k , barrel cake i k Thickness, steel drum height c, steel drum b j Height, the steel drum has used height u j , steel drum b j Used height.

[0056] In step 2, the barrel cake set I is divided into two groups according to the thickness s. k Sort in descending order: I′=Sort(I,Descending).

[0057] The purpose of step 2 is to prioritize the processing of thicker waste drum cakes in order to more efficiently utilize the drum space and reduce the remaining void space during subsequent filling.

[0058] In step 3, if the sum of the occupied height of a drum and the thickness of the waste pie does not exceed the total height of the drum, the remaining space after loading is calculated. By comparing the remaining space of all feasible drums, the drum with the smallest remaining space is selected as the target. If a drum that meets the requirements exists, the waste pie is loaded into it and the drum's occupied height is updated. If none of the existing drums can accommodate the waste pie, a new drum is added and the current waste pie is loaded into it.

[0059] Step 3 specifically includes:

[0060] Step 3.1: For each item i k , traverse the existing bucket cake set I;

[0061] Define a Boolean variable placed to mark whether the barrel cake has been placed in a steel barrel; W = C;

[0062] Define a double variable W to store the temporary variable of the minimum remaining height of the steel drum after storing the current drum cake; n = 0;

[0063] Define a float variable to store the temporary variable of the serial number of the steel barrel with the smallest remaining height after storing the current barrel cake;

[0064] Step 3.2: For each steel barrel b j , traverse the existing steel barrel set B;

[0065] If u j +s k ≤C&C-u j -s k <W; Determine whether the steel drum can hold the current drum cake and the remaining height is the minimum; W=Cu j -s k ;

[0066] Update the minimum remaining height W of the steel drum; n = j; record the current optimal steel drum number;

[0067] Mark that the current barrel cake has been placed in the steel barrel;

[0068] The steel barrel traversal is over;

[0069] Step 3.3: If the barrel cake has been placed, Pk = n, record the number of the steel barrel where the barrel cake is placed, and add the current barrel cake thickness to the optimal steel barrel height found by traversal;

[0070] If the barrel cake is not placed, b m+1 , create a new steel barrel m+1, u m+1 =s k , set the new used height of the steel drum to the drum cake thickness s k ; B=B∪{b m+1};

[0071] The new steel drum b m+1 Add to the steel barrel set B; P k =m+1;

[0072] Record the number of the steel drum into which the drum cake is placed;

[0073] The bucket cake traversal is completed.

[0074] In step 4, the numbers, used heights, remaining heights, and numbers and thicknesses of all used steel drums are output.

[0075] The above description is only a specific implementation method of the present application, but the scope of protection of the present application is not limited thereto. Any changes or replacements that can be easily thought of by any technician familiar with this technical field within the technical scope disclosed in this application should be covered by the scope of protection of the present application.

Claims

1. A method for calculating the optimal amount of dry waste drum cakes in a 200L steel drum, characterized in that: include: Step 1: Define the waste bucket cake set I = {i1,i2,…,i n }, where each bucket cake i k Contains thickness attribute s k And the final steel drum number P k , initially P k Empty; define the steel barrel set B = {b1, b2, ..., b m }, where each steel barrel b j Contains a fixed total internal height C and a used height u that is initially zero j ; Step 2: Arrange all the barrel cakes in set I according to the thickness s k Arrange in descending order to obtain the sorted set I'; Step 3: Traverse each bucket cake i in I' k , do the following: Traverse each steel barrel b in set B j , if u j +s k ≤C, then calculate the remaining height W=Cu j -s k ; Select the steel barrel b with the smallest W value from the steel barrels that meet the conditions j , marked as the current optimal steel barrel; If there is an optimal steel barrel, update u j =u j +s k , and record P k =*j*; If there is no steel drum that can be loaded, add a new steel drum b m+1 , set u m+1 =s k , and b m+1 Join set B and record P k =*m+1*; Step 4: Output the number j and used height u of all steel drums j , Residual height Cu j , and the number k of the barrel cakes loaded into each steel barrel and its thickness s k .

2. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 1, the thickness s of each barrel cake in the barrel cake set I is k is an independent attribute, and initially P k Is a null value.

3. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 1, the used height u of each steel barrel in the steel barrel set B is j The initial value is zero and is updated dynamically during the bucketing process.

4. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 2, sorting is achieved by descending order, and the sorting rule is I'=Sort(I,Descending(s k )).

5. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 3, when traversing the steel barrels, the optimal steel barrel is selected according to the following conditions: Condition 1: u j +s k ≤C; Condition 2: In the steel drum that meets condition 1, select Cu j -s k The smallest steel drum.

6. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 3, if there is an optimal steel barrel b j , then update its used height to u j =u j +s k ; If it does not exist, add a new steel barrel b m+1 The number is *m+1*, and its used height is initialized to u m+1 =s k .

7. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 3, by updating the u of the steel barrel in set B in real time j value, ensuring the dynamic and accurate bucketing calculation.

8. The optimal calculation method for dry waste drum cakes in a 200L steel drum according to claim 1 is characterized in that: In step 4, the output residual height is Cu j , and the information of each steel drum’s loading cake includes its number k and thickness s k .

Images