CN110991056A - Airplane assembly line operation scheduling method based on genetic variation neighborhood algorithm - Google Patents
Airplane assembly line operation scheduling method based on genetic variation neighborhood algorithm Download PDFInfo
- Publication number
- CN110991056A CN110991056A CN201911247383.1A CN201911247383A CN110991056A CN 110991056 A CN110991056 A CN 110991056A CN 201911247383 A CN201911247383 A CN 201911247383A CN 110991056 A CN110991056 A CN 110991056A
- Authority
- CN
- China
- Prior art keywords
- activity
- neighborhood
- activities
- solution
- assembly line
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 230000007614 genetic variation Effects 0.000 title claims abstract description 13
- 230000002068 genetic effect Effects 0.000 claims abstract description 11
- 238000010276 construction Methods 0.000 claims abstract description 8
- 238000005457 optimization Methods 0.000 claims abstract description 5
- 238000013178 mathematical model Methods 0.000 claims abstract description 4
- 230000000694 effects Effects 0.000 claims description 89
- 108090000623 proteins and genes Proteins 0.000 claims description 11
- 230000035772 mutation Effects 0.000 claims description 9
- 210000000349 chromosome Anatomy 0.000 claims description 4
- 235000006679 Mentha X verticillata Nutrition 0.000 claims description 2
- 235000002899 Mentha suaveolens Nutrition 0.000 claims description 2
- 235000001636 Mentha x rotundifolia Nutrition 0.000 claims description 2
- 238000011423 initialization method Methods 0.000 abstract description 2
- 238000004519 manufacturing process Methods 0.000 abstract 1
- 238000004364 calculation method Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 3
- 238000002922 simulated annealing Methods 0.000 description 3
- 238000002474 experimental method Methods 0.000 description 2
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 description 1
- 230000000875 corresponding effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Life Sciences & Earth Sciences (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Biophysics (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Computational Biology (AREA)
- General Health & Medical Sciences (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Primary Health Care (AREA)
- Biodiversity & Conservation Biology (AREA)
- Manufacturing & Machinery (AREA)
- Physiology (AREA)
- Genetics & Genomics (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- General Factory Administration (AREA)
Abstract
The invention discloses an aircraft assembly line operation scheduling method based on a genetic variation neighborhood algorithm, which comprises the steps of firstly establishing a resource-limited aircraft assembly line operation scheduling model, and converting an operation scheduling problem in actual production into a mathematical model problem for optimization solution; secondly, constructing a subsection operation scheduling model of the airplane assembly line by taking the total construction period of the minimized assembly operation as an optimization target and simultaneously considering the tight front and back constraint, the resource constraint and the space constraint; and finally, solving by adopting an improved genetic variation neighborhood algorithm. The invention designs a group initialization method combined with priority rules to reduce solution space, and adopts a variable neighborhood local search mode combined with an acceptance threshold value to construct three neighborhood structures considering the relationship between the front and the back to ensure that a legal solution is generated in the search process, so as to improve the search capability and avoid the traditional genetic algorithm from falling into local optimum; the scheduling scheme of the aircraft assembly line operation obtained by the method can effectively shorten the total construction period of the assembly operation.
Description
Technical Field
The invention belongs to the field of operation scheduling of an airplane assembly line operation workshop under the condition of limited resources and space, and particularly relates to an airplane assembly line operation scheduling method based on a genetic variation neighborhood algorithm.
Background
The aircraft assembly has the characteristics of large operation quantity, complex assembly relation and the like, and the space for accommodating resources in the section areas such as a cockpit is limited, so the operation Scheduling Problem of the aircraft assembly line can be regarded as a Resource Constrained Project Scheduling Problem (RCPSP) with special space constraint, and the Problem is proved to be a complex strong NP-hard Problem.
From the solution point of view, the algorithms for solving RCPSP and its extended problem can be divided into three major categories: precision algorithms, heuristics and meta-heuristics (smart algorithms), wherein precision algorithms, while yielding theoretically optimal solutions, are only suitable for small scale solutions, whereby approximation algorithms are beginning to be applied to solve large scale RCPSP problems. Since the 1963 scheduling generation scheme is proposed, various heuristic algorithms are successively applied to the problem, but the heuristic algorithms have no optimization capability and are often influenced by the problem and cannot obtain a satisfactory solution. The application of meta-heuristic algorithms and intelligent algorithms makes the problem solving new developments, such as introducing Simulated Annealing (SA) in local search to solve RCPSP, evolutionary algorithms (e.g. Genetic Algorithm, GA) and population intelligent algorithms (e.g. Ant colony optimization, ACO) are widely applied to solve RCPSP problems.
The scheduling problem of the airplane assembly line belongs to the expansion problem of the traditional RCPSP, wherein operation activities are restricted by the tight front and the tight back and resources, and in some sections of the airplane, a plurality of parallel activities meeting the resources can not be performed simultaneously due to space limitation, so that the complexity of problem space and calculation and solution is increased. Aiming at the complexity of the problems, the meta-heuristic algorithm is mixed to make up the defects of the respective algorithms, so that the method becomes a new method for solving the problems, the efficiency of solving the problems is improved through algorithm mixing, and meanwhile, a more accurate solution can be obtained in a global range.
Disclosure of Invention
In order to overcome the defects of the prior art in solving the problem of scheduling of the aircraft assembly line, the invention provides an aircraft assembly line operation scheduling method based on a genetic variation neighborhood algorithm.
The invention discloses an aircraft assembly line operation scheduling method based on a genetic variation neighborhood algorithm, which comprises the following specific steps of:
step 1: setting relevant parameters of airplane assembly line operation scheduling
Setting an aircraft assembly operation project as a activity set J; j ═ 0,1,2, …, n +1, where activities 0 and n +1 are virtual activities, representing only the beginning and end of the item, and not taking up time and resources; for immediate preceding action set P of Activity jjJ ∈ J denotes a set of operations immediately after J is set with SjRepresents; t is tjIndicates the duration of the activity j, stjRepresents the job start time of activity j; define M as a set of segments, M ═ {1,2, …, z }, M ∈ M as a segment number, z is a positive integer, CmRepresenting the active set in section m, ejRepresenting the space occupation of the job activity j, the maximum space capacity of each section being Nm；R＝{r1,r2,…,rq,…,rkDenotes the set of k resources in the assembly process, denoted by rjqRepresenting the demand of activity j for the qth resource unit time, bqIs the maximum supply of the resource q per unit time; discretizing time, wherein d is a discrete time node {1,2, …, T } and T represents assemblyTotal period of operation, Ad＝{j|stj<d≤stj+tjThe set of job activities being executed at time d.
Step 2: establishing a mathematical model for optimizing the operation scheduling target of the airplane assembly line, wherein the target function is as follows:
minT＝stn+1(1)
namely solving the total construction period of the minimum assembly operation, the constraint is as follows:
t0＝tn+1＝0 (5)
r0q＝r(n+1)q＝0,q＝1,2,...,k (6)
wherein, the formula (2) is a decision variable; equation (3) indicates that each job activity must be completed for its specified duration; equation (4) indicates that activity j, once started, cannot be interrupted until completion; equations (5) and (6) indicate that the duration and resource demand of virtual activities 0 and n +1 are both 0; equation (7) is a constraint that immediately precedes and follows the activity, and activity j must begin only after all activities immediately precede and follow it; equation (8) is a resource constraint, and the demand of all activities being executed at time d on a certain resource is not more than the maximum supply of the resource per unit time; equation (9) is the space constraint for each segment, and the demand for space for all activities being performed in segment m at time d is not greater than the maximum space capacity of segment m.
And step 3: the genetic variable neighborhood algorithm is optimized and solved, because the genetic algorithm has the defect of being easy to fall into local optimum, the method designs a variable neighborhood algorithm combined with a receiving threshold value to carry out local search, and designs a cross strategy, a variation strategy and three neighborhood structures generating legal solutions to ensure the algorithm to carry out and improve the search capability, a specific algorithm flow chart is shown in figure 1, and the method comprises the following steps:
3.1 setting parameters: setting the maximum generation times as maxGen; population size popSize; cross probability of Pc(ii) a The mutation probability is Pm。
3.2 population initialization: the popSize chromosomes are generated by integer coding, and the immediate before and after relationship of each activity is considered, for example, the chromosome a ═ (0,1,2, …, n +1) contains n +2 activities together, where 0 and n +1 represent the virtual activities of beginning and end, and 1,2, …, n represents the scheduling order of the activities and satisfies the immediate before and after relationship. Considering that the solution target is the minimized project construction period, a priority rule (the adopted priority rule is EDDF or MINLFT, so that the quality of the initial solution is improved, and the solution space is reduced) is firstly adopted to initialize part of individuals, and the other individuals are randomly initialized to improve the diversity of the initial population.
3.3 calculating an individual Fitness value, selecting a coefficient C multiplied by the reciprocal 1/T of the target function as a Fitness function, namely Fitness ═ C/T, judging whether the current iteration frequency gen reaches the maximum iteration frequency maxGen, and outputting an optimal solution if the current iteration frequency gen reaches the maximum iteration frequency; otherwise go to step 3.4.
3.4 selecting: and selecting individuals by adopting a tournament selection strategy, randomly selecting a certain number of individuals from the population each time, selecting the optimal individual from the population to enter a new population according to the fitness function value of the individual, and repeating the operation until the size of the selected new population reaches 90% of that of the initial population.
3.5, crossing: according to cross probability pcPerforming cross operation, improving on the basis of single-point cross, and forming a cross strategy considering the relation between the front and the back; taking two individuals from the parent to cross, wherein the two individuals are respectively M1And M2Taking a random integer m as a breakpoint, wherein m is more than or equal to 1<n, then two offspring C are obtained1And C2(ii) a Offspring C1In the active sequence of (1), …, M is derived from the parent M1And i is M +1, …, part of n being from parent M2But in this part of the sequence, already from the parent M1The selected activities are not considered any more, so that the operation ensures that the priority of the activities in the parent is preserved, each activity only appears once, the generated child individuals do not appear illegal individuals, and the child C does not appear2The same can be obtained by the generation of the method, so that two new filial individuals are obtained.
3.6 mutation: according to the probability of variation pmChanging the genotype of a genetic operator, adopting a right shift mutation strategy, considering that an activity sequence lambda of a certain individual is {1, 2., i, …, n }, wherein i is randomly selected activity, right shifting a position of i to a certain position to generate a new generation of individual, and in order to ensure that the activity sequence of the new individual still accords with the priority sequence of the activity without generating illegal solution, judging the right-shifted position with the minimum activity before right shifting, namely not destroying the original close-behind relationship, but because the activity is right shifted, the activity immediately before is still effective, thereby obtaining a new individual lambda' {1, …, i-1, i +1, …, h-1, i, h, …, n }, wherein the position of h is the right-shifted position with the minimum i; after the mutation operation a new population newPop is generated.
3.7 variable neighborhood operation: and selecting individuals with the first 20% of the fitness value from the newPop as an initial solution set S of variable neighborhood operation, and generating a local optimal solution set after the variable neighborhood operation.
Here, 3 kinds of neighborhood structures that do not generate illegal solutions are designed, specifically as follows:
randomly selecting a certain point in the individual genes, and recording the maximum subscript position of all immediately preceding activities of the corresponding activities on the point in the item list and the minimum subscript position of all immediately following activities of the activities in the item list according to the relationship between immediately preceding activities and immediately following activities. (1) The gene is inserted into the position one bit before the minimum subscript position of the activity after the gene is moved right to form a first neighborhood structure; (2) the gene is left-shifted and inserted to a position behind the maximum lower mark position of the activity immediately before to form a second neighborhood structure; (3) the gene is randomly inserted between the minimum subscript position and the maximum subscript position to form a third neighborhood structure.
Three specific examples of neighborhood structures are shown in fig. 2. Randomly selecting a gene locus G in chromosome F, wherein G corresponds to the maximum subscript position G in all pre-close activities of activity 51The maximum subscript position of all the activities after tightening is G2Then neighborhood structure 1 inserts activity 5 into P1Location finding of New Individual F1Neighborhood Structure 2 inserts Activity 5 into P2Location finding of New Individual F2Neighborhood structure 3 randomly inserts activity 5 into P1And P2Intermediate position P of3Or P4To obtain a new individual F3Or F3’。
In addition to the design of the neighborhood structure, considering that the strategy of neighborhood search based on elite reservation still has the risk of falling into local optimum, a calculation method of an acceptance threshold is provided, namely whether the optimal solution obtained by variable neighborhood search is accepted or not is considered in the acceptance threshold, the initial solution of the variable neighborhood search is set as s, the objective function value is f(s), the new solution obtained after the neighborhood search is set as s ', and the objective function value is f (s'). When the obtained new solution is better than the initial solution, namely f (s ') -f(s) <0, accepting the new solution with the probability p ═ 1, and enabling s ═ s' to enter the next iteration; when the obtained new solution is inferior to the initial solution, namely f (s ') -f(s) >0, accepting inferior solution by using the probability p ═ exp { - [ f (s ') -f (s)) ]/f (s)) }, and leading s ═ s ' to enter the next iteration.
3.8, reinserting the local optimal solution set into the original population, and turning to the step 3.3.
Compared with the prior art, the invention has the following technical effects:
(1) the invention takes the practical situation that the assembly of certain sections of the airplane is limited by space constraints in the process of assembling the final assembly of the airplane into consideration. In the process of aircraft assembly, a plurality of parallel operation activities exist, and due to the fact that space of certain sections (such as an aircraft cockpit) of an aircraft is narrow, personnel and equipment required by the activities of the parallel operation in the sections cannot meet the requirement of start-up at the same time, and in the process of modeling of the scheduling problem of the existing aircraft assembly line, the problem is often ignored, and the scheduling result is inconsistent with the actual field situation. The invention fully considers the actual influence of space constraint on the scheduling of the airplane assembly line and establishes a multi-constraint airplane assembly line operation scheduling mathematical model, so that the scheduling solution is more accurate and effective.
(2) The invention solves the scheduling model of the airplane assembly line operation by adopting an improved genetic variation neighborhood algorithm. A population initialization method combined with priority rules is designed to modify the initial population of the genetic algorithm, so that the quality of the solution is improved, and the solution space is reduced; searching the population after genetic operation by adopting a variable neighborhood searching method to improve the local searching capability of the algorithm, and designing a calculation method of an acceptance threshold value in the searching process to avoid the searching process from falling into local optimum; in the process of constructing the crossing, mutation and neighborhood structure, the operation method which can not generate illegal solutions is considered, and the arithmetic performance of the algorithm is improved.
Drawings
FIG. 1 is a flowchart of a genetic variation neighborhood algorithm.
FIG. 2 is a neighborhood operation example.
Examples
5 groups of initial input data are randomly selected under 3 working conditions with the activity numbers of 30, 60 and 90 by using the examples in the standard example library PSPLIB. Work items on each scale share 4 resources, each resource having a maximum supply per unit time, and each activity requires one or more resources. Randomly selecting a certain resource as space demand, and randomly generating the number of sections [1, z ] for each working condition]And randomly distributing the activities into the segments, the maximum space capacity N of the segmentsmIs a random integer between the maximum value of the demand amount for space and the maximum supply amount per unit time of the resource as the demand amount for space in the activity performed by the section. Numerical experiments were performed through Matlab2014b platform, using IGA-VNS and traditional Genetic Algorithm (GA)The variable neighborhood algorithm (VNS) and the genetic simulated annealing algorithm (GASA) are compared, and the operation is performed for 5 times under each working condition, and the obtained experimental results are shown in table 1, wherein Duration represents the average value of the total construction period of the assembly, and GAP is the percentage of difference.
In the formula (10), T1Total time limit mean, T, for other algorithms2Is the average of the total time limit of the IGA-VNS algorithm. And (4) analyzing results: the results of the numerical experiments are shown in table 1.
Table 13 experimental results at scale
Experimental results show that under different operation scales, the results of the airplane assembly line scheduling problem solved based on the IGA-VNS algorithm are superior to those of the other three algorithms, and under the scale that the activity number is 30, the target value of the IGA-VNS is improved by 4.69% on average in precision compared with that of the other algorithms. The advantage of the IGA-VNS is also expanded as the campaign size increases, with the IGA-VNS improving on average 4.89% of the accuracy with respect to the target value of the other algorithm at a campaign size of 60 and 9.84% of the accuracy with respect to the target value of the other algorithm at a campaign size of 90. And the IGA-VNS has obvious advantages compared with the solving capability of GA and VNS, and has certain advantages for GASA with global and local searching capability. It can be seen comprehensively that the aircraft assembly line operation scheduling solving method provided by the invention is superior to the prior art.
Claims (4)
1. An aircraft assembly line operation scheduling method based on a genetic variation neighborhood algorithm is characterized by comprising the following steps:
step 1: setting relevant parameters of airplane assembly line operation scheduling;
setting an aircraft assembly operation project as a activity set J; j ═ {0,1,2, …, n +1}, where activities 0 and n +1 are dummy activities, representing onlyThe project starts and ends, and time and resources are not occupied; for immediate preceding action set P of Activity jjJ ∈ J denotes a set of operations immediately after J is set with SjRepresents; t is tjIndicates the duration of the activity j, stjRepresents the job start time of activity j; define M as a set of segments, M ═ {1,2, …, z }, M ∈ M as a segment number, z is a positive integer, CmRepresenting the active set in section m, ejRepresenting the space occupation of the job activity j, the maximum space capacity of each section being Nm；R＝{r1,r2,…,rq,…,rkDenotes the set of k resources in the assembly process, denoted by rjqRepresenting the demand of activity j for the qth resource unit time, bqIs the maximum supply of the resource q per unit time; discretizing time, wherein d is a discrete time node, T represents the total construction period of the assembly work, and Ad＝{j|stj<d≤stj+tjThe j is the set of job activities being executed at time d;
step 2: establishing a mathematical model for optimizing the operation scheduling target of the airplane assembly line, wherein the target function is as follows:
minT＝stn+1(1)
namely solving the total construction period of the minimum assembly operation, the constraint is as follows:
t0＝tn+1＝0 (5)
r0q＝r(n+1)q＝0,q＝1,2,...,k (6)
wherein, the formula (2) is a decision variable; equation (3) indicates that each job activity must be completed for its specified duration; equation (4) indicates that activity j, once started, cannot be interrupted until completion; equations (5) and (6) indicate that the duration and resource demand of virtual activities 0 and n +1 are both 0; equation (7) is a constraint that immediately precedes and follows the activity, and activity j must begin only after all activities immediately precede and follow it; equation (8) is a resource constraint, and the demand of all activities being executed at time d on a certain resource is not more than the maximum supply of the resource per unit time; equation (9) is the space constraint of each segment, and the demand of all activities being executed in segment m at time d is not greater than the maximum space capacity of segment m;
and step 3: the genetic variation neighborhood algorithm optimization solution comprises the following steps:
3.1 setting parameters: setting the maximum generation times as maxGen; population size popSize; cross probability of Pc(ii) a The mutation probability is Pm；
3.2 population initialization: generating popSize chromosomes in an integer coding mode, initializing partial individuals by adopting a priority rule in consideration of the problem that the solution target is the minimized project construction period, and randomly initializing the rest individuals to improve the diversity of an initial population;
3.3 calculating an individual Fitness value, selecting a coefficient C multiplied by the reciprocal 1/T of the target function as a Fitness function, namely Fitness ═ C/T, judging whether the current iteration frequency gen reaches the maximum iteration frequency maxGen, and outputting an optimal solution if the current iteration frequency gen reaches the maximum iteration frequency; otherwise, turning to the step 3.4;
3.4 selecting: selecting individuals by adopting a championship selection strategy, randomly selecting a certain number of individuals from the population each time, selecting the optimal individual from the population to enter a new population according to the fitness function value of the individual, and repeating the operation until the size of the selected new population reaches 90% of that of the initial population;
3.5, crossing: according to cross probability pcPerforming cross operation, improving on the basis of single-point cross, and forming a cross strategy considering the relation between the front and the back; taking two individuals from the parent to cross, wherein the two individuals are respectively M1And M2Taking a random integer m as a breakpoint, wherein m is more than or equal to 1<n, then two offspring C are obtained1And C2(ii) a Offspring C1In the active sequence of (1), …, M is derived from the parent M1And i is M +1, …, part of n being from parent M2But in this part of the sequence, already from the parent M1The selected activities are not considered any more, so that the operation ensures that the priority of the activities in the parent is preserved, each activity only appears once, the generated child individuals do not appear illegal individuals, and the child C does not appear2The same principle can be obtained by the generation of the two new filial generation individuals;
3.6 mutation: according to the probability of variation pmChanging the genotype of a genetic operator, adopting a right shift mutation strategy, considering that an activity sequence lambda of a certain individual is {1, 2., i, …, n }, wherein i is randomly selected activity, right shifting a position of i to a certain position to generate a new generation of individual, and in order to ensure that the activity sequence of the new individual still accords with the priority sequence of the activity without generating illegal solution, judging the right-shifted position with the minimum activity before right shifting, namely not destroying the original close-behind relationship, but because the activity is right shifted, the activity immediately before is still effective, thereby obtaining a new individual lambda' {1, …, i-1, i +1, …, h-1, i, h, …, n }, wherein the position of h is the right-shifted position with the minimum i; generating a new population newPop after mutation operation;
3.7 variable neighborhood operation: selecting individuals with the first 20% of fitness value from newPop as an initial solution set S of variable neighborhood operation, and generating a local optimal solution set after the variable neighborhood operation;
3.8, reinserting the local optimal solution set into the original population, and turning to the step 3.3.
2. The aircraft assembly line operation scheduling method based on genetic variation neighborhood algorithm of claim 1, wherein the priority rule adopted in the step 3.2 is EDDF or MINLFT, so as to improve the quality of the initial solution and reduce the solution space.
3. The method for scheduling aircraft assembly line operations based on genetic variation neighborhood algorithm according to claim 1, wherein 3 kinds of neighborhood structures which do not generate illegal solutions are designed in the step 3.7, which is as follows:
randomly selecting a certain site in the individual genes, and recording the maximum subscript positions of all immediately preceding activities of all the activities corresponding to the site in the item list and the minimum subscript positions of all immediately following activities of the activities in the item list according to the relationship between immediately preceding activities and immediately following activities; the gene is inserted into the position one bit before the minimum subscript position of the activity after the gene is moved right to form a first neighborhood structure; the gene is left-shifted and inserted to a position behind the maximum lower mark position of the activity immediately before to form a second neighborhood structure; the gene is randomly inserted between the minimum subscript position and the maximum subscript position to form a third neighborhood structure.
4. The method for scheduling aircraft assembly line operations based on genetic variable neighborhood algorithm according to claim 1, wherein step 3.7 further provides a method for calculating an acceptance threshold, that is, whether to accept the optimal solution obtained by variable neighborhood search is considered in the acceptance threshold, the initial solution of variable neighborhood search is set to be s, the objective function value is f(s), the new solution obtained by neighborhood search is set to be s ', and the objective function value is f (s'); when the obtained new solution is better than the initial solution, namely f (s ') -f(s) <0, accepting the new solution with the probability p ═ 1, and enabling s ═ s' to enter the next iteration; when the obtained new solution is inferior to the initial solution, namely f (s ') -f(s) >0, accepting inferior solution by using the probability p ═ exp { - [ f (s ') -f (s)) ]/f (s)) }, and leading s ═ s ' to enter the next iteration.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911247383.1A CN110991056B (en) | 2019-12-09 | 2019-12-09 | Airplane assembly line operation scheduling method based on genetic variation neighborhood algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911247383.1A CN110991056B (en) | 2019-12-09 | 2019-12-09 | Airplane assembly line operation scheduling method based on genetic variation neighborhood algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110991056A true CN110991056A (en) | 2020-04-10 |
| CN110991056B CN110991056B (en) | 2021-08-06 |
Family
ID=70091106
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911247383.1A Active CN110991056B (en) | 2019-12-09 | 2019-12-09 | Airplane assembly line operation scheduling method based on genetic variation neighborhood algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110991056B (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111814359A (en) * | 2020-08-24 | 2020-10-23 | 电子科技大学 | Discrete manufacturing-oriented integrated workshop scheduling and assembly sequence planning method |
| CN112183933A (en) * | 2020-08-28 | 2021-01-05 | 中国电力科学研究院有限公司 | Verification assembly line scheduling method and system based on hybrid variable neighborhood evolution algorithm |
| CN112257296A (en) * | 2020-11-27 | 2021-01-22 | 西南交通大学 | Improved genetic algorithm-based job shop scheduling method with cache constraint |
| CN112395804A (en) * | 2020-10-21 | 2021-02-23 | 青岛民航凯亚系统集成有限公司 | Cold energy distribution method for airplane secondary energy system |
| CN112859922A (en) * | 2021-01-25 | 2021-05-28 | 西安工业大学 | Multi-unmanned aerial vehicle long-term working path planning for improving adaptive genetic-variable field collaborative search |
| CN112965374A (en) * | 2021-02-02 | 2021-06-15 | 郑州轻工业大学 | Method for disassembling and scheduling in consideration of random demand and operation time under resource constraint |
| CN112990716A (en) * | 2021-03-22 | 2021-06-18 | 杭州电子科技大学 | Dual-resource constraint flexible workshop scheduling and layout integrated optimization method and system |
| CN113177781A (en) * | 2021-05-17 | 2021-07-27 | 合肥工业大学 | Production assembly cooperative scheduling method and system based on variable neighborhood and genetic operator |
| WO2021212649A1 (en) * | 2020-04-20 | 2021-10-28 | 广州地铁设计研究院股份有限公司 | Method for solving resource-constrained project scheduling by using invasive weed optimization |
| CN113705866A (en) * | 2021-08-16 | 2021-11-26 | 成都飞机工业（集团）有限责任公司 | Scheduling optimization method and system based on resource-constrained project scheduling problem model |
| CN113901728A (en) * | 2021-11-18 | 2022-01-07 | 东北大学 | Computer second-class assembly line balance optimization method based on migration genetic algorithm |
| CN114169572A (en) * | 2021-11-09 | 2022-03-11 | 华中科技大学 | Bias genetic algorithm-based rectangular intelligent layout method and system |
| CN114881446A (en) * | 2022-04-29 | 2022-08-09 | 合肥工业大学 | High-end equipment trial production and test cooperative scheduling method considering process uncertainty |
| US11429912B1 (en) * | 2021-03-31 | 2022-08-30 | Coupa Software Incorporated | Systems and methods for generating optimized production plans associated with a site in a supply chain network |
| CN115062936A (en) * | 2022-06-06 | 2022-09-16 | 同济大学 | Automobile assembly line dynamic periodic material distribution scheduling method considering regional responsibility system |
| CN115204696A (en) * | 2022-07-21 | 2022-10-18 | 成都飞机工业（集团）有限责任公司 | ATC and ALC algorithm-based aircraft production line assembly operation scheduling method |
| US11769093B2 (en) | 2021-03-31 | 2023-09-26 | Coupa Software Incorporated | Systems and methods for determining path solutions associated with a supply chain network |
| US11868950B2 (en) | 2021-02-25 | 2024-01-09 | Coupa Software Incorporated | Systems and methods for determining duty costs associated with a supply chain network |
| CN117474486A (en) * | 2023-11-03 | 2024-01-30 | 北京交通大学 | Method for optimizing construction period of repeated construction engineering |
| CN118195277A (en) * | 2024-05-16 | 2024-06-14 | 中国人民解放军海军航空大学 | Helicopter group offshore platform operation integrated scheduling method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103383752A (en) * | 2013-07-15 | 2013-11-06 | 上海飞机制造有限公司 | Assembly scheduling method of aircraft |
| US20140351819A1 (en) * | 2013-05-22 | 2014-11-27 | Massachusetts Institute Of Technology | Multiprocessor scheduling policy |
| CN106610641A (en) * | 2015-11-26 | 2017-05-03 | 四川用联信息技术有限公司 | Genetic programming algorithm based on local search for dynamic job shop scheduling |
| CN107451747A (en) * | 2017-08-08 | 2017-12-08 | 大连交通大学 | Job-Shop system and its method of work based on adaptive non-dominant genetic algorithm |
-
2019
- 2019-12-09 CN CN201911247383.1A patent/CN110991056B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140351819A1 (en) * | 2013-05-22 | 2014-11-27 | Massachusetts Institute Of Technology | Multiprocessor scheduling policy |
| CN103383752A (en) * | 2013-07-15 | 2013-11-06 | 上海飞机制造有限公司 | Assembly scheduling method of aircraft |
| CN106610641A (en) * | 2015-11-26 | 2017-05-03 | 四川用联信息技术有限公司 | Genetic programming algorithm based on local search for dynamic job shop scheduling |
| CN107451747A (en) * | 2017-08-08 | 2017-12-08 | 大连交通大学 | Job-Shop system and its method of work based on adaptive non-dominant genetic algorithm |
Non-Patent Citations (3)
| Title |
|---|
| 孙伟萍: "《基于多种群—变邻域搜索算法的多目标作业车间调度研究》", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 王振禄 等: "《资源受限项目调度中基于邻域搜索的混合遗传算法》", 《兰州交通大学学报（自然科学版）》 * |
| 郑倩: "《多人平行作业飞机总装移动生产线装配作业调度问题研究》", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Cited By (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20230153708A1 (en) * | 2020-04-20 | 2023-05-18 | Guangzhou Metro Design & Research Institute Co., Ltd. | Method for Scheduling Resource-constrained Project by Invasive Weed Optimization |
| WO2021212649A1 (en) * | 2020-04-20 | 2021-10-28 | 广州地铁设计研究院股份有限公司 | Method for solving resource-constrained project scheduling by using invasive weed optimization |
| CN111814359A (en) * | 2020-08-24 | 2020-10-23 | 电子科技大学 | Discrete manufacturing-oriented integrated workshop scheduling and assembly sequence planning method |
| CN112183933A (en) * | 2020-08-28 | 2021-01-05 | 中国电力科学研究院有限公司 | Verification assembly line scheduling method and system based on hybrid variable neighborhood evolution algorithm |
| CN112395804B (en) * | 2020-10-21 | 2022-02-18 | 青岛民航凯亚系统集成有限公司 | Cold energy distribution method for airplane secondary energy system |
| CN112395804A (en) * | 2020-10-21 | 2021-02-23 | 青岛民航凯亚系统集成有限公司 | Cold energy distribution method for airplane secondary energy system |
| CN112257296B (en) * | 2020-11-27 | 2021-06-25 | 西南交通大学 | Improved genetic algorithm-based job shop scheduling method with cache constraint |
| CN112257296A (en) * | 2020-11-27 | 2021-01-22 | 西南交通大学 | Improved genetic algorithm-based job shop scheduling method with cache constraint |
| CN112859922A (en) * | 2021-01-25 | 2021-05-28 | 西安工业大学 | Multi-unmanned aerial vehicle long-term working path planning for improving adaptive genetic-variable field collaborative search |
| CN112859922B (en) * | 2021-01-25 | 2022-09-06 | 西安工业大学 | Multi-unmanned aerial vehicle long-time working path planning method for improving adaptive genetic-variable field collaborative search |
| CN112965374A (en) * | 2021-02-02 | 2021-06-15 | 郑州轻工业大学 | Method for disassembling and scheduling in consideration of random demand and operation time under resource constraint |
| CN112965374B (en) * | 2021-02-02 | 2022-11-01 | 郑州轻工业大学 | Method for disassembling and scheduling in consideration of random demand and operation time under resource constraint |
| US11868950B2 (en) | 2021-02-25 | 2024-01-09 | Coupa Software Incorporated | Systems and methods for determining duty costs associated with a supply chain network |
| CN112990716A (en) * | 2021-03-22 | 2021-06-18 | 杭州电子科技大学 | Dual-resource constraint flexible workshop scheduling and layout integrated optimization method and system |
| CN112990716B (en) * | 2021-03-22 | 2024-02-09 | 杭州电子科技大学 | Double-resource constraint flexible workshop scheduling and layout integrated optimization method and system |
| US11769093B2 (en) | 2021-03-31 | 2023-09-26 | Coupa Software Incorporated | Systems and methods for determining path solutions associated with a supply chain network |
| US11429912B1 (en) * | 2021-03-31 | 2022-08-30 | Coupa Software Incorporated | Systems and methods for generating optimized production plans associated with a site in a supply chain network |
| CN113177781A (en) * | 2021-05-17 | 2021-07-27 | 合肥工业大学 | Production assembly cooperative scheduling method and system based on variable neighborhood and genetic operator |
| CN113177781B (en) * | 2021-05-17 | 2022-09-30 | 合肥工业大学 | Production assembly cooperative scheduling method and system based on variable neighborhood and genetic operator |
| CN113705866B (en) * | 2021-08-16 | 2023-10-10 | 成都飞机工业（集团）有限责任公司 | Scheduling optimization method and system based on resource-constrained project scheduling problem model |
| CN113705866A (en) * | 2021-08-16 | 2021-11-26 | 成都飞机工业（集团）有限责任公司 | Scheduling optimization method and system based on resource-constrained project scheduling problem model |
| CN114169572B (en) * | 2021-11-09 | 2024-09-10 | 华中科技大学 | Rectangular intelligent layout method and system based on bias genetic algorithm |
| CN114169572A (en) * | 2021-11-09 | 2022-03-11 | 华中科技大学 | Bias genetic algorithm-based rectangular intelligent layout method and system |
| CN113901728A (en) * | 2021-11-18 | 2022-01-07 | 东北大学 | Computer second-class assembly line balance optimization method based on migration genetic algorithm |
| CN113901728B (en) * | 2021-11-18 | 2024-04-19 | 东北大学 | Computer second-class assembly line balance optimization method based on migration genetic algorithm |
| CN114881446A (en) * | 2022-04-29 | 2022-08-09 | 合肥工业大学 | High-end equipment trial production and test cooperative scheduling method considering process uncertainty |
| CN115062936A (en) * | 2022-06-06 | 2022-09-16 | 同济大学 | Automobile assembly line dynamic periodic material distribution scheduling method considering regional responsibility system |
| CN115062936B (en) * | 2022-06-06 | 2024-09-17 | 同济大学 | Dynamic periodic material distribution scheduling method for automobile assembly line by considering regional responsibility system |
| CN115204696B (en) * | 2022-07-21 | 2023-12-08 | 成都飞机工业（集团）有限责任公司 | Aircraft production line assembly operation scheduling method based on ATC and ALC algorithms |
| CN115204696A (en) * | 2022-07-21 | 2022-10-18 | 成都飞机工业（集团）有限责任公司 | ATC and ALC algorithm-based aircraft production line assembly operation scheduling method |
| CN117474486A (en) * | 2023-11-03 | 2024-01-30 | 北京交通大学 | Method for optimizing construction period of repeated construction engineering |
| CN118195277A (en) * | 2024-05-16 | 2024-06-14 | 中国人民解放军海军航空大学 | Helicopter group offshore platform operation integrated scheduling method |
| CN118195277B (en) * | 2024-05-16 | 2024-07-23 | 中国人民解放军海军航空大学 | Helicopter group offshore platform operation integrated scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110991056B (en) | 2021-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110991056B (en) | Airplane assembly line operation scheduling method based on genetic variation neighborhood algorithm | |
| Castro et al. | Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation | |
| Owais et al. | Multi-objective transit route network design as set covering problem | |
| CN110657816B (en) | Vehicle path problem planning method with hard time window based on firework algorithm | |
| CN101097617B (en) | Metal hot rolling optimizing scheduling method and system thereof | |
| JP4362572B2 (en) | Problem processing method and apparatus for solving robust optimization problem | |
| CN109544998B (en) | Flight time slot allocation multi-objective optimization method based on distribution estimation algorithm | |
| CN109800910B (en) | Vehicle route optimization method based on tabu search hyperheuristic algorithm | |
| CN112013829A (en) | Multi-UAV/UGV (unmanned aerial vehicle/user generated Unit) cooperative long-term operation path planning method based on multi-objective optimization | |
| Vergidis et al. | Business process improvement using multi-objective optimisation | |
| Rego et al. | A filter-and-fan approach to the job shop scheduling problem | |
| CN113988396B (en) | Multi-objective optimization method for procedure ordering based on NSGA-III algorithm | |
| US10114913B2 (en) | Method and system for determining welding sequences | |
| CN109202895A (en) | The medium of design support apparatus, design support method and design Storage support program | |
| CN113570112B (en) | Optimization algorithm for solving vehicle path problem with time window considering cooperation | |
| Mahmud et al. | Solving multiple depot vehicle routing problem (MDVRP) using genetic algorithm | |
| Golak et al. | Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling | |
| CN113326919A (en) | Traffic travel mode selection prediction method based on computational graph | |
| Debels et al. | A bi-population based genetic algorithm for the resource-constrained project scheduling problem | |
| CN115271568A (en) | Bilateral disassembly line design method based on reinforcement learning-population evolution hybrid algorithm | |
| Rowell et al. | The nature of engineering change in a complex product development cycle | |
| CN114610058B (en) | Cluster aircraft multitasking distributed task allocation method | |
| CN112884370B (en) | Multi-project rescheduling method and system for high-end equipment development process considering order insertion list | |
| CN111445079B (en) | Multi-fidelity simulation optimization method and equipment applied to workshop plan production | |
| CN104021437B (en) | A kind of hybrid differential evolution algorithm based on digraph Fitness analysis |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |