Multi-constrained Space Launch Task Scheduling Modeling And Algorithm Implementation

With the rapid development of society and high technology, aerospace industry has been an important measure of a country’s comprehensive national strength, a rising number of space launch tasks have had a tremendous impact on the traditional choreography of space launch mission relying on manual and experience. How to use systematic theory to analyze and design space launch task has been the primary problem to achieve intelligent scheduling space launch, this thesis aims to study the overall space launch task scheduling process, determine the model and task scheduling algorithm.Multi-constrained space launch task scheduling is a complex scheduling system, in which all aspects of the arrangements need to be scheduled in advance, in order to make a successful launch mission. The studies of scheduling model were a lot at home and abroad, but the research on space launch scheduling model is still blank, the model should be rebuilt based on the overall process of space launch mission. In order to simplify the difficulty of solving this problem, this thesis uses a phased approach to build the multi-constrained space launch task scheduling model. First, build the model of testing and launching capabilities of the spaceport, then on this basis build the model of space launch assignments, finally build the scheduling model of manufacturing space launch task-related component.By analyzing the common methods for solving the scheduling problem home and abroad, the scale of solving testing and launching capabilities of the spaceport can be done easily by using nonlinear integer programming since the problem is not very big. But the scale of solving space launch task scheduling is very big, which requires the use of intelligent algorithms. Genetic algorithms have good global search capability, which can quickly search in the solution space, have a good convergence and high robust. When the accuracy in the calculation is limited, the globally optimal solution can be obtained in a short time. Genetic algorithm was widely used in solving scheduling problems and is also used in this thesis to solve scheduling problems, the time points of space launch task-related component manufacturing are quiet dispersed, which adds the difficulty of solving problems, so this thesis uses dynamic programming to reduce the difficulty under the premise of rationality, finally validate by simulation examples to confirm this thesis’ s model and algorithm can achieve a better scheduling scheme.