Flight transportation management method for flight-based vehicle

Abstract

The invention discloses a flight transportation management method for a flight-based vehicle, and aims at the flight-based vehicle, through the composite scheduling of integrating integer programming and flight scheduling, the multi-launch site resource rapid allocation decision based on integer programming and the vehicle multiplexing sequence calculation based on dynamic number assignment weight, and the flight transportation management of the flight-based vehicle is realized. And rapid and efficient scheduling optimization of the flight-based vehicle is realized.

Description

Technical Field

[0001] The invention belongs to the technical field of aircraft dynamics and control, and particularly relates to a flight operation and management method for a flight vehicle. Background Art

[0002] Flight-based space transportation is an important way to revolutionarily improve the capabilities of the space transportation system. A flight vehicle is a transportation system for realizing flight-based space transportation, which combines the characteristics of traditional spacecraft and aircraft, and can have the ability to quickly reach large-scale global destinations. It can support the mission requirements of future large-scale, low-cost access to space, utilization of space, and exploration of space, and promote the development of the space industry.

[0003] However, different from the existing air traffic operation and scheduling, flight vehicles have characteristics such as spanning airspace and speed domains, longer flight ranges, and heterogeneous and multiple types of vehicles. In particular, a flight vehicle is composed of two stages, and some sub-stages have the characteristic of reusability, and there is also a time constraint for maintenance and protection after the reusable sub-stage is recovered. These characteristics bring great challenges to the scheduling optimization and management of flight vehicles, and it is difficult to directly apply the flight operation and management methods of traditional air transportation systems. Summary of the Invention

[0004] The technical problem to be solved by the invention is to overcome the deficiencies of the prior art and provide a flight operation and management method for a flight vehicle. For flight vehicles, through a composite scheduling that combines integer programming and flight scheduling, and by using a rapid allocation decision of multi-launch-site resources based on integer programming and a calculation of the vehicle reuse sequence based on dynamically assigned weights, rapid and efficient scheduling optimization of flight vehicles is achieved.

[0005] To solve the above technical problems, the invention discloses a flight operation and management method for a flight vehicle, including:

[0006] Step 1, constructing initial variables for flight scheduling optimization;

[0007] Step 2, determining whether there is any remaining cargo currently; among them, if it is determined that there is no remaining cargo, then go to Step 9; if it is determined that there is remaining cargo, then go to Step 3;

[0008] Step 3, updating the initial variables for flight scheduling optimization;

[0009] Step 4, determining whether the count i of the launch site counter reaches the maximum number of launch sites; among them, if i ≤ N, then the count i of the launch site counter is incremented by 1, and go to Step 5; otherwise, return to Step 2; N represents the total number of launch sites;

[0010] Step 5, determining whether the count η of the launch site station counter i reaches the number of stations at the i-th launch site Among them, if then the count η of the launch site station counter i is incremented by 1, and step 6 is entered; otherwise, step 8 is entered;

[0011] Step 6: Determine the launch vehicle model according to the current vehicle weight matrix;

[0012] Step 7: According to the determined launch vehicle model, update the vehicle launch quantity matrix, the total remaining mission vehicle quantity matrix, the launch site remaining vehicle quantity matrix, the vehicle weight matrix of each model, the remaining cargo distribution matrix, and the vehicle reuse sequence matrix, and return to step 5 until

[0013] Step 8: Update the flight schedule information of the i-th launch site and return to step 4;

[0014] Step 9: The scheduling plan ends, and all flight schedule information is output.

[0015] In the above flight-based vehicle flight operation method, initial variables for flight schedule optimization are constructed, including:

[0016] According to the mission parameters, a launch site station distribution matrix Q is constructed Pad , a launch site cargo distribution matrix Q, a launch site vehicle quantity distribution matrix V, a land transportation distance matrix D between launch sites Land , a sea transportation distance matrix D between launch sites Sea , a sub-stage landing point distance matrix D of the vehicle Back , a maximum vehicle capacity matrix C, and a flight allocation decision variable matrix; among them, the flight allocation decision variable matrix includes: a vehicle launch decision variable matrix X, a vehicle deployment decision variable matrix Y 1 , Y 2 ,..., Y N , and a vehicle recovery decision variable matrix Z;

[0017] According to the constructed land transportation distance matrix D between launch sites Land , the sea transportation distance matrix D between launch sites Sea , the sub-stage landing point distance matrix D of the vehicle Back , and the flight allocation decision variable matrix, a flight allocation objective function J is constructed;

[0018] According to the constructed launch site cargo distribution matrix Q, the launch site vehicle quantity distribution matrix V, the maximum vehicle capacity matrix C, and the flight allocation objective function J, by solving the flight allocation integer optimization problem, an optimal decision variable matrix is obtained; among them, the optimal decision variable matrix includes: an optimal vehicle launch decision variable matrix X *, the optimal carrier deployment decision variable matrix Y 1* , Y 2* ,..., Y N* and the optimal carrier recovery decision variable matrix Z * ;

