Hydraulic pump test task scheduling management optimization method based on IGA
By applying genetic algorithms and double-layer coding rules in experimental task scheduling, the scheduling of experimental tasks is optimized, and the problem of inefficient manual scheduling is solved, and the intelligent scheduling of experimental tasks and efficient equipment utilization is realized.
Patent Information
- Application Number
- CN202410728784.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-06
- Publication Date
- 2024-11-08
AI Technical Summary
In the prior art, test task scheduling mainly relies on manual scheduling, which is prone to incomplete consideration, wrong judgment, and missed judgment, resulting in delays in construction periods and inefficiency.
Using a genetic algorithm (IGA)-based experimental task scheduling and management method, through two-layer coding rules and elite retention strategies, the maximum completion time of the experimental task is optimized, manual intervention and misjudgment are reduced, and the efficient utilization of the experimental equipment is improved.
It realizes intelligent scheduling of experimental tasks, reduces manual error rate, improves test efficiency and equipment utilization rate, and avoids the problems of local optimal solutions and slow iteration.
Smart Images

Figure CN118917569A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to an IGA-based hydraulic pump test task scheduling management optimization method, belonging to the technical field of computer processing. Background Art
[0002] At present, the test scheduling of most enterprises is completely carried out manually by dispatchers, which often leads to incomplete considerations and secondary rework, resulting in delays in construction and delivery. In addition, it is very easy for workers to misjudge the scheduling of test tasks due to fatigue, bad mood, etc., affecting the production progress and benefits of the enterprise.
[0003] Since it is completely based on human thinking and decision-making, once the test schedule is tight and the task volume is heavy, misjudgment, missed judgment, and incomplete consideration will frequently occur. Through the analysis of the above problems, it is extremely important to add scientific scheduling algorithms to task scheduling in order to achieve the purpose of improving test efficiency and efficient use of test equipment. Summary of the invention
[0004] Purpose of the invention: In view of the problems existing in the prior art, the present invention provides an optimization method for scheduling and managing test tasks of an IGA hydraulic pump to solve the problems raised in the above-mentioned background technology and improve the corresponding automation and intelligent process.
[0005] To achieve the above object, the present invention provides the following technical solution: a method for optimizing the scheduling management of hydraulic pump test tasks based on IGA, applied to the set of the number of samples to be tested in the test task J = {J1, J2, ..., ..., J n}、The process set O of any sample i i = {O i1 ,O i2 ,…,…,O ij} and the set of the number of devices participating in the test M = {M1,M2,…,…,M m}, the genetic algorithm IGA is used to obtain the minimum maximum completion time of the test task, which includes the following steps:
[0006] Step 1: Set the basic parameters of the genetic algorithm: Population size size , crossover probability P c range, maximum number of iterations MaxGen, mutation probability P m , set the minimum and maximum completion time values of the termination condition, and set the current iteration number Gen to 0;
[0007] Step 2: limit the number of individuals in the initial population according to the popSize given in step 1, generate the initial population by random initialization method based on the double-layer coding rule, and guide the initial population to evolve in the optimization direction by using the restriction operator; wherein the chromosomes of the individuals in the initial population include two gene strings, namely the process sorting layer OS and the equipment allocation layer MA;
[0008] Step 3: Input the initial population into the experimental task scheduling model, obtain the minimized maximum completion time of all individuals, calculate the fitness of all individuals, and select the chromosomes of the next generation through the roulette method according to the fitness;
[0009] Step 4: Perform crossover and mutation operations on the selected chromosomes and check them with restriction operators to obtain the next generation population;
[0010] Step 5: Extract the optimal chromosome in the next generation population, and add 1 to Gen to determine whether the minimized maximum completion time of the optimal chromosome meets the termination condition, or whether Gen is MaxGen. If so, output the minimized maximum completion time of the optimal chromosome and the corresponding pre-scheduling Gantt chart, and the algorithm ends; if not, adopt the elite retention strategy to retain the optimal chromosome, and then extract a new initial population from the remaining individuals in the next generation population according to the fitness size, and jump to step 3.
[0011] Furthermore, in step 2, the two gene strings are of equal length, and the gene string length is the sum of the number of all processes of all samples, and are connected in the form of [OS, MA] at the first digit. The OS layer adopts a coding rule based on the process sequence, and the MA layer adopts a coding rule based on the relative equipment number.
[0012] Furthermore, in step 3, in the test scheduling model, the objective function and constraints constructed with the optimization goal of minimizing the maximum completion time of the test task are as follows:
[0013] F(x)=minC max =min{C i ,i=1,2,…,|I|} (1)
[0014]
[0015] Formula (1) is the objective function of the problem, which defines the minimum maximum test task completion time when solving the problem; Formula (2) defines that the sum of the start time and test time of a process of the sample on the equipment is not greater than the completion time of the process; Formula (3) defines that the completion time of a process of the sample must be less than or equal to the start time of the next process; Formula (4) defines that the processing time of any sample must be less than or equal to the maximum completion time; Formula (5) defines that the start time and completion time of the sample test are non-negative, and any sample can be started from time 0; Formula (6) defines that a process of the sample at a certain time can only be tested by one device; Formula (7) defines the execution order of the sample process;
[0016] Where i represents the workpiece number, I represents the sample set, ij represents the process number of sample i, IJ represents the process set of sample i, k represents the test equipment number, K represents the test equipment set, m represents the total number of equipment, M represents the available equipment set, and C i represents the completion time of sample i, C' i represents the completion time of sample i when a disturbance event occurs, C max represents the maximum completion time of the same batch of samples, C max ' represents the maximum completion time of the same batch of samples when a disturbance event occurs, O ij represents the jth process of sample i, S ijk Indicates O ij The start time on device k, C ijk Indicates O ij Completion time on device k, T ijk Indicates O ij Test time on device k, X ijk If O ij Assigned to device k, then X ijk =1, otherwise X ijk =0.
[0017] Furthermore, in step 3, the formula for calculating the fitness Fit of all individuals is as follows:
[0018]
[0019] Among them, g represents the current iteration number of the algorithm; p represents the sorting number of the chromosome in the population; C max Indicates the maximum completion time.
[0020] Furthermore, the elite retention strategy in step 5 is as follows: the optimal chromosome generated in the Gen iteration is retained and directly passed to the next generation population of step 4 of the Gen+1 generation to avoid being destroyed during the selection, crossover and mutation process of the Gen+1 generation.
[0021] Furthermore, in step 4, the calculation formulas for the crossover probability and the mutation probability are the same. Here, the calculation formula for the mutation probability is listed:
[0022]
[0023] Among them, P m represents the mutation probability, P m0 represents the minimum mutation probability, Gen represents the current number of iterations, and I max is the maximum number of iterations.
[0024] Furthermore, the minimum maximum completion time value of the termination condition is set manually.
[0025] Compared with the prior art, the present invention has the following beneficial effects:
[0026] 1. Intelligent scheduling of test tasks is achieved through algorithms, which reduces manual intervention and effectively reduces the frequent misjudgments, missed judgments, and incomplete considerations of manual scheduling when the test schedule is tight and the task volume is heavy, thereby improving test efficiency and efficient use of test equipment.
[0027] 2. Adopt the elite retention strategy to retain the optimal chromosome in the iteration process, so that it does not participate in the selection, crossover, and mutation operations of the population, and is directly passed to the next generation, so that the optimal chromosome will not be destroyed during the selection, crossover, and mutation process.
[0028] 3. In order to further obtain the global optimal solution, the random population generation method is used to increase the diversity of the initial population to address the shortcomings of the native GA, such as difficulty in escaping the local optimal solution and slow iteration, so as to avoid the iteration process from falling into the local optimal solution. The mutation operation introduces chromosome mutation and adjusts the mutation probability to ensure a certain quality of the population during the iteration process, thereby increasing the iteration speed and further avoiding the algorithm from falling into premature maturity. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] In order to more clearly illustrate the technical solutions implemented in the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0030] Figure 1 It is a flow chart of the IGA hydraulic pump test task scheduling method in the present invention;
[0031] Figure 2 This is a schematic diagram of the chromosome encoding method in the present invention;
[0032] Figure 3 This is a schematic diagram of the chromosome crossover operation in the present invention;
[0033] Figure 4 This is a schematic diagram of the chromosome mutation operation in the present invention;
[0034] Figure 5 This is the optimal scheduling Gantt chart obtained from the test task example in the present invention. DETAILED DESCRIPTION
[0035] The preferred embodiments of the present invention will be described below in conjunction with the accompanying drawings to more clearly and completely illustrate the technical solution of the present invention. Obviously, the described embodiments are only 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.
[0036] See also Figure 1-5 In an embodiment of the present invention, a method for optimizing the scheduling management of hydraulic pump test tasks based on IGA is provided. According to the test tasks, a data set of multiple related elements is established, including a set of the number of samples to be tested J = {J1, J2, ..., ..., J n}、The process set O of any sample i i = {O i1 ,O i2 ,…,…,O ij} and the set of the number of devices participating in the test M = {M1,M2,…,…,M m}, the specific process steps are as follows Figure 1 As shown, the following steps are included:
[0037] Step 1: Set the basic parameters of the genetic algorithm: Population size size , crossover probability P c Range, maximum number of iterations MaxGen, mutation probability P m Range, set the minimum and maximum completion time values of the termination condition, and set the current iteration number Gen to 0, as shown in Table 1.
[0038] Table 1 Basic parameter design of the algorithm
[0039]
[0040]
[0041] Step 2: According to the popSize given in step 1, the number of individuals in the initial population is limited. Based on the double-layer coding rule, the initial population is generated by random initialization method, and the constraint operator is used to constrain the proofreading to evolve in the optimization direction. Among them, the essence of chromosome encoding is a dimensionality reduction operation. It is a double-layer encoding method designed based on the multi-parameter cascade method, that is, a chromosome consists of two gene strings, namely the operation sequencing layer (OS) and the machine allocation layer (MA), which are used to record the sample and its process sequence and the allocation information of the test equipment. The length of the gene string is the sum of the number of all processes of all samples. The two gene strings are equal in length and are connected in the form of [OS, MA]. Different coding rules are adopted according to the characteristics of the corresponding levels. The OS layer adopts the coding rule based on the process sequence, while the MA layer adopts the coding rule based on the relative equipment number coding.
[0042] Step 3: Input the initial population in step 2 into the experimental task scheduling model, obtain the minimized maximum completion time of all individuals, calculate the fitness of all individuals, and select the next generation of chromosomes through the elite retention strategy and roulette method according to the fitness size.
[0043] The objective function and constraints constructed in the test task scheduling model with the optimization goal of minimizing the maximum completion time of the test task are as follows: Formula (1) is the objective function of the problem, which defines the minimized maximum test task completion time when solving the problem; Formula (2) defines that the sum of the start time and test time of a certain process of the sample on the equipment is not greater than the completion time of the process; Formula (3) defines that the completion time of a certain process of the sample must be less than or equal to the start time of the next process; Formula (4) defines that the processing time of any sample must be less than or equal to the maximum completion time; Formula (5) defines that the start time and completion time of the sample test are non-negative, and any sample can be started from time 0; Formula (6) defines that a certain process of the sample at a certain time can only be tested by one device; Formula (7) defines the execution order of the sample process;
[0044] F(x)=minC max =min{C i ,i=1,2,…,|I|} (1)
[0045]
[0046]
[0047] In the formula, i represents the workpiece number, I represents the sample set, ij represents the process number of sample i, IJ represents the process set of sample i, k represents the test equipment number, K represents the test equipment set, m represents the total number of equipment, M represents the available equipment set, and C i represents the completion time of sample i, C' i represents the completion time of sample i when a disturbance event occurs, C max represents the maximum completion time of the same batch of samples, C max ' represents the maximum completion time of the same batch of samples when a disturbance event occurs, O ij represents the jth process of sample i, S ijk Indicates O ij The start time on device k, C ijk Indicates O ij Completion time on device k, T ijk Indicates O ij Test time on device k, X ijk If O ij Assigned to device k, then X ijk =1, otherwise X ijk =0.
[0048] The screening population selects more outstanding individuals, and the function defined to measure individual fitness is called the fitness function. Furthermore, the population will approach the optimal solution or near-optimal solution driven by high fitness, but an overly complex fitness function will affect the iteration or calculation speed of the algorithm. Therefore, when the fitness function has a certain guiding ability, the simpler the fitness function, the more conducive to calculation or improving iteration efficiency. In the test task scheduling problem solved in this embodiment, minimizing the maximum completion time is selected as the objective function, so the fitness function takes the inverse of the objective function. The formula for calculating fitness Fit is as follows:
[0049]
[0050] Among them, g represents the current iteration number of the algorithm; p represents the sorting number of the chromosome in the population; C max Indicates the maximum completion time.
[0051] Step 4: Perform crossover and mutation operations on the selected chromosomes, use dynamic mutation rate to adaptively adjust the crossover and mutation probabilities, and then constrain and check them with restriction operators to obtain the next generation population.
[0052] Among them, crossover operation: Considering the process sequence constraints of the OS layer, it is necessary to cross the OS layer and the MA layer separately. The OS layer adopts the process priority crossover scheme (Improved Precedence Operation Crossover, IPOX), while the MA layer adopts the multi-point crossover scheme (Multi Based Crossover, MPX). Figure 3 As shown in the figure; Mutation operation: Because the chromosome as a whole adopts double-layer encoding, the mutation operation still needs to separate the OS layer and MA layer of the parent chromosome and perform mutation operations separately, just like the crossover operation. For the OS layer, the chromosome fragments are subjected to random reverse mutation (RRM), and for the MA layer, the chromosome fragments are subjected to bit random mutation (BRM). The mutation operation example is shown in the figure. Figure 4 shown.
[0053] The adaptive adjustment using dynamic mutation rate is as follows:
[0054]
[0055] Where P m represents the mutation probability, P m0 represents the minimum mutation probability, Gen represents the current number of iterations, and I max is the maximum number of iterations. In addition, the crossover probability is the same as the mutation probability, so I will not go into details.
[0056] Step 5: Extract the optimal chromosome in the next generation population, and add 1 to Gen to determine whether the minimized maximum completion time of the optimal chromosome is less than or equal to the termination condition, or whether Gen is MaxGen. If so, output the minimized maximum completion time of the optimal chromosome and the pre-scheduling Gantt chart; if not, adopt an elite retention strategy for the optimal chromosome, re-sort the remaining individuals of the next generation population according to fitness, select a new initial population from best to worst, and jump to step 3.
[0057] The elite retention strategy is adopted to retain the optimal chromosome in the iteration process, so that it does not participate in the selection, crossover and mutation operations of the population, and is directly passed to the next generation population of Gen plus 1, so that the optimal chromosome will not be destroyed during the selection, crossover and mutation process.
[0058] The test calculation examples used in the present invention are shown in Table 2:
[0059] Table 2 Example data set
[0060]
[0061]
[0062] Figure 5 This is the optimal scheduling Gantt chart obtained from the test task example in this embodiment. Figure 5 As shown in Figure 3, an optimal pre-scheduling scheme for the 8×6 instance of 8 samples on 8 test benches obtained by IGA without any abnormality occurs, and its minimized maximum completion time is 38 hours.
[0063] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.
[0064] In addition, it should be understood that although the present specification is described according to implementation modes, not every implementation mode contains only one independent technical solution. This description of the specification is only for the sake of clarity. Those skilled in the art should regard the specification as a whole. The technical solutions in each embodiment may also be appropriately combined to form other implementation modes that can be understood by those skilled in the art.
Claims
1. A method for optimizing the scheduling and management of hydraulic pump test tasks based on IGA, applied to the set of the number of samples to be tested in the test task J = {J1, J2, ..., ..., J n }、The process set O of any sample i i = {O i1 , Oi2, ..., ..., O ij } and the set of the number of devices participating in the test M = {M1, M2, ..., ..., M m }, the minimum maximum completion time of the test task is obtained by using the genetic algorithm IGA, which is characterized by: The steps include: Step 1: Set the basic parameters of the genetic algorithm: Population size size , crossover probability P c , maximum number of iterations MaxGen, mutation probability P m , set the minimum and maximum completion time values of the termination condition, and set the current number of iterations Gen to 0; Step 2: limit the number of individuals in the initial population according to the popSize given in step 1, generate the initial population by random initialization method based on the double-layer coding rule, and guide the initial population to evolve in the optimization direction by using the restriction operator; wherein the chromosomes of the individuals in the initial population include two gene strings, namely the process sorting layer OS and the equipment allocation layer MA; Step 3: Input the initial population into the experimental task scheduling model, obtain the minimized maximum completion time of all individuals, calculate the fitness of all individuals, and select the chromosomes of the next generation through the roulette method according to the fitness; Step 4: Perform crossover and mutation operations on the selected chromosomes and check them with restriction operators to obtain the next generation population; Step 5: Extract the optimal chromosome in the next generation population, and add 1 to Gen to determine whether the minimized maximum completion time of the optimal chromosome meets the termination condition, or whether Gen is MaxGen. If so, output the minimized maximum completion time of the optimal chromosome and the corresponding pre-scheduling Gantt chart, and the algorithm ends; if not, adopt the elite retention strategy to retain the optimal chromosome, and then extract a new initial population from the remaining individuals in the next generation population according to the fitness size, and jump to step 3.
2. The IGA hydraulic pump test task scheduling management optimization method according to claim 1 is characterized in that: In step 2, the two gene strings are of equal length, which is the sum of the number of all processes of all samples, and are connected in the form of [OS, MA]. The OS layer adopts a coding rule based on the process sequence, and the MA layer adopts a coding rule based on the relative equipment number.
3. The IGA-based hydraulic pump test task scheduling management optimization method according to claim 1 is characterized by: In step 3, in the test scheduling model, the objective function and constraints constructed with the optimization goal of minimizing the maximum completion time of the test task are as follows: F(x)=minC max =min{C i ,i=1,2,...,|I|} (1) Formula (1) is the objective function of the problem, which defines the minimum maximum test task completion time when solving the problem; Formula (2) defines that the sum of the start time and test time of a process of the sample on the equipment is not greater than the completion time of the process; Formula (3) defines that the completion time of a process of the sample must be less than or equal to the start time of the next process; Formula (4) defines that the processing time of any sample must be less than or equal to the maximum completion time; Formula (5) defines that the start time and completion time of the sample test are non-negative, and any sample can be started from time 0; Formula (6) defines that a process of the sample at a certain time can only be tested by one device; Formula (7) defines the execution order of the sample process; Where i represents the workpiece number, I represents the sample set, ij represents the process number of sample i, IJ represents the process set of sample i, k represents the test equipment number, K represents the test equipment set, m represents the total number of equipment, M represents the available equipment set, and C i represents the completion time of sample i, C′ i represents the completion time of sample i when a disturbance event occurs, C max represents the maximum completion time of the same batch of samples, C max ′ represents the maximum completion time of the same batch of samples when a disturbance event occurs, O ij represents the jth process of sample i, S ith Indicates O ij The start time on device k, C ijk Indicates O ij Completion time on device k, T ijk Indicates O ij Test time on device k, X ijk If O ij Assigned to device k, then X ijk =1, otherwise X ijk =0.
4. The IGA-based hydraulic pump test task scheduling management optimization method according to claim 1 is characterized by: In step 3, the formula for calculating the fitness Fit of all individuals is as follows: Among them, g represents the current iteration number of the algorithm; p represents the sorting number of the chromosome in the population; C max Indicates the maximum completion time.
5. The method for optimizing the scheduling and management of hydraulic pump test tasks based on IGA according to claim 1 is characterized in that: The elite retention strategy in step 5 is as follows: the optimal chromosome generated in the Gen iteration is retained and directly passed to the next generation population of step 4 in the Gen+1 generation to avoid being destroyed during the selection, crossover and mutation process in the Gen+1 generation.
6. The method for optimizing the scheduling and management of hydraulic pump test tasks based on IGA according to claim 1 is characterized in that: In step 4, the calculation formulas for the crossover probability and the mutation probability are the same. Here, the calculation formula for the mutation probability is listed: Among them, P m represents the mutation probability, P mo represents the minimum mutation probability, Gen represents the current number of iterations, and I max is the maximum number of iterations.
7. The method for optimizing the scheduling and management of hydraulic pump test tasks based on IGA according to claim 1 is characterized in that: The minimum maximum completion time value of the termination condition is set manually.
Citation Information
Patent Citations
Printing and binding job scheduling optimization method based on genetic algorithm
CN111985647A
Device test resource overall allocation method based on chaos genetic algorithm
CN113987936A
Flexible job shop scheduling method based on improved particle swarm genetic hybrid algorithm
CN114493337A
Quality inspection task scheduling method and device based on genetic algorithm and medium
CN115758761A
Workshop scheduling method for improving genetic algorithm to meet single-task completion time constraint
CN117745026A
