Bilateral local damage disassembly line setting method considering electrical limitation and time-of-use electricity price
Through the bilateral local damage disassembly line setting method and improved water circulation algorithm, combined with time-sharing electricity price and disassembly mode, the disassembly solution is optimized, the problems of electrical restrictions and time-sharing electricity price not considered in the existing technology are solved, and the disassembly efficiency and energy are improved Utilization rate, suitable for disassembly of large and complex products.
Patent Information
- Application Number
- CN202411083851.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-08
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-08-08
AI Technical Summary
The existing disassembly line balancing technology fails to effectively consider electrical limitations and time-sharing electricity prices, resulting in inefficient disassembly and neglecting the non-decomposition and energy consumption of complex products, resulting in task failure or energy waste.
Using the bilateral local damage disassembly line setting method, combined with the improved water cycle algorithm, a hybrid integer planning model is established, time-sharing electricity price and disassembly mode are considered, and the disassembly solution is optimized through double-layer coding and Pareto elite strategy, reducing energy consumption and improving disassembly efficiency .
It realizes the optimization of disassembly line settings when considering electrical limitations and time-sharing electricity prices, improves disassembly efficiency and energy utilization, and reduces costs, which is suitable for disassembly of large and complex retired products.
Smart Images

Figure CN119026850A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of disassembly line balance, in particular to a bilateral local destruction disassembly line setting method considering electrical restrictions and time-of-use electricity prices. Background Art
[0002] The world is currently facing a serious energy crisis due to frequent extreme weather events such as drought, heavy rain and high temperature. The automotive manufacturing industry is a strategic pillar of the economy of many countries and has made great contributions to the stable growth of the industry. However, as one of the industries with the largest consumption of metal resources, it poses considerable challenges to the environment and energy consumption. Remanufacturing aims to use advanced technology to restore or even improve the quality of scrapped products, significantly reduce resource waste, alleviate the energy crisis and promote the development of a circular economy. Disassembly is the premise of remanufacturing. Efficient disassembly of scrapped products can minimize the pollution of harmful substances to the environment and effectively recycle parts for subsequent remanufacturing, thereby saving resources. In order to reduce costs and improve efficiency, many companies have established disassembly production lines, especially for large and complex retired automotive products. Effective allocation of disassembly tasks and load balancing, namely the disassembly line balance (DLB) problem, is crucial to improving disassembly efficiency. By solving this problem, companies can not only significantly improve the efficiency of remanufacturing disassembly, but also promote the development of a circular green economy.
[0003] The disassembly of retired products is inherently complex due to practical factors such as product size, failure modes, disassembly costs, and energy consumption. These factors have brought continuous challenges to the study of the DLB problem. Unfortunately, current research has mainly focused on non-destructive disassembly, ignoring the impact of these factors, resulting in inefficiency and may ultimately lead to mission failure. In addition, the disassembly industry is usually energy-intensive and tends to consume a lot of energy. Therefore, most of the literature takes energy consumption and costs into consideration. However, these studies usually assume that the disassembly cost and energy consumption of each task are fixed and only focus on minimizing energy consumption. They rarely consider electricity costs and limitations, especially in the case of time-of-use electricity prices. This cannot be ignored in practice. But unfortunately, there is no work that considers time-of-use electricity prices in the existing DLB problem. Summary of the invention
[0004] To solve the above problems, the main purpose of the present invention is to provide a bilateral local destruction disassembly line setting method taking into account electrical limitations and time-of-use electricity prices, and also to provide a solution method based on the improved water circulation method (IWCA) to obtain a comprehensive and optimal solution in many aspects, providing guidance and basis for the optimal setting of disassembly lines for large and complex retired products.
[0005] The choice of disassembly mode is usually related to the properties of the scrapped product itself. For example, Figure 1Task 41 in the example is a circuit board for scrapped LCD TVs. Due to its inherently high value, non-destructive disassembly is usually used to ensure its integrity. In contrast, Task 5 has a lower recycling value and can be quickly recycled through destructive disassembly. In addition, there are some components that cannot be disassembled non-destructively due to their own non-disassembly. These components are often caused by some faults such as aging, deformation, corrosion, etc. Therefore, these components can only be disassembled destructively. Therefore, the introduction of destructive disassembly is more suitable for actual engineering applications. In addition, the type of workstation layout of the disassembly line is also crucial to actual production. For example Figure 1 The disassembly line layout shown in the figure can be disassembled on both sides of the production line, so it is called a bilateral disassembly line. This layout can greatly reduce the transportation length of retired products and improve disassembly efficiency.
[0006] As we all know, as an energy-intensive industry, disassembly work consumes a lot of electricity. However, most studies assume that the disassembly cost and energy consumption of each task are fixed, focusing only on minimizing energy consumption and ignoring the cost savings under time-of-use electricity prices. Figure 1 As shown in Figure 1, electricity consumption scenarios can be divided into off-peak, mid-peak, and peak periods. Time-of-use electricity prices result in higher peak prices and lower off-peak prices. This consideration is crucial in practice. Unfortunately, there is no research on DLB under time-of-use electricity prices.
[0007] The assumptions of the present invention are: (1) the retired products are unique in type and there are sufficient complete components, ignoring unplanned interruptions and task failures; (2) it is assumed that the operating proficiency of each worker is at the same level; (3) all workstations are equipped with auxiliary lifting equipment to break the restrictions on the disassembly direction of parts; (4) all parts allow destructive disassembly and are equipped with disassembly tools; (5) the time for replacing disassembly tools is included in the disassembly time of the parts.
[0008] The technical solution of the present invention is:
[0009] The bilateral local destruction disassembly line setting method considering electrical restrictions and time-of-use electricity prices includes the following steps:
[0010] S1. Obtain basic information of disassembly tasks, including disassembly time under different disassembly modes, recycling value of tasks under different disassembly modes, unit power consumption of tasks under different disassembly modes, tools required for disassembly, feasibility value of destructive disassembly, priority relationship, and unit electricity cost under different seasons and time periods;
[0011] S2. Establish a multi-objective function for bilateral local destruction disassembly line, including the number of workstations, idle time equilibrium rate, disassembly profit considering time-of-use electricity price, and disassembly energy consumption considering different disassembly modes, and establish a corresponding mixed integer programming model; at the same time, establish the constraints of the model, including the disassembly direction, priority, disassembly mode, time, location and workstation of the task.
[0012] S3, solving the mixed integer programming model;
[0013] In addition, the present invention proposes a new method for solving the above mixed integer programming model, which comprises the following steps:
[0014] S31, based on the double-layer encoding method, performs two-stage decoding, and then generates the initial solution according to the Pareto elite strategy;
[0015] S32. The initial solution is optimized and updated by improving the water cycle algorithm, and the Pareto elite retention strategy is introduced to obtain the optimal plan and solution.
[0016] Among them, the initial solution is optimized and updated by improving the water cycle algorithm, including: after the decoding is completed and the initial population is generated, the objective function is calculated, the ocean, river, and stream are divided to generate the first generation population; then the ocean-river and river-stream position are updated; then the rainfall operation is performed; the child population is combined with the parent population to form a new generation population and the above operations are performed again until the number of iterations meets the termination condition, and the optimal solution is screened out as the final output through the hypervolume value (HV).
[0017] Beneficial effects:
[0018] The present invention designs a method for setting up a bilateral local destructive disassembly line that considers electrical limitations and time-of-use electricity prices. Considering that current research mainly focuses on non-destructive linear disassembly, ignoring the situation where the task cannot be disassembled due to the uncertainty of the quality of retired products, destructive disassembly is introduced to solve this problem. In addition, due to the difficulty in moving large and complex products, a bilateral layout is also designed to reduce product movement by disassembling on both sides of the production line. In order to more accurately reflect the situation in the real world, this study incorporates time-of-use electricity prices into the model, which has not been considered in previous work. By exploring the impact of time-of-use electricity prices on energy consumption and profits, a mixed integer programming model is established, and the correctness of the model is verified through small-scale examples. In addition, the present invention proposes an improved water circulation algorithm (IWCA) to improve the efficiency of model solving. The algorithm proposed in the present invention designs two-layer encoding, two-stage decoding, two position update methods and mutation operations based on the problem characteristics to efficiently solve the above mixed integer programming model. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments are briefly introduced below.
[0020] Figure 1 It is a bilateral local destruction disassembly line considering electrical restrictions and time-of-use electricity prices;
[0021] Figure 2 It is a schematic diagram of double-layer coding;
[0022] Figure 3 It is a schematic diagram of a two-point crossover operation;
[0023] Figure 4 It is a schematic diagram of the three-point crossover operation;
[0024] Figure 5 is a schematic diagram of mutation operation;
[0025] Figure 6 It is a three-dimensional picture of the product engine;
[0026] Figure 7 It is a box plot of multi-objective index evaluation when solving automobile engine with different algorithms;
[0027] Figure 8 There are four dismantling schemes for bilateral local damage dismantling considering electrical restrictions and time-of-use electricity prices. DETAILED DESCRIPTION
[0028] The present invention will be further described in detail below in conjunction with the embodiments and drawings.
[0029] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. The described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0030] Notation and description of decision variables:
[0031] Table 1 Symbols and decision variables description
[0032]
[0033]
[0034] In order to facilitate understanding of the meaning of the embodiments and other formulas in the subsequent parts of the application documents, a table of symbols and decision variables in Table 1 is provided hereby. Unless otherwise specified, the meanings of the symbols and decision variables described below that are the same as those in Table 1 are the same as those explained in Table 1.
[0035] The present invention will be further described below in conjunction with embodiments:
[0036] In the following embodiments, unless otherwise specified, the operations described are routine operations in the art.
[0037] A method for setting a bilateral local destruction disassembly line considering electrical restrictions and time-of-use electricity prices, the method comprising the following steps:
[0038] S1. Obtain basic information of disassembly tasks, including disassembly time under different disassembly modes, recycling value of tasks under different disassembly modes, unit power consumption of tasks under different disassembly modes, tools required for disassembly, feasibility value of destructive disassembly, priority relationship, and unit electricity cost under different seasons and time periods;
[0039] The present invention takes into account the impact of time-of-use electricity prices on the number of workstations, disassembly costs, and disassembly energy consumption, wherein each task can choose between two disassembly modes. Due to different disassembly modes, the disassembly time, recycling value, unit power consumption, and unit electricity cost of each task are different.
[0040] S2. Establish a multi-objective function for bilateral local destruction disassembly line, including the number of workstations, idle time equilibrium rate, disassembly profit considering time-of-use electricity price, and disassembly energy consumption considering different disassembly modes, and establish a corresponding mixed integer programming model; at the same time, establish the constraints of the model, including the disassembly direction, priority, disassembly mode, time, location and workstation of the task.
[0041] The objective function of the constructed model is as follows:
[0042] Minimize the number of workstations:
[0043] Minimize idle time balancing:
[0044] Disassembly profit indicators considering time-of-use electricity prices:
[0045]
[0046] Maximizing disassembly profits requires consideration of multiple factors, including disassembly income from different disassembly modes, electricity costs for performing disassembly tasks in different modes, electricity costs for opening workstations, and additional electricity costs for handling dangerous tasks.
[0047] Disassembly energy consumption indicators under different disassembly modes:
[0048]
[0049] The disassembly energy consumption indicators under different disassembly modes involve the power consumption of disassembly tasks, the additional energy consumption of handling dangerous tasks at the workstation, and the energy consumption of workstation operation.
[0050] In the formula, S k For workstation enable variables, if the kth workstation is enabled, then S k =1, otherwise S k =0; k is the workstation number, W is the workstation number set. CT is the cycle time; i is the disassembly task number; N is the disassembly task number set; l is the left and right index of the workstation, where l=1 means the left side and l=2 means the right side; L is the left and right side number set of the workstation; t i represents the disassembly time of task i; G i is the disassembly benefit of the task; E i is the unit electricity cost; E k is the fixed unit time cost of the workstation; The additional electricity cost incurred to handle dangerous tasks i; h i is the task hazard attribute variable. If task i is a dangerous task, then h i =1, otherwise h i =0;P i P is the power consumption per unit disassembly time; f is the fixed unit time power consumption of the workstation; P h The power consumption per unit time when processing additional tasks.
[0051] At the same time, the relevant constraints of the model are expressed as follows:
[0052] Assignment constraints for disassembly tasks:
[0053]
[0054] The above formula indicates that each task is assigned to a workstation
[0055]
[0056] The above formula indicates that the task needs to satisfy the disassembly direction constraint. 1 Indicates that the task is the set of tasks on the left, D 2 Indicates that the task is a collection of tasks on the right.
[0057] Disassembly mode constraints:
[0058]
[0059] The above formula indicates that only one disassembly mode can be selected for each task. Among them, r represents the disassembly mode, r = 1 represents non-destructive disassembly, and r = 2 represents destructive disassembly. is the task disassembly mode variable, the subscript i is the task number, the superscript r is the disassembly mode number, if the task i adopts r disassembly modes, then otherwise
[0060] {i∈DPe i >e max}
[0061]
[0062] The above two equations indicate that the destruction and disassembly mode can only be selected when the destruction and disassembly feasibility value of the task is greater than the set threshold. i represents the feasibility value of destruction and disassembly of task i, which is known; e max is the set threshold, which is usually 0.5; DP is the set of destruction tasks.
[0063]
[0064] The above formula indicates that for tasks that do not belong to the destruction task set, both disassembly modes can be selected, but only one disassembly mode can be selected.
[0065] {i∈NPh i +d i ≠0}
[0066]
[0067] The above formula indicates that dangerous tasks or tasks with demand can only choose non-destructive disassembly. i is the task hazard attribute variable. If task i is a dangerous task, then h i =1, otherwise h i =0;d i is the task requirement attribute variable. If task i is a demand task, then d i =1, otherwise d i =0; NP is the set of non-destructive tasks.
[0068] Relationship between disassembly time and recycling value, electricity cost, and disassembly mode:
[0069]
[0070] This constraint establishes a relationship between the disassembly time, benefit, and electricity cost of each task, depending on the disassembly mode used.
[0071] Workstation constraints:
[0072]
[0073] The above formula constrains the upper and lower bounds of the number of workstations. Where n is the total number of tasks
[0074]
[0075] The above formula means that when a task is assigned to a workstation, the workstation must be in the open state.
[0076] S k ≤S k-1 ,k∈{2,...,m}
[0077] The above constraints restrict workstations to be opened one by one.
[0078] Position-related constraints:
[0079]
[0080] The above formula shows that if task i and task j are assigned to the same workstation, they must occupy the same side of the workstation.
[0081]
[0082] The above formula shows that if task i and task j are assigned to the same side of the workstation, they cannot be located on different workstations:
[0083] Time-related constraints:
[0084]
[0085] The above formula indicates that the start time of all tasks must be greater than 0, ensuring that no task starts to execute before the production line starts running. i Indicates the start time of task i
[0086]
[0087] The above formula means that any task assigned to the back of another task must wait for the previous task to be completed before it can start to be disassembled.
[0088]
[0089] The above formula shows that if two tasks i and j are assigned to the same side of the same workstation, and task j is disassembled before task i, then task i must wait for task j to complete before starting execution.
[0090]
[0091] The above formula shows that all tasks must complete the disassembly work within the cycle time allocated to their workstations.
[0092]
[0093] The above formula shows that task i must wait for the task j that follows it to be disassembled before it can start, even if they are located on different sides of the same station. ij =[a ij ] n×n , task i is the immediate predecessor of task j, then a ij =1, otherwise a ij =0.
[0094] S3, based on the double-layer encoding method, two-stage decoding is performed, and then the initial solution is generated according to the Pareto elite strategy; the initial solution is optimized and updated by the improved water cycle algorithm, including: after the decoding is completed, the initial population is generated, the objective function is calculated, the ocean, river, and stream are divided, and the first generation of population is generated; then the ocean-river and river-stream position are updated; then the rainfall operation is performed; the child population is combined with the parent population to form a new generation of population and the above operations are repeated until the number of iterations meets the termination condition, and the optimal solution is selected as the final output through the hypervolume value (HV). Finally, the Pareto elite retention strategy is introduced to obtain the optimal plan and the optimal solution.
[0095] In order to elaborate on the encoding method in this paper, a 10-scale case is used for illustration. In the bilateral local destructive disassembly line problem considering electrical restrictions and time-of-use electricity prices, the destructive tasks and non-destructive tasks are random, and the disassembly time, electricity cost, and energy consumption under different disassembly modes are different. Random encoding is prone to produce infeasible solutions, thereby reducing the efficiency of the algorithm. Therefore, in order to ensure the uniqueness of the solution, a two-layer encoding based on task priority relationship and task attributes is designed. Figure 3 The figure below is a priority relationship diagram of 10 disassembly task example products. The numbers in the circles represent disassembly tasks, the symbols "h" and "d" represent hazard tasks and demand tasks respectively, and the arrows represent the disassembly priority relationship of the tasks. Double-layer encoding is performed based on the task priority relationship and task attributes. The encoding sequence v consists of a disassembly sequence v1 that meets the priority order and a disassembly pattern sequence v2, that is, v = [v1: v2]. The specific steps are as follows:
[0096] Step 1: According to Figure 2 The priority relationship graph in can construct the priority relationship matrix A ij =[a ij ] n×n If task i is the immediate predecessor of task j, then a ij =1, otherwise a ij =0.
[0097] Step 2: Select Priority Matrix A ijThe tasks listed as 0 in the table are used as the disassembly optional task set V. For example, tasks 1, 4, 5, 9, and 10 are selected to form a disassembly optional task set.
[0098] Step 3: Randomly select a task i in V and put it into the sequence v1, delete the row and column where task i is located, and update the set V;
[0099] Step 4: Randomly select the next disassembly task and put it into the disassembly sequence, repeat steps 2-4 until all disassembly tasks are assigned, and the obtained disassembly sequence v1 is the initial feasible solution that meets the disassembly priority relation, such as Figure 2 shown.
[0100] Step 5: Generate the corresponding disassembly mode sequence v2 according to the task sequence v1. If task i is a dangerous task or a demand task, select the non-destructive disassembly mode and set the corresponding v2 to 0. Figure 3 As shown, tasks 6, 7, and 9 are demand tasks, and task 8 is a dangerous task, so non-destructive disassembly is selected.
[0101] Step 6: ife i >e max , go to step 8, otherwise go to step 7.
[0102] Step 7: Randomly select a disassembly mode, such as destructive disassembly for task 5 and non-destructive disassembly for task 2.
[0103] Step 8: Set the disassembly mode of task i to 1. Figure 2 As shown, Task 10 and Task 3 choose to destroy and disassemble.
[0104] Step 9: Repeat 5-8 until all tasks in task sequence v1 are assigned disassembly patterns.
[0105] Step 10: Output v = [v1:v2].
[0106] After obtaining the disassembly task sequence and disassembly pattern sequence, it is necessary to allocate the tasks in the sequence to different workstations while satisfying the cycle time, disassembly direction, and disassembly pattern constraints. This paper adopts a decoding method based on disassembly pattern and disassembly direction. First, the disassembly time of the task is determined according to the disassembly pattern of the task, and then it is allocated to the workstation according to the disassembly direction of the task. Under the premise of satisfying the beat constraint, the tasks without direction constraints are allocated according to the principle of minimizing the number of workstations.
[0107] S4. Optimizing and updating the initial solution through the improved water cycle algorithm (IWCA) includes: after decoding is completed and the initial population is generated, the objective function is calculated, the ocean, river, and stream are divided, and the first generation population is generated; then the ocean-river and river-stream position are updated; then the rainfall operation is performed; the child population is combined with the parent population to form a new generation population and the above operation is repeated until the number of iterations meets the termination condition, and the optimal solution is selected as the final output through the hypervolume value (HV). The specific steps are as follows:
[0108] First, the problem parameters and algorithm parameters are set. The problem parameters include the preset cycle time CT, the disassembly cost (including the electricity cost of performing disassembly tasks in different modes, the electricity cost of opening the workstation, and the additional electricity cost of handling dangerous tasks); the algorithm parameters include the maximum number of iterations (MI), the population size (PN), the number of rivers (RN), and the local variation factor (L f )Number of external files N;
[0109] Secondly, the task disassembly sequence obtained through encoding and decoding is used as the first-generation individuals to construct the initial population, calculate the objective function, screen the non-dominated solutions and update the external archive WD to generate the first-generation population, and then select and determine the oceans, rivers, and streams based on the Pareto elite policy.
[0110] Subsequently, bilateral crossover is used between streams and rivers to represent the position update between streams and rivers. When a stream flows to a river, two random points r1 and r2 are generated on the stream. The task sequence between r1 and r2 is used as the crossover segment, and then mapped according to the corresponding disassembly task sequence on the river. The new river segment obtained after mapping will replace the corresponding river segment on the original river segment to form a new river segment. The specific position exchange process between streams and rivers is as follows: Figure 3 shown.
[0111] In addition, a three-point crossover is designed to represent the position exchange between the river and the sea. Three random variants c1, c2 and c3 are generated using random numbers to split the parent river and the sea into P1, P2, P3 and P4. Two river sections are randomly selected as the position information river sections. Except for these river sections, the other river sections maintain the sequence order of the parent river. Remove the disassembly tasks from the position information segment of the river, and then copy the task sequence of the corresponding position information segment in the parent sea area and insert it into the vacant position of the river to create a new location River new. Similarly, the new sea is generated in the same way. For a detailed description of this operation, see Figure 4 .
[0112] During the rain, new raindrops will form streams at different locations. To improve the accuracy and prevent convergence to the local optimum, we introduce a new local variation factor L fTo improve the evaporation method and rainfall process of the water cycle. First, generate a random number a. If a <L f , then perform mutation operation on the sequence, randomly select a task vk from the sequence v, find the task's immediate predecessor vk-1 and immediate successor vk+1, and randomly select a point between the two to insert task vk, replacing the previous vk position, thereby generating a new individual. Figure 5 shown.
[0113] Then, the updated population is combined with the initial population to form a new generation population, and the above operation is repeated and the solution set is updated until the number of iterations meets the termination condition. Finally, the optimal solution is selected as the final output through the hypervolume value (HV). HV (Hypervolume) refers to the spatial volume formed by the Pareto solution set obtained by the algorithm with the preset reference points distributed in the target space as the boundary.
[0114] In addition, the HV index, IGD index and SM index are introduced to evaluate the convergence and diversity of the algorithm. During the operation of the algorithm, when the HV value tends to be stable, the algorithm is considered to be in a convergent state. The larger the HV value, the larger the target space volume formed by the obtained solution, which proves that the diversity and quality of the Pareto solution set solved by the algorithm are better. The calculation formula of the HV index is: where λ represents the Lebesgue constant to measure the HV value; |S| refers to the number of solutions in the Pareto solution set; v i Represents the HV value of the i-th non-inferior solution and the reference point. The inverse generation distance (IGD) index is another key indicator, which reflects the average distance from each reference point to the ideal Pareto solution. The smaller the IGD value, the better the performance of the algorithm in terms of convergence and distribution. The calculation formula of the IGD indicator is: Where P represents the set of points uniformly distributed on the actual Pareto surface, and Q represents the optimal Pareto solution set obtained by the algorithm. d(v,Q) refers to the minimum Euclidean distance from individual v in P to group Q. In addition, we also introduce the spacing metric (SM), which quantifies the standard deviation of the minimum distance between each solution. The smaller the SM value, the better the uniformity of the solution set distribution. The calculation formula of the SM indicator is: Where, d i represents the minimum distance between the ith solution and all other solutions in P and all other solutions, while represents all d i The average of the values.
[0115] In order to further illustrate the effect of the present invention, specific examples are used to illustrate it below.
[0116] The following is the specific program test environment of this embodiment:
[0117] The simulation computing environment is Intel(R) Core(TM) i5-12400 CPU@2.50GHz, 16GB RAM Windows1164-bit., and MATLAB R2020b is used for programming and running.
[0118] In order to further verify the superiority of the proposed IWCA in solving this problem, the present invention selected four powerful algorithms including genetic simulated annealing algorithm (GASA), non-dominated sorting genetic algorithm (NSGA-II), grey wolf optimization algorithm (GWOA) and whale optimization algorithm (WOA) for comparative testing. A large and complex retired automobile engine is used as a disassembly case. The three-dimensional diagram and priority relationship diagram of the retired automobile engine are shown in Figure 1. Figure 6 As shown, there are 37 disassembly tasks in total. Figure 6 The names of the parts are shown in Table 2, which also gives the disassembly time, task attributes, electricity cost, power consumption, and destructive disassembly feasibility value of each task.
[0119]
[0120]
[0121] Each algorithm was run 10 times, and each run was stopped after 500 seconds. The best result was selected for comparison. Since each algorithm obtained dozens of Pareto solutions, 10 solutions were screened using the crowding distance, as shown in Table 3. The results of each group of algorithms were put together for unified comparison and it was found that the solution set of IWCA completely dominated the other four algorithms, which means that after the solution space becomes larger as the problem scale increases, other algorithms can no longer obtain better solutions in a short time. This proves that the invented IWCA has stronger search capabilities in a short time than NSGA-II, GASA, GWOA and WOA.
[0122] Table 3 Results of each algorithm for solving the retired automobile engine case
[0123]
[0124] To further test the performance of the algorithm, two multi-objective metrics, namely, Inverse Generation Distance (IGD) and Spacing Metric (SM), are introduced and used in conjunction with HV. Figure 7 The box plots of HV, IGD, and SM indices of the five algorithms are shown. Higher HV values indicate better convergence and diversity, while smaller IGD and SM values indicate better overall performance and more uniform distribution of solutions. The HV result values after convergence are shown in Figure 2. Figure 7As shown in the figure, that is, IWCA>GWOA>NSGA-II>WOA>GASA. The HV results show that the proposed IWCA has the best comprehensive performance in solving this case compared with the other four algorithms. GWOA is close to NSGA-II, while the performance of GASA is inferior to the other four algorithms.
[0125] In addition, IWCA also showed commendable overall performance and uniformity of solution distribution when evaluating multi-objective algorithms using IGD and SM metrics. Although the effectiveness of different algorithms may fluctuate depending on the metric used, IWCA consistently showed strong performance in all three evaluations.
[0126] Considering the different goal preferences of managers in different enterprises, four different solutions were selected from the Pareto solution set. Figure 8 As shown in the figure, red represents destructive tasks and green represents non-destructive tasks. In these solutions, red represents destructive tasks and green represents non-destructive tasks. Each solution adheres to constraints such as task priority, direction, and destructive disassembly feasibility. The diversity of solutions provides companies with the flexibility to make decisions based on their specific goals. For example, if the company prioritizes time efficiency, it may choose S2; if it mainly considers profit, S3 is more desirable; and for environmental considerations, S4 will be the best choice.
[0127] The above is only a preferred specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the embodiments of the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.
Claims
1. A bilateral local destruction disassembly line setting method considering electrical restrictions and time-of-use electricity prices, characterized in that: The following steps are involved: Step 1: Obtain basic information of the disassembly task, including the disassembly time under different disassembly modes, the recycling value of the task under different disassembly modes, the unit power consumption of the task under different disassembly modes, the tools required for disassembly, the feasibility value of destructive disassembly, the priority relationship, and the unit electricity cost under different seasons and time periods; Step 2: Establish a multi-objective function for bilateral local destruction disassembly lines, including the number of workstations, idle time equilibrium rate, disassembly profit considering time-of-use electricity prices, and disassembly energy consumption considering different disassembly modes, and establish a corresponding mixed integer programming model; at the same time, establish the constraints of the model, including the disassembly direction, priority, disassembly mode, time, location, and workstation constraints of the task. Step 3: Solve the mixed integer programming model.
2. The method for setting up a bilateral local destruction and disassembly line considering electrical restrictions and time-of-use electricity prices as described in claim 1 is characterized in that: The objective function of the model constructed in step 2 is as follows: Minimize the number of workstations: Minimize idle time balancing: Disassembly profit indicator: Disassembly energy consumption index: In the formula, S k For workstation enable variables, if the kth workstation is enabled, then S k =1, otherwise S k =0; k is the workstation number; CT is the cycle time; i is the disassembly task number; N is the disassembly task number set; l is the left and right index of the workstation, where l=1 means the left side and l=2 means the right side; L is the left and right index set of the workstation; t i represents the disassembly time of task i; G i is the disassembly income of the task; E i is the electricity cost per unit time; E k is the fixed unit time cost of the workstation; The additional electricity cost incurred to handle dangerous tasks i; h i is the task hazard attribute variable. If task i is a dangerous task, then h i =1, otherwise h i =0;P i P is the power consumption per unit disassembly time; f is the fixed unit time power consumption of the workstation; P h The power consumption per unit time when processing additional tasks; The variables for assigning tasks to both sides of a workstation. The first bracket of the subscript is the task number, the second bracket of the subscript is the workstation number, and the superscript bracket is the left and right index of the workstation. If the task in the first bracket of the subscript is assigned to the side of the workstation in the first bracket of the subscript, then otherwise t i represents the disassembly time of task i; M is the set of workstations.
3. The method for setting up a bilateral local destruction and disassembly line considering electrical restrictions and time-of-use electricity prices as described in claim 2 is characterized in that: The constraints of the mixed integer programming model include: Disassembly direction constraint: D 1 Indicates that the task is the set of tasks on the left, D 2 Indicates that the task is a set of tasks on the right; Relationship between disassembly time and recycling value, electricity cost and disassembly mode: is the task disassembly mode variable. If task i adopts r disassembly modes, then otherwise r represents the disassembly mode, r = 1 for non-destructive disassembly, r = 2 for destructive disassembly; t i 0 is the disassembly time of task i when non-destructive disassembly is adopted; t i 1 E is the disassembly time when task i is disassembled by destruction; is 0 is the electricity cost per unit time of the processing operation when task i uses non-destructive disassembly in scenario s; E is 1 P is the electricity cost per unit time of the processing operation when task i uses destruction and disassembly in scenario s; i 0 P is the power consumption per unit disassembly time when non-destructive disassembly is used for task i; i 1 The power consumption per unit disassembly time when destructive disassembly is used for task i; Disassembly mode constraints: And i >and max ,i∈DP h i +d i ≠0,i∈NP e i is the destructive disassembly feasibility value of task i; e max is the feasibility threshold of destructive disassembly of task i; DP is the set of destructive tasks; h i is the task hazard attribute variable. If task i is a dangerous task, then h i =1, otherwise h i =0;d i is the task requirement attribute variable. If task i is a required task, then d i =1, otherwise d i =0; NP is the set of non-destructive tasks; Workstation constraints: n is the number of disassembly tasks; S k ≤S k-1 ,k∈{2,...,m} m is the number of workstations; is a judgment function. The first bracket of the subscript is the task number of the first task, the second bracket is the task number of the second task, the third bracket is the workstation number, and the superscript bracket is the index of the left and right sides of the workstation. When the first and second tasks are both assigned to the l side of the workstation and the first task is removed before the second task, then otherwise, w (*) is the start disassembly time of a task, and the task number is in the subscript brackets; M is a maximum value; Where A ij =[a ij ] n×n , task i is the immediate predecessor of task j, then a ij =1, otherwise a ij =0; t j represents the disassembly time of task j.
4. The method according to claim 1, characterized in that Step 3 includes: S31, two-stage decoding based on double-layer coding method, and then generate initial solution according to Pareto elite strategy; S32. The initial solution is optimized and updated by improving the water cycle algorithm, and the Pareto elite retention strategy is introduced to obtain the optimal plan and solution.
5. The method according to claim 4, characterized in that The method of optimizing and updating the initial solution by improving the water cycle algorithm includes: after the decoding is completed and the initial population is generated, the objective function is calculated, the ocean, rivers, and streams are divided, and the first generation population is generated; then the ocean-river and river-stream position are updated; then a rainfall operation is performed; the child population is combined with the parent population to form a new generation population, the objective function is recalculated, the ocean, rivers, and streams are divided, and the second generation population is generated; then the ocean-river and river-stream position are updated; then a rainfall operation is performed; the updating and rainfall operations are repeated until the number of iterations meets the termination condition, and the optimal solution is screened out as the final output through the hypervolume value.
Citation Information
Patent Citations
Sparse antenna array low sidelobe comprehensive optimization method based on improved water circulation algorithm
CN111143983A
Man-machine cooperation disassembly line setting method considering different operation scenes
CN116663806A
Human-computer interaction constraint bilateral disassembly line setting method
CN116702624A
Decommissioned mechanical and electrical product bilateral disassembly line task planning method
CN116976228A
Local failure disassembly line adaptive planning method considering feasibility and noise
CN117455027A
Cited By
Mixed linear local damage disassembly optimization method for recycling of multiple retired products
CN120197763A