[0019] According to the obtained optimal decision variable matrix, calculate the remaining carrier quantity matrix of each launch site and the reuse times matrix

[0020] According to the cargo distribution matrix Q of the launch site and the calculated remaining carrier quantity matrix of each launch site and the reuse times matrix Construct the initial variable matrix for flight schedule optimization; among them, the initial variable matrix for flight schedule optimization includes: the total remaining task-carrying carrier quantity matrix N Total , the remaining carrier quantity matrix N of the launch site Local , the remaining cargo distribution matrix Q remain , the weight matrix V of each type of carrier weight , the carrier launch quantity matrix C Launch , the carrier removal quantity matrix C Remove and the carrier reuse sequence matrix

[0021] In the above method for flight operation of flight-type carriers,

[0022]

[0023]

[0024] wherein, q i represents the total mass of the cargo at the i-th launch site, v ij represents the quantity of the j-th type of carrier at the i-th launch site, represents the land transportation distance from the i-th launch site to the k-th launch site, represents the sea transportation distance from the i-th launch site to the k-th launch site, represents the sub-stage landing point distance of the j-th type of carrier at the i-th launch site, c ij represents the carrying capacity of the j-th type of carrier at the i-th launch site to reach the destination, x ij represents the number of times of launching the j-th type of carrier from the i-th launch site, represents the number of times of deploying the j-th type of carrier from the k-th launch site to the i-th launch site, z ijDenote the number of times to recycle the \(j\)th type of carrier at the \(i\)th launch site, where \(i = 1, 2, \cdots, N\), \(j = 1, \cdots, M\), \(k = 1, 2, \cdots, N\), \(N\) represents the total number of launch sites, and \(M\) represents the total number of carrier types; \(J\) x Denote the cost per local launch Denote the cost per launch for the total land transportation deployment Denote the cost per local launch, \(J\) z Denote the total recycling time, \(V\) Sea Denote the sea transportation speed, \(V\) Land Denote the land transportation speed

[0025] In the above-mentioned flight-based carrier flight operation method, the flight assignment integer optimization problem is described as follows

[0026]

[0027] where \(P\) represents any number greater than 10000 preset

[0028] In the above-mentioned flight-based carrier flight operation method

[0029]

[0030]

[0031] where Denote the element in the \(i\)th row and \(j\)th column of the matrix Denote the element in the \(i\)th row and \(j\)th column of the matrix Denote the element in the \(i\)th row and \(j\)th column of the optimal carrier launch decision variable matrix \(X\) * Denote the elements in the \(i\)th row and \(j\)th column of the optimal carrier deployment decision variable matrices \(Y\) 1* , \(Y\) 2* , \(\cdots\), \(Y\) N* Denote the element in the \(i\)th row and \(j\)th column of the optimal carrier recycling decision variable matrix \(Z\) * and Denote the elements in the \(i\)th row and \(j\)th column of the matrices \(N\) Total , matrix \(N\) Local , matrix \(Q\) remain , matrix \(V\) weight , matrix \(C\) Launch , matrix \(C\) Remove and matrix Assign an initial value of ​​​​​​ Initialize the value to be Initialize the value to be Initialize the value to be empty.

[0032] In the above flight operation management method of the flight vehicle, determining whether there is still remaining cargo currently includes:

[0033] According to the remaining cargo distribution matrix Q remain , determine whether there is still remaining cargo currently; among them, if then it is determined that there is no remaining cargo; otherwise, it is determined that there is remaining cargo.

[0034] In the above flight operation management method of the flight vehicle, updating the initial variables for flight scheduling optimization includes:

[0035] Update the vehicle reuse sequence matrix and the vehicle removal quantity matrix in the following manner: Add T to all elements in the vehicle reuse sequence matrix interval , and delete the elements greater than T prepare , and at the same time, calculate the number of deleted elements and assign it to the elements in the vehicle removal quantity matrix; among them, T interval represents the launch time interval and is a constant; T prepare represents the preparation time for reusing the vehicle and is a constant;

[0036] Update the remaining vehicle quantity matrix at the launch site in the following manner: Among them, represents the element in the i-th row and j-th column of the updated remaining vehicle quantity matrix at the launch site, represents the element in the i-th row and j-th column of the updated vehicle removal quantity matrix;

[0037] Reset the vehicle launch quantity matrix and the vehicle removal quantity matrix in the following manner:

[0038] Update the weight matrix of each type of vehicle in the following manner: Among them, represents the element in the i-th row and j-th column of the updated weight matrix of each type of vehicle.

[0039] In the above flight operation management method of the flight vehicle, determining the type of the launch vehicle according to the current vehicle weight matrix includes:

[0040] Arrange all the values in the i-th row of the current vehicle weight matrix in descending order and obtain the sequence matrix S of the serial numbers corresponding to the values in the original i-th row, tmp , that is, satisfying the following formula:

[0041]

[0042] Among them, represents the i-th row element after arranging all the values in the i-th row of the current carrier weight matrix in descending order, represents the element in matrix S tmp ;

[0043] Subsequently, traverse matrix S tmp , and find the minimum value λ that satisfies the following formula * :

[0044]

[0045] Among them, represents the element in the i-th row and λ-th column of the current total remaining mission carrier quantity matrix, the element in the i-th row and λ-th column of the current launch site remaining carrier quantity matrix;

[0046] Then, determine the current launch carrier model S as: S = λ * .

[0047] In the above flight-based carrier flight operation method, according to the determined launch carrier model, update the carrier launch quantity matrix, the total remaining mission carrier quantity matrix, the launch site remaining carrier quantity matrix, the weight matrix of each type of carrier, the remaining cargo distribution matrix, and the carrier reuse sequence matrix, including:

[0048] Update the carrier launch quantity matrix in the following manner: Among them, represents the element in the i-th row and S-th column of the updated carrier launch quantity matrix, represents the element in the i-th row and S-th column of the carrier launch quantity matrix before update;

[0049] Update the total remaining mission carrier quantity matrix and the launch site remaining carrier quantity matrix in the following manner: Among them, represents the element in the i-th row and S-th column of the updated total remaining mission carrier quantity matrix, represents the element in the i-th row and S-th column of the total remaining mission carrier quantity matrix before update, represents the element in the i-th row and S-th column of the updated launch site remaining carrier quantity matrix, represents the element in the i-th row and S-th column of the launch site remaining carrier quantity matrix before update;

[0050] Update the weight matrix of each type of carrier in the following manner: Among them, represents the element in the \(i\)-th row and \(S\)-th column of the weight matrix of each type of carrier after update, represents the element in the \(i\)-th row and \(S\)-th column of the weight matrix of each type of carrier before update;

[0051] Update the remaining cargo distribution matrix in the following manner: where, represents the element in the \(i\)-th row and \(S\)-th column of the remaining cargo distribution matrix after update, represents the element in the \(i\)-th row and \(S\)-th column of the remaining cargo distribution matrix before update, \(c\) i,S represents the element in the \(i\)-th row and \(S\)-th column of the maximum carrying capacity matrix of the carrier;

[0052] Update the carrier reuse sequence matrix in the following manner: Add all elements in with \(T\) interval , and add zeros with the number of at the end of ; where, represents the reuse sequence matrix corresponding to the launch carrier model \(S\), represents the element in the \(i\)-th row and \(S\)-th column of the carrier launch quantity matrix.

[0053] In the above method for flight operation and management of flight - type carriers, the flight scheduling information of the \(i\)-th launch site includes: launch time \(T_0+\eta\) i * \(T\) interval , launch position \(\eta\) i , launch carrier model \(S\) and carrying capacity, that is

[0054] \(\{T_0+\eta\) i * \(T\) interval , \(\eta\) i , \(S, c\) i,S \}; where, \(T_0\) represents the initial time.

[0055] The present invention has the following advantages:

[0056] (1) The present invention discloses a method for flight operation and management of flight - type carriers, which adopts a composite scheduling strategy integrating integer programming and flight scheduling. For the short - time and large - scale flight transportation scheduling task of multi - type flight - type carriers from multiple launch sites to a designated destination, it realizes rapid allocation decision - making for multiple launch sites based on integer programming. On this basis, it makes full use of reusable carriers and available launch positions at the launch sites, and based on the method of assigning weights by quantity, it realizes rapid and optimal flight scheduling.

[0057] (2) The present invention discloses a flight operation and management method for a flight vehicle, which adopts a method for rapid allocation decision of multi-launch site resources based on integer programming, fully identifies the reusable characteristics of the flight vehicle and the schedulable conditions between launch sites, proposes triple decision variables of available vehicles, schedulable vehicles and reusable vehicles, constructs mathematical models of launch cost, reuse cost and deployment cost, and at the same time constructs three types of constraint mathematical models of cargo demand constraint, vehicle quantity and deployment / recovery times, forms a mathematical model for rapid optimization of resource allocation, and is applicable to rapid solution by integer programming.

[0058] (3) The present invention discloses a flight operation and management method for a flight vehicle, which adopts a method for calculating the reuse sequence of vehicles based on dynamically assigned weights of quantity. Based on the quantity of each type of vehicle updated after each launch, it integrates the constraint of the reuse preparation duration, dynamically updates the weight of the vehicle type for the next launch, ensures the balanced use of vehicle resources at each launch site, and realizes efficient flight scheduling. Description of the Drawings

[0059] Figure 1 is a flowchart of a flight operation and management method for a flight vehicle in an embodiment of the present invention. Detailed Embodiments

[0060] To make the objectives, technical solutions and advantages of the present invention clearer, the following will further describe in detail the disclosed embodiments of the present invention with reference to the drawings.

[0061] Refer to Figure 1 , in this embodiment, the flight operation and management method for the flight vehicle includes:

[0062] Step 1, construct initial variables for flight scheduling optimization.

[0063] In this embodiment, the initial variables for flight scheduling optimization can be constructed in the following manner:

