Aircraft assembly line operation scheduling method based on genetic variable neighborhood algorithm

Abstract

The invention discloses an aircraft assembly line operation scheduling method based on a genetic variable neighborhood algorithm. The method comprises the steps: firstly building a resource-limited aircraft assembly line operation scheduling model, and converting an operation scheduling problem in actual production into a mathematic model problem for optimization solution; secondly, considering tight-before and tight-after constraints, a resource constraint and a spatial constraint and constructing an aircraft assembly line subsection operation scheduling model by taking the minimization of anassembly operation total construction period as an optimization target; and finally, solving by adopting an improved genetic variable neighborhood algorithm. The invention designs a population initialization method combined with a priority rule so as to reduce a solution space. A variable neighborhood local search mode combined with an acceptance threshold is adopted, and three neighborhood structures considering a tight-before-tight-after relationship are constructed to ensure that a legal solution is generated in a search process, so that the search capability is improved, a traditional genetic algorithm is prevented from falling into local optimum, and an aircraft assembly line operation scheduling scheme obtained by the method can effectively shorten the total construction period of the assembly operation.

Description

technical field [0001] The invention belongs to the field of job scheduling in an aircraft assembly line operation workshop under the condition of limited resources and space, and in particular relates to an aircraft assembly line operation scheduling method based on a genetic variable neighborhood algorithm. Background technique [0002] Aircraft assembly has the characteristics of a large number of operations and complex assembly relationships, and the cockpit and other sections have limited space to accommodate resources, so the aircraft assembly line job scheduling problem can be regarded as a class of resource-constrained project scheduling problems with special space constraints (Resource Constrained Project Scheduling Problem, RCPSP), this type of problem has been proved to be a complex and strong NP-hard problem. [0003] From the perspective of solution, the algorithms for solving RCPSP and its extended problems can be divided into three categories: exact algorithm,...

AI Technical Summary

Problems solved by technology

[0004] The aircraft assembly line scheduling problem belongs to the extended problem of traditional RCPSP, in which the operation activities are not only subject to the constraints of the front and back and the constraints of resources, but in some sections of the aircraft, many parallel activities that satisfy the resources often cannot be performed at the same time due to space constraints. , thus increasing the complexity of the problem space and computational solution

Images