[0064] (11) According to the mission parameters, construct a launch site station distribution matrix Q Pad , a launch site cargo distribution matrix Q, a launch site vehicle quantity distribution matrix V, a land transportation distance matrix D between launch sites Land , a sea transportation distance matrix D between launch sites Sea , a sub-stage landing point distance matrix D of the vehicle Back , a maximum vehicle capacity matrix C and a flight allocation decision variable matrix; among them, the flight allocation decision variable matrix includes: a vehicle launch decision variable matrix X, a vehicle deployment decision variable matrix Y 1 , Y 2 ,..., Y N and a vehicle recovery decision variable matrix Z.

[0065]

[0066] Among them, q i represents the total mass of goods at the i-th launch site, and v ij represents the number of the j-th type of launch vehicle at the i-th launch site. represents the land transportation distance from the i-th launch site to the k-th launch site. represents the sea transportation distance from the i-th launch site to the k-th launch site. represents the sub-stage landing point distance of the j-th type of launch vehicle at the i-th launch site, and c ij represents the carrying capacity of the j-th type of launch vehicle from the i-th launch site to the destination, and x ij represents the number of times of launching the j-th type of launch vehicle from the i-th launch site. represents the number of times of deploying the j-th type of launch vehicle from the k-th launch site to the i-th launch site, and z ij represents the number of times of recovering the j-th type of launch vehicle at the i-th launch site, where i = 1, 2,..., N, j = 1,..., M, k = 1, 2,..., N, N represents the total number of launch sites, and M represents the total number of types of launch vehicles.

[0067] (12) According to the constructed land transportation distance matrix D Land between launch sites, the sea transportation distance matrix D Sea between launch sites, the sub-stage landing point distance matrix D Back of the launch vehicle and the flight allocation decision variable matrix, the flight allocation objective function J is constructed.

[0068]

[0069] Among them, J x represents the cost of the number of local launches. represents the cost of the total land transportation deployment cost and the number of launches. represents the cost of the number of local launches, and J z represents the total recovery time, V Sea represents the sea transportation speed, and V Land represents the land transportation speed.

[0070] (13) According to the constructed launch site cargo distribution matrix Q, launch site launch vehicle quantity distribution matrix V, launch vehicle maximum carrying capacity matrix C, and flight allocation objective function J, by solving the flight allocation integer optimization problem, the optimal decision variable matrix is obtained; among them, the optimal decision variable matrix includes: the optimal launch vehicle launch decision variable matrix X * , the optimal launch vehicle deployment decision variable matrix Y 1* , Y 2* ,..., Y N*and the optimal vehicle recovery decision variable matrix Z * 。

[0071] The description of the integer optimization problem for flight assignment is as follows:

[0072]

[0073] Where P represents any number greater than 10000 set in advance.

[0074] (14) According to the obtained optimal decision variable matrix, calculate the remaining vehicle quantity matrix for each launch site and the reuse times matrix

[0075]

[0076]

[0077] (15) According to the cargo distribution matrix Q of the launch site and the remaining vehicle quantity matrix for each launch site calculated and the reuse times matrix Construct the initial variable matrix for flight scheduling optimization; among them, the initial variable matrix for flight scheduling optimization includes: the total remaining mission vehicle quantity matrix N Total 、the remaining vehicle quantity matrix N for the launch site Local 、the remaining cargo distribution matrix Q remain 、the weight matrix V of each type of vehicle weight 、the vehicle launch quantity matrix C Launch 、the vehicle removal quantity matrix C Remove and the vehicle reuse sequence matrix

[0078]

[0079] Where represents the element in the i-th row and j-th column of the matrix , represents the element in the i-th row and j-th column of the matrix , represents the element in the i-th row and j-th column of the optimal vehicle launch decision variable matrix X * , respectively represent the elements in the i-th row and j-th column of the optimal vehicle deployment decision variable matrices Y 1* ,Y 2* ,...,Y N* , represents the element in the i-th row and j-th column of the optimal vehicle recovery decision variable matrix Z * ; and respectively represent the elements in the i-th row and j-th column of matrix N Total , matrix N Local , matrix Q remain , matrix V weight , matrix C Launch , matrix C Remove and matrix ; Initialize to Initialize to Initialize to Initialize to empty.

[0080] Step 2, determine whether there are any remaining goods currently.

[0081] In this embodiment, it is possible to determine whether there are any remaining goods currently according to the remaining goods distribution matrix Q remain . Among them, if then it is determined that there are no remaining goods, and proceed to Step 9; otherwise, it is determined that there are remaining goods, and proceed to Step 3.

[0082] Step 3, update the initial variables for flight scheduling optimization.

[0083] In this embodiment, the specific update of the initial variables for flight scheduling optimization includes:

[0084] Update the vehicle reuse sequence matrix and the vehicle removal quantity matrix in the following manner: Add T interval to all elements in the vehicle reuse sequence matrix, and delete the elements greater than T prepare . At the same time, calculate the number of deleted elements and assign it to the elements in the vehicle removal quantity matrix; where T interval represents the launch time interval, which is a constant; T prepare represents the preparation time for reusing the vehicle, which is a constant.

[0085] Update the remaining vehicle quantity matrix at the launch site in the following manner: Among them, represents the element in the i-th row and j-th column of the updated remaining vehicle quantity matrix at the launch site, represents the element in the i-th row and j-th column of the updated vehicle removal quantity matrix.

[0086] Reset the vehicle launch quantity matrix and the vehicle removal quantity matrix in the following manner:

[0087] Update the weight matrix of each type of vehicle in the following manner: Among them, Represents the element in the \(i\)-th row and \(j\)-th column of the weight matrix of each updated vehicle model.

[0088] Step 4, determine whether the count \(i\) of the launch site counter reaches the maximum number of launch sites.

[0089] In this embodiment, if \(i\leq N\), then increment the count \(i\) of the launch site counter by 1 and proceed to Step 5; otherwise, return to Step 2.

[0090] Step 5, determine the count \(\eta\) of the launch site station counter i Whether it reaches the number of stations at the \(i\)-th launch site

[0091]

[0092] In this embodiment, if then the count \(\eta\) of the launch site station counter i is incremented by 1 and proceed to Step 6; otherwise, proceed to Step 8.

[0093] Step 6, determine the launch vehicle model according to the current vehicle weight matrix.

[0094] In this embodiment, the method for determining the launch vehicle model is as follows:

[0095] Sort all the values in the \(i\)-th row of the current vehicle weight matrix in descending order, and obtain the sequence matrix \(S\) of the serial numbers corresponding to the values in the original \(i\)-th row, i.e., satisfying the following formula: tmp where,

[0096]

[0097] where, represents the \(i\)-th row element after sorting all the values in the \(i\)-th row of the current vehicle weight matrix in descending order, represents the element in matrix \(S\) tmp and.

[0098] Subsequently, traverse matrix \(S\) tmp to find the minimum value \(\lambda\) that satisfies the following formula * :

[0099]

[0100] where, represents the element in the \(i\)-th row and \(\lambda\)-th column of the current total remaining mission vehicle quantity matrix, the element in the \(i\)-th row and \(\lambda\)-th column of the current launch site remaining vehicle quantity matrix.

[0101] Then, determine the current launch vehicle model \(S\) as: \(S = \lambda\) * .

[0102] Step 7: According to the determined launch vehicle model, update the vehicle launch quantity matrix, the total remaining mission vehicle quantity matrix, the launch site remaining vehicle quantity matrix, the weight matrix of each vehicle model, the remaining cargo distribution matrix, and the vehicle reuse sequence matrix, and return to Step 5 until

[0103] In this embodiment, when updating:

[0104] The vehicle launch quantity matrix can be updated in the following manner: Wherein, represents the element in the i-th row and the S-th column of the updated vehicle launch quantity matrix, represents the element in the i-th row and the S-th column of the vehicle launch quantity matrix before update.

[0105] The total remaining mission vehicle quantity matrix and the launch site remaining vehicle quantity matrix can be updated in the following manner: Wherein, represents the element in the i-th row and the S-th column of the updated total remaining mission vehicle quantity matrix, represents the element in the i-th row and the S-th column of the total remaining mission vehicle quantity matrix before update, represents the element in the i-th row and the S-th column of the launch site remaining vehicle quantity matrix after update, represents the element in the i-th row and the S-th column of the launch site remaining vehicle quantity matrix before update.

[0106] The weight matrix of each vehicle model can be updated in the following manner: Wherein, represents the element in the i-th row and the S-th column of the updated weight matrix of each vehicle model, represents the element in the i-th row and the S-th column of the weight matrix of each vehicle model before update.

[0107] The remaining cargo distribution matrix can be updated in the following manner: Wherein, represents the element in the i-th row and the S-th column of the updated remaining cargo distribution matrix, represents the element in the i-th row and the S-th column of the remaining cargo distribution matrix before update, c i,S represents the element in the i-th row and the S-th column of the vehicle maximum carrying capacity matrix.

[0108] The vehicle reuse sequence matrix can be updated in the following manner: Add all elements in with T interval , and add zeros with the number of at the end of ; wherein, Denote the multiplexing sequence matrix corresponding to the launch vehicle model S. Denote the element in the i-th row and S-th column of the launch vehicle launch quantity matrix.

[0109] Step 8: Update the flight scheduling information of the i-th launch site, and return to Step 4.

[0110] In this embodiment, the flight scheduling information of the i-th launch site includes: the launch time T0 + η i *T interval , the launch position η i , the launch vehicle model S and the carrying capacity, that is

[0111] {T0 + η i *T interval , η i , S, c i,S}; where T0 represents the initial time.

[0112] Step 9: The scheduling plan ends, and output all flight scheduling information.

[0113] Based on the above embodiments, a specific example is described below.

[0114] In this embodiment, the specific implementation of the flight-scheduled launch vehicle flight operation management method is as follows:

[0115] (1) Obtain the mission parameters, including but not limited to: the total number N of launch sites, the total number M of launch vehicle types, the launch time interval T interval and the preparation time T of the multiplexing launch vehicle prepare .

[0116] (2) Construct the launch site position distribution matrix Q Pad and the launch site cargo distribution matrix Q:

[0117]

[0118] Q = [q i = [q1,..., q N

[0119] (3) Construct the launch vehicle quantity distribution matrix V of the launch site:

[0120]

[0121] (4) Construct the land transportation distance matrix D between launch sites Land :

[0122]

[0123] (5) Construct the sea transportation distance matrix D between launch sites​Sea :

[0124]

[0125] (6) Construct the sub-stage landing point distance matrix D of the carrier Back :

[0126]

[0127] (7) Construct the maximum carrying capacity matrix C of the carrier:

[0128]

[0129] (8) Construct the flight allocation decision variable matrix, including:

[0130] The carrier launch decision variable matrix X:

[0131]

[0132] The carrier deployment decision variable matrix Y 1 , Y 2 ,..., Y N :

[0133]

[0134] The carrier recovery decision variable matrix Z:

[0135]

[0136] And assign initial values: x ij The initial value can be assigned as any non-zero positive integer, The initial value can be assigned as any non-zero positive integer, z ij The initial value can be assigned as any non-zero positive integer.

[0137] (9) Construct the flight allocation objective function J:

[0138]

[0139] (10) By solving the flight allocation integer optimization problem, obtain the optimal decision variable matrix, including: the optimal carrier launch decision variable matrix X * 、the optimal carrier deployment decision variable matrix Y 1* , Y 2* ,..., Y N* and the optimal carrier recovery decision variable matrix Z * .

[0140] The description of the flight allocation integer optimization problem is as follows:

[0141]

[0142] Among them, P can be set to 10000.

[0143] (11) Calculate the matrix of the remaining number of launch vehicles at each launch site and the matrix of reuse times

[0144]

[0145]

[0146] (12) Construct the initial variable matrix for flight schedule optimization, including: the matrix N of the total remaining number of mission-carrying launch vehicles Total 、the matrix N of the remaining number of launch vehicles at the launch site Local 、the matrix Q of the remaining cargo distribution remain 、the matrix V of the weights of each type of launch vehicle weight 、the matrix C of the launch quantity of launch vehicles Launch 、the matrix C of the removal quantity of launch vehicles Remove and the matrix of the reuse sequence of launch vehicles

[0147]

[0148] And assign initial values to the matrix of the total remaining number of mission-carrying launch vehicles, the matrix of the remaining number of launch vehicles at the launch site, the matrix of the remaining cargo distribution, and the matrix of the reuse sequence of launch vehicles.

[0149] (13) According to the matrix of the remaining cargo distribution, determine whether there is still remaining cargo at present; among them, if then it is determined that there is no remaining cargo, and go to step (29); otherwise, it is determined that there is remaining cargo, and go to step (14).

[0150] (14) Update the matrix of the reuse sequence of launch vehicles and the matrix of the removal quantity of launch vehicles.

[0151] (15) Update the matrix of the remaining number of launch vehicles at the launch site.

[0152] (16) Reset the matrix of the launch quantity of launch vehicles and the matrix of the removal quantity of launch vehicles.

[0153] (17) Update the matrix of the weights of each type of launch vehicle.

[0154] (18) Set a launch site counter, assign a count i to the launch site counter, and let i = 0.

[0155] (19) Determine whether the count i of the launch site counter reaches the maximum number N of the launch site; where, if i ≤ N, then increment the count i of the launch site counter by 1 and proceed to step (20); otherwise, return to step (13).

[0156] (20) Set the launch site station counter and assign a value to the count η of the launch site station counter i such that η i = 0.

[0157] (21) Determine whether the count η of the launch site station counter i reaches the number of stations at the i-th launch site where, if then increment the count η of the launch site station counter i by 1 and proceed to step (22); otherwise, proceed to step (27).

[0158] (22) Determine the launch vehicle model S according to the current vehicle weight matrix.

[0159] (23) Update the vehicle launch quantity matrix according to the determined launch vehicle model S,

[0160] (24) Update the total remaining mission vehicle quantity matrix and the launch site remaining vehicle quantity matrix according to the determined launch vehicle model S.

[0161] (25) Update the weight matrix of each vehicle model according to the determined launch vehicle model S.

[0162] (26) Update the remaining cargo distribution matrix according to the determined launch vehicle model S and return to step (21).

[0163] (27) Update the vehicle reuse sequence matrix according to the determined launch vehicle model S.

[0164] (28) Update the flight schedule information {T0 + η i *T interval , η i , S, c i,S} for the i-th launch site.

[0165] (29) The scheduling plan is completed, and all flight schedule information is output.

[0166] Although the present invention has been disclosed above in preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art can make possible changes and modifications to the technical solution of the present invention by using the methods and technical contents disclosed above without departing from the spirit and scope of the present invention. Therefore, any simple modifications, equivalent changes and decorations made to the above embodiments according to the technical essence of the present invention without departing from the technical solution of the present invention shall fall within the protection scope of the technical solution of the present invention.

[0167] The content not detailedly described in the specification of the present invention belongs to the well-known technology of those skilled in the art.

Claims

1. A flight operation method for a flight vehicle, characterized in that including: Step 1, construct the initial variables for flight scheduling optimization; Step 2, determine whether there is any remaining cargo currently; among them, if it is determined that there is no remaining cargo, go to Step 9; if it is determined that there is remaining cargo, go to Step 3; Step 3, update the initial variables for flight scheduling optimization; Step 4, determine whether the count i of the launch site counter has reached the maximum number of launch sites; among them, if i ≤ N, increment the count i of the launch site counter by 1 and go to Step 5; otherwise, return to Step 2; N represents the total number of launch sites; Step 5, determine the count η of the launch site work station counter i whether it has reached the number of work stations of the i-th launch site where, if then the count η of the launch site work station counter i is incremented by 1, and proceed to Step 6; otherwise, proceed to Step 8; Step 6, determine the launch vehicle model according to the current vehicle weight matrix; Step 7, according to the determined launch vehicle model, update the launch vehicle launch quantity matrix, the total remaining mission launch vehicle quantity matrix, the remaining launch vehicle quantity matrix at the launch site, the weight matrix of each type of launch vehicle, the remaining cargo distribution matrix, and the launch vehicle reuse sequence matrix, and return to Step 5 until Step 8, update the flight scheduling information of the i-th launch site and return to Step 4; Step 9, the scheduling plan ends, and output all flight scheduling information.

2. The flight operation method of the flight vehicle according to claim 1, characterized in that Construct the initial variables for flight scheduling optimization, including: According to the task parameters, a launch site station distribution matrix Q is constructed Pad , a launch site cargo distribution matrix Q, a launch site vehicle quantity distribution matrix V, a land transportation distance matrix D between launch sites Land , a sea transportation distance matrix D between launch sites Sea , a sub-stage landing point distance matrix D of the vehicle Back , a maximum vehicle carrying capacity matrix C and a flight allocation decision variable matrix; among them, the flight allocation decision variable matrix includes: a vehicle launch decision variable matrix X, a vehicle deployment decision variable matrix Y 1 , Y 2 ,..., Y N and a vehicle recovery decision variable matrix Z; According to the constructed land transportation distance matrix D between launch sites Land and the maritime transportation distance matrix D between launch sites Sea and the sub-stage landing point distance matrix D of the launch vehicle Back and the flight assignment decision variable matrix, the flight assignment objective function J is constructed; According to the constructed launch site cargo distribution matrix Q, launch site carrier quantity distribution matrix V, maximum carrier capacity matrix C, and flight allocation objective function J, the optimal decision variable matrix is obtained by solving the integer optimization problem of flight allocation; among them, the optimal decision variable matrix includes: the optimal carrier launch decision variable matrix X * , the optimal carrier deployment decision variable matrix Y 1* , Y 2* ,..., Y N* and the optimal carrier recovery decision variable matrix Z * ; According to the obtained optimal decision variable matrix, calculate the remaining carrier quantity matrix of each launch site and the reuse times matrix According to the launch site cargo distribution matrix Q and the calculated remaining carrier quantity matrix of each launch site and the reuse times matrix construct the initial variable matrix for flight schedule optimization; among them, the initial variable matrix for flight schedule optimization includes: the total remaining carrier quantity matrix N for mission execution Total 、the remaining carrier quantity matrix N of the launch site Local 、the remaining cargo distribution matrix Q remain 、the weight matrix V of each type of carrier weight 、the carrier launch quantity matrix C Launch 、the carrier removal quantity matrix C Remove and the carrier reuse sequence matrix 3. The flight vehicle flight operation management method according to claim 2, wherein Among them, q i represents the total mass of goods at the i-th launch site, v ij represents the number of the j-th type of launch vehicle at the i-th launch site, represents the land transportation distance from the i-th launch site to the k-th launch site, represents the sea transportation distance from the i-th launch site to the k-th launch site, represents the sub-stage landing point distance of the j-th type of launch vehicle at the i-th launch site, c ij represents the carrying capacity of the j-th type of launch vehicle at the i-th launch site to reach the destination, x ij represents the number of times of launching the j-th type of launch vehicle from the i-th launch site, represents the number of times of deploying the j-th type of launch vehicle from the k-th launch site to the i-th launch site, z ij represents the number of times of recovering the j-th type of launch vehicle at the i-th launch site, i = 1, 2,..., N, j = 1,..., M, k = 1, 2,..., N, and M represents the total number of types of launch vehicles; J x represents the cost per local launch, represents the total deployment cost of land transportation per launch cost, represents the cost per local launch, J z represents the total recovery time, V Sea represents the sea transportation speed, V Land represents the land transportation speed.

4. The flight operation management method of the flight vehicle according to claim 3, characterized in that The description of the integer optimization problem of flight allocation is as follows: where P represents any number greater than 10000 set in advance.

5. The flight vehicle flight operation management method according to claim 4, wherein Among them, represents the element in the i-th row and j-th column of matrix , and represents the element in the i-th row and j-th column of matrix . represents the element in the i-th row and j-th column of the optimal launcher launch decision variable matrix X * . respectively represent the elements in the i-th row and j-th column of the optimal launcher deployment decision variable matrices Y 1* , Y 2* ,..., Y N* . represents the element in the i-th row and j-th column of the optimal launcher recovery decision variable matrix Z * ; and respectively represent the elements in the i-th row and j-th column of matrices N Total , N Local , matrix Q remain , matrix V weight , matrix C Launch , C Remove and matrix ; is initialized to is initialized to is initialized to is initialized to be empty.

6. The flight operation management method of the flight vehicle according to claim 5, characterized in that, Determine whether there is any remaining cargo currently, including: According to the remaining goods distribution matrix Q remain , determine whether there are still remaining goods at present; among them, if then it is determined that there are no remaining goods; otherwise, it is determined that there are remaining goods.

7. The flight operation management method of the flight vehicle according to claim 6, characterized in that, Update the initial variables for flight scheduling optimization, including: Update the vehicle reuse sequence matrix and the vehicle removal quantity matrix as follows: Add T to all elements in the vehicle reuse sequence matrix interval , and delete the elements greater than T prepare . At the same time, calculate the number of deleted elements and assign it to the elements in the vehicle removal quantity matrix; where T interval represents the launch time interval, which is a constant; T prepare represents the preparation time for the reused vehicle, which is a constant; Update the matrix of the remaining launch vehicles at the launch site as follows: where represents the element in the \(i\)-th row and \(j\)-th column of the updated matrix of the remaining launch vehicles at the launch site, represents the element in the \(i\)-th row and \(j\)-th column of the updated matrix of the removed launch vehicle quantities; Reset the vehicle launch quantity matrix and the vehicle removal quantity matrix as follows: Update the weight matrix of each type of carrier in the following manner: Among them, represents the element in the i-th row and j-th column of the updated weight matrix of each type of carrier.

8. The flight operation method of the flight vehicle according to claim 7, characterized in that, Determine the launch vehicle model according to the current vehicle weight matrix, including: Descendingly sort all the values in the i-th row of the current vehicle weight matrix and obtain the serial number sequence matrix S corresponding to the values in the original i-th row , that is, satisfying the following formula: tmp , namely: Among them, represents the $i$-th row element after arranging all the values in the $i$-th row of the current carrier weight matrix in descending order, represents an element in matrix $S$ tmp ; Subsequently, traverse matrix S tmp , and find the minimum value λ that satisfies the following equation * :[[]]END]] Among them, represents the element in the \(i\)-th row and \(\lambda\)-th column of the current total remaining mission carrier quantity matrix, the element in the \(i\)-th row and \(\lambda\)-th column of the remaining carrier quantity matrix at the current launch site; Then, determine that the current launch vehicle model S is: S = λ * .

9. The flight operation method of the flight vehicle according to claim 8, characterized in that, According to the determined launch vehicle model, update the vehicle launch quantity matrix, the total remaining mission vehicle quantity matrix, the launch site remaining vehicle quantity matrix, the weight matrix of each vehicle model, the remaining cargo distribution matrix, and the vehicle reuse sequence matrix, including: Update the vehicle launch quantity matrix in the following manner: where represents the element in the i-th row and S-th column of the updated vehicle launch quantity matrix, represents the element in the i-th row and S-th column of the vehicle launch quantity matrix before update; Update the total remaining mission-carrying vehicle quantity matrix and the launch site remaining vehicle quantity matrix in the following manner: where represents the element in the i-th row and S-th column of the total remaining mission-carrying vehicle quantity matrix after update, represents the element in the i-th row and S-th column of the total remaining mission-carrying vehicle quantity matrix before update, represents the element in the i-th row and S-th column of the launch site remaining vehicle quantity matrix after update, represents the element in the i-th row and S-th column of the launch site remaining vehicle quantity matrix before update; Update the weight matrix of each type of carrier in the following manner: Among them, represents the element in the \(i\)-th row and \(S\)-th column of the weight matrix of each type of carrier after update, represents the element in the \(i\)-th row and \(S\)-th column of the weight matrix of each type of carrier before update; Update the remaining cargo distribution matrix as follows: Among them, represents the element in the i-th row and S-th column of the remaining cargo distribution matrix after update, represents the element in the i-th row and S-th column of the remaining cargo distribution matrix before update, c i,S represents the element in the i-th row and S-th column of the maximum carrying capacity matrix of the carrier; Update the vehicle reuse sequence matrix as follows: Add T to all elements in interval , and add zeros with the number of at the end of ; where represents the reuse sequence matrix corresponding to the launch vehicle model S, represents the element in the i-th row and S-th column of the vehicle launch quantity matrix.

10. The flight operation management method of the flight vehicle according to claim 9, characterized in that, Flight scheduling information of the i-th launch site, including: launch time T0 + η i *T interval , launch pad η i , launch vehicle model S and carrying capacity, i.e., {T0 + η i *T interval , η i , S, c i,S}; where T0 represents the initial time.

Images