IMA System Interface Data Conversion Equipment Layout and Interface Resource Allocation Method

Abstract

This invention discloses a method for the layout and resource allocation of IMA system interface data conversion equipment, comprising: S1) determining the onboard installation location according to the function of the airborne equipment, and clarifying the interface type, number of interfaces, interface constraints, and access cost of the IMA system data conversion equipment used by the airborne equipment interface; S2) determining the number of IMA system interface data conversion devices, determining the total number of each available interface type, and determining the layout restriction area; S3) & S4) formulating a comprehensive optimization strategy for hierarchical optimization layout and interface allocation based on interface resource requirements, interface data conversion device resource capabilities, and constraints, and executing a two-stage collaborative optimization method based on genetic algorithm and mixed integer programming. This invention can solve the problem of IMA system interface data conversion equipment layout and interface resource allocation under multiple constraints, and achieve global optimization.

Description

Technical Field

[0001] This invention relates to a method for system equipment layout and interface resource allocation, and more particularly to a method for IMA system interface data conversion equipment layout and interface resource allocation. Background Technology

[0002] Avionics systems are the "brain" and "nerves" of an aircraft. With the increasing integration of avionics systems, the Integrated Modular Avionics (IMA) architecture is being used in more and more aircraft due to its low cost, easy scalability, and high flexibility. The IMA system relies on interface data conversion equipment to provide interface data conversion services for various airborne systems. Current large aircraft have tens of thousands of interfaces from different vendors, which are rapidly converted using these interface data conversion devices. How to rationally deploy these interface data conversion devices on board, while meeting constraints and providing data conversion resources for a large number of different types of airborne equipment interfaces, is one of the challenges in aircraft system layout design and resource allocation.

[0003] The resource sharing and module performance constraints of the IMA system dictate that interfaces from different vendors must compete for limited shared resources. A reasonable layout and resource allocation of interface data conversion devices can reduce aircraft weight. However, the layout and allocation of interface data conversion devices is an NP-hard problem. Existing methods primarily rely on manual allocation, depending on engineers' experience and iterative processes. This is inefficient and yields suboptimal results. Each change incurs significant costs, making it difficult to meet the interface allocation and optimization requirements of large aircraft in complex scenarios, thus hindering the achievement of maximum weight reduction. Traditional centroid methods can be used for single interface data conversion device location, and mixed-integer programming can be used for interface allocation, but these employ static strategies and require determining the interface data conversion device layout. Current methods, which optimize interface data conversion device layout and resource allocation separately, result in suboptimal overall costs, struggle to quickly generate feasible solutions under multiple constraints, and exhibit poor dynamic adaptability, limiting their application.

[0004] Therefore, how to reasonably deploy multiple interface data conversion devices on the machine, meet the machine layout constraints, and reasonably allocate a large number of interfaces from different vendors to each interface data conversion device to ensure that the interface relationship constraints and the total amount of interface conversion resources of different types of interfaces of each interface data conversion device are met, and the overall access cost is low, has always been a research hotspot in this field. Summary of the Invention

[0005] The technical problem to be solved by the present invention is to provide a method for the layout and resource allocation of interface data conversion devices in IMA system, which can solve the problem of layout and resource allocation of interface data conversion devices in IMA system under multiple constraints and achieve global optimization.

[0006] The technical solution adopted by this invention to solve the above-mentioned technical problems is to provide a method for the layout and resource allocation of interface data conversion equipment in an IMA system, comprising the following steps: S1) Determine the onboard installation location according to the function of the airborne equipment, and clarify the interface type, number of interfaces, interface constraints, and access cost of the data conversion equipment used by the IMA system; S2) Determine the number of interface data conversion equipment in the IMA system, network the IMA system, determine the total number of each available interface type, and layout the restricted area; S3) Formulate a comprehensive optimization strategy for hierarchical optimization layout and interface allocation based on interface resource requirements, interface data conversion equipment resource capabilities, and constraints, and execute the first stage optimization of a two-stage collaborative optimization method based on genetic algorithm and mixed integer programming; S4) Execute the second stage optimization of the two-stage collaborative optimization method based on genetic algorithm and mixed integer programming based on interface resource requirements, constraints, and interface data conversion equipment resource capabilities.

[0007] Further, step S1 quantifies the access interfaces according to the following formula: Access interface set: IO m ={io1, io2, ..., io m There are a total of m interfaces for connecting to the IMA system interface data conversion device;

[0008] io i =(posi i type i ,num i cost i bind i );

[0009] posi i = (posi_x) i posi_y i posi_z i );

[0010] Among them, io i posi represents the i-th access interface. i Indicates the location of the access interface, posi_x i posi_y i posi_z i Indicates the three-dimensional coordinates of this location; type i Indicates the type of the access interface, num i Indicates the number of access interfaces; costi This represents the access cost coefficient for this type of access interface, bind. i This indicates the associated requirements for the access interface;

[0011] The access interfaces include A429 transmitting interface, A429 receiving interface, A825 interface, analog interface, discrete interface, and sensor interface; for interface devices without special installation location requirements, they can be installed at the shortest suitable distance and then connected to the interface data conversion device.

[0012] Further, step S2 quantifies the devices according to the following formula: Resource device set: IOM = {iom1, iom2, ..., iom} n There are a total of n interface data conversion modules;

[0013] iom j = (iom_posi j max_type_1 j max_type_2 j ...max_type_g j )

[0014] iom_posi j = (iom_p_x) j ,iom_p_y j ,iom_p_z j );

[0015] Layout restriction area set: ZONE = {zone1, zone2, ..., zone...} p There are a total of p prohibited layout regions;

[0016] zone s = (zone_type) s zone_Center s zone_par1 s zone_par2 s zone_par3 s );

[0017] zone_Center s = (zone_p_x) s zone_p_y s zone_p_z s );

[0018] Among them, iom j IOM_posi represents the j-th interface data conversion device in the IMA system. jIndicates the location of the data conversion device for this interface, iom_p_x j ,iom_p_y j ,iom_p_z j Indicates its three-dimensional coordinates; max_type_1 j max_type_2 j ...max_type_g j This indicates the total number of the first, second, ... g-th type interfaces of the data conversion device.

[0019] zone s This represents the s-th layout constraint region within the layout space, represented by zone_type. s Indicates the type of the restricted area in this layout, zone_Center s This indicates the location of the layout restriction area, specifically through zone_p_x. s zone_p_y s zone_p_z s Confirmed, zone_par1 s zone_par2 s zone_par3 s This represents the parameters that define the restricted area of ​​this layout.

[0020] Furthermore, step S3 employs an improved genetic algorithm to optimize the spatial layout of the interface data conversion devices, sets no-distribution area constraints and device connection constraints, ensures that each interface data conversion device is located outside the no-distribution area, and imposes device connection constraints by controlling the sum of the interconnection distances of each interface data conversion device.

[0021] Further, step S3 includes: Step S301, initializing the population: representing feasible solutions to the problem as chromosomes in the solution space through encoding, with each gene bit corresponding to an interface data conversion device and its location coordinates, and generating an initial solution based on forbidden region constraints; Step S302, fitness evaluation: calculating individual fitness based on joint cost; Step S303, selecting parent individuals: selecting high-quality individuals as parents for reproduction based on fitness; Step S304, genetic crossover and mutation operations: using simulated binary crossover, randomly crossing all gene bits of two individuals as needed. The algorithm generates a new gene locus by combining two gene positions and generating a random variable that follows an exponential distribution. The offspring gene locus is then randomly perturbed by Gaussian or random mutation, and boundary constraints are applied to the mutated gene locus. Step S305: Population Update: The new population consists of offspring and some parents, or offspring individuals replace individuals with lower fitness in the old population. Step S306: Termination Condition Judgment: The algorithm terminates when the preset number of iterations and / or the change in the optimal fitness value is less than a preset threshold, and the current best individual is output as the final solution.

[0022] Furthermore, step S302 evaluates the merits of each individual through a fitness function. The fitness function is designed as a joint cost evaluation function, which integrates the interface access cost by converting the device location layout optimization cost through interface data conversion. The layout optimization cost includes the device connection cost and the no-displacement area penalty cost. In the evolution process, solutions that do not meet the conditions are gradually eliminated, and the solution with the highest fitness is selected.

[0023] Furthermore, the fitness function is:

[0024] Fitness = α·cost_dist + β·cost_ penalty + γ·cost_ Allocate ；

[0025] cost_dist : Indicates the connection cost of the interface data conversion device; cost_ penalty : Represents the number of interface data conversion devices deployed to the no-access zone × penalty coefficient, ensuring that the layout constraints are met; cost_ Allocate : Represents the cost of all interfaces being allocated to all interface data conversion devices; α, β, γ are optimized through experiments.

[0026] Furthermore, step S303 can be one of the following selection methods: roulette wheel selection: allocating selection probabilities according to fitness ratio; tournament selection: randomly selecting individuals for comparison and retaining the best; ranking selection: allocating probabilities according to fitness ranking.

[0027] Further, step S4 includes: step S401, defining decision variable x i,j and y k,j Each interface is assigned to a dedicated interface data conversion device;

[0028] x i,j =

[0029] y k,j =

[0030] ,Right now It belongs to one of the g types of interfaces provided by the interface data conversion device;

[0031] Step S402: Set allocation constraints to assign interfaces with interface association requirements to the same interface data conversion device; define allocation weight factors based on a greedy sorting allocation strategy, sort all interfaces according to the weight factors, and prioritize the allocation of interfaces with larger weight factors; set a total constraint on the number of interface types and allocate them to the interface data conversion device IOM. j any type of interface i The sum of the interface resources does not exceed the total interface resources of the data conversion device for that interface, max_type_g j And any type of interface i The sum of interface resources does not exceed the interface resource threshold of the interface data conversion device; Step S403: Set the objective function according to the minimum allocation cost and complete the allocation of all interfaces.

[0032] Further, step S403 includes: defining the cost of allocating a single interface as... cost_ io i This indicates the cost of connecting the interface to a certain interface data conversion device;

[0033] cost_ io i =io_dist×num i ×cost i ;

[0034] io_dist represents the distance from the access interface to the data conversion device of that interface, num i Indicates the number of access interfaces, cost i This represents the access cost coefficient of the access interface. cost_ Allocate This represents the cost of allocating all interfaces to all interface data conversion devices;

[0035] cost_ Allocate = .

[0036] Compared with the prior art, the present invention has the following beneficial effects: The IMA system interface data conversion device layout and interface resource allocation method provided by the present invention adopts a two-stage collaborative optimization method based on genetic algorithm and mixed integer programming. It uses an improved genetic algorithm to optimize the spatial layout of the interface data conversion device, uses mixed integer programming for dynamic allocation of access interfaces, uses population initialization that satisfies the preprocessing mechanism to improve the algorithm convergence efficiency, and finally achieves global optimum through joint cost evaluation of layout cost and allocation cost, thus solving the problem of IMA system interface data conversion device layout and interface resource allocation under multiple constraints. Attached Figure Description

[0037] Figure 1 This is a schematic diagram of the layout and interface resource allocation of the IMA system interface data conversion device of the present invention;

[0038] Figure 2 This is a flowchart illustrating the layout and resource allocation of the interface data conversion equipment in the IMA system of this invention.

[0039] Figure 3 This is a flowchart of the fitness algorithm based on joint cost in this invention;

[0040] Figure 4 This is a schematic diagram of the interface allocation steps based on mixed integer programming in this invention. Detailed Implementation

[0041] The present invention will now be further described with reference to the accompanying drawings and embodiments.

[0042] This invention provides a method for the layout and resource allocation of interface data conversion devices in an IMA system. It requires determining the location of these devices and allocating a large number of interfaces to them while maintaining a relatively low overall cost. The layout and resource allocation method for IMA system interface data conversion devices studied in this invention are as follows: Figure 1 As shown, it is necessary to determine the location of the interface data conversion device, assign interfaces to the interface data conversion device, and satisfy constraints, thereby enabling simultaneous device layout and interface allocation. The specific implementation steps of this invention are as follows: Figure 2 As shown.

[0043] Step S1: Quantize the access interface to determine the location of each airborne device using the interface resources of the IMA system interface data conversion device, including the interface type, quantity, interface constraints, and access cost of the airborne device. The quantization formula is as follows:

[0044] Access interface set: IO = {io1, io2, ..., io2} m There are a total of m interfaces for connecting to the IMA system interface data conversion device;

[0045] io i =(posi i type i ,num i cost i bind i );

[0046] posi i = (posi_x) i posi_y i posi_z i );

[0047] Among them, io i posi represents the i-th access interface. i Indicates the location of the access interface, posi_x i posi_y i posi_z i Indicates the three-dimensional coordinates of this location; type i This indicates the type of the access interface, such as A429 transmit interface, A429 receive interface, A825 interface, analog interface, discrete interface, sensor interface, etc.; num i Indicates the number of access interfaces; cost i This indicates the access cost coefficient for this type of access interface. The access cost coefficient varies depending on the interface type and the cable used; bind i This indicates the associated requirements of the access interface. Some interfaces come from the same device and are expected to be connected to the same interface data conversion device, or interfaces that are closely related to each other need to be connected to the same interface data conversion device.

[0048] For interface devices that do not require a specific installation location, after the interface allocation is completed using the algorithm described in the invention, the device can be installed at the shortest possible distance and then connected to the interface data conversion device.

[0049] Step S2: Quantify equipment capabilities, determine the number of IMA system interface data conversion devices, layout restriction areas, and the types and quantities of interface resources available to the interface data conversion devices. The quantification formula is as follows:

[0050] Resource device set: IOM = {iom1, iom2, ..., iom} n There are a total of n interface data conversion modules;

[0051] iom j = (iom_posi j max_type_1 j max_type_2 j...max_type_g j )

[0052] iom_posi j = (iom_p_x) j ,iom_p_y j ,iom_p_z j );

[0053] Layout restriction area set: ZONE = {zone1, zone2, ..., zone...} p There are a total of p prohibited layout regions;

[0054] zone s = (zone_type) s zone_Center s zone_par1 s zone_par2 s zone_par3 s );

[0055] zone_Center s = (zone_p_x) s zone_p_y s zone_p_z s );

[0056] Among them, iom j IOM_posi represents the j-th interface data conversion device in the IMA system. j This indicates the location of the data conversion device for this interface, iom_p_x j ,iom_p_y j ,iom_p_z j Indicates its three-dimensional coordinates; max_type_1 j max_type_2 j ...max_type_g j This represents the total number of the first, second, ... g-th type interfaces of the data conversion device, i.e., the maximum number of interface resources of each type that the device can provide. `type_g` indicates that there are g interface types. i It must be one of the interfaces provided by the interface data conversion device.

[0057] zone s This represents the s-th layout constraint region within the layout space, represented by zone_type. s Indicates the type of the restricted area in this layout, zone_Center sThis indicates the location of the layout restriction area, specifically through zone_p_x. s zone_p_y s zone_p_z s Confirmed, zone_par1 s zone_par2 s zone_par3 s This represents the parameters that define the restricted area of ​​this layout.

[0058] Step S3: Based on the interface resource requirements and the resource capabilities of the interface data conversion equipment, and their constraints, formulate a comprehensive optimization strategy for hierarchical layout and interface allocation. Execute the first stage of optimization using a two-stage collaborative optimization method based on genetic algorithms and mixed integer programming, i.e., use an improved genetic algorithm to optimize the spatial layout of the interface data conversion equipment, such as... Figure 3 As shown. Considering the large number of onboard devices, the present invention establishes the following mathematical model for layout constraints:

[0059] 1) Restrictions on prohibited areas:

[0060] iom_posi j No-distribution zone: No interface data conversion device should be placed within the no-distribution zone.

[0061] 2) Device Connection Constraints: Since the interface data conversion devices need to be connected to network devices after deployment, a certain degree of clustering of these devices is required. This is represented by distance cost, and the model is established as follows:

[0062] Minimize cost_dist= , where iom_posi n+1 =iom_posi1,

[0063] This represents the distance from the j-th interface data conversion device to the (j+1)-th interface data conversion device; cost_dist represents the connection cost of the interface data conversion devices.

[0064] Additionally, the device connection constraints can also be represented by the sum of the interconnection distances of the data conversion devices at each interface.

[0065] Step S301: Initialize the population

[0066] 1) Encoding Rules: Feasible solutions to the problem are represented as chromosomes (individuals) in the solution space through encoding. A chromosome is represented as an array of length equal to the total number of interface data conversion devices. Each gene position corresponds to an interface data conversion device and its location coordinates, and the gene value... n represents the interface data conversion device number.

[0067] 2) Constraint preprocessing:

[0068] To accelerate convergence and improve efficiency, this invention generates initial solutions based on forbidden region constraints, thereby reducing invalid searches.

[0069] Forbidden Zone Constraint: For each individual in the randomly initialized population, check the location of each interface data conversion device to ensure it meets the forbidden zone constraint, i.e., it is outside the forbidden zone.

[0070] 3) Parameter settings

[0071] Define control parameters such as population size, crossover probability (Pc), mutation probability (Pm), and maximum number of iterations.

[0072] Step S302: Fitness Assessment

[0073] Individual fitness is calculated based on joint cost: the fitness function evaluates the quality of each individual, and the fitness value reflects the optimization objective of the solution. The fitness function of this invention is designed as a joint cost evaluation function, which integrates interface access cost with interface data conversion device location layout optimization cost. The layout optimization cost includes device connection cost and no-displacement area penalty cost. During the evolution process, solutions that do not meet the conditions are gradually eliminated, and the solution with the highest fitness is selected.

[0074] Fitness function: Fitness = α·cost_dist + β·cost_ penalty + γ·cost_ Allocate ；

[0075] in: cost_dist : Indicates the connection cost of the interface data conversion device;

[0076] cost_ penalty : Represents the number of interface data conversion devices deployed to the no-access zone × penalty coefficient, ensuring that the layout constraints are met;

[0077] cost_ Allocate : This represents the cost of allocating all interfaces to all interface data conversion devices, calculated in step 4, interface allocation;

[0078] α, β, γ can Optimize through experiments.

[0079] Step S303: Select operation

[0080] Selecting parent individuals: Choosing high-quality individuals based on fitness as parents for breeding. Common methods include:

[0081] i Roulette wheel selection: Allocate selection probability according to fitness percentage;

[0082] ii. Tournament selection: Randomly select individuals for comparison and retain the best performer;

[0083] iii Ranking selection: Assign probabilities based on fitness ranking.

[0084] Step S304: Genetic manipulation

[0085] 1) Crossover

[0086] Typically, two individuals are randomly selected from the parent generation, and offspring are generated through single-point / multi-point crossover recombination. In this invention, a simulated binary crossover optimization algorithm is used. All gene loci of the two individuals are randomly crossovered as needed, i.e., a random variable alpha is generated. If this alpha is less than the crossover probability (Pc), a random variable beta following an exponential distribution is generated. This variable, combined with the two gene loci, recombines to generate new gene loci, thus producing offspring. An example of gene locus changes is as follows:

[0087] Random variable: beta;

[0088] The positions of gene j and gene j+1: iom_posi1, iom_posi j+1 ;

[0089] new_p1=0.5×((1+beta)×iom_posi j +(1-beta)×iom_posi j+1 );

[0090] new_p2=0.5×((1-beta)×iom_posi j +(1+beta)×iom_posi j+1 ).

[0091] New gene loci: new_p1, new_p2.

[0092] 2) Mutation

[0093] Randomly perturb (adjust values) the offspring genes to increase population diversity. The perturbation can be Gaussian mutation or random mutation, and boundary constraints can be applied to the mutated gene loci.

[0094] Step S305: Population Update

[0095] The population renewal strategies are as follows, and one of the population renewal strategies can be selected.

[0096] New generation population: replacing old population individuals with offspring individuals.

[0097] Hybrid strategy: The new population consists of offspring and some parents, or offspring individuals replace individuals with lower fitness in the old population, in order to balance exploration and development.

[0098] Step S306: Termination condition determination

[0099] 1) Stopping Criteria

[0100] The algorithm terminates if one or a combination of the following conditions are met:

[0101] Reach the preset number of iterations;

[0102] The optimal fitness value no longer increases significantly (convergence);

[0103] 2) Output Results

[0104] The current optimal individual is output as the final solution, which is the optimal interface data conversion device layout and interface resource allocation scheme. Before the stopping condition is met, each iteration must proceed to step S4 to allocate interfaces.

[0105] Step S4: Based on the interface resource requirements and constraints, and the resource capabilities of the interface data conversion equipment, execute the second stage of the two-stage collaborative optimization method based on genetic algorithms and mixed-integer programming. This involves using mixed-integer programming for dynamic allocation of access interfaces. Figure 4 As shown; finally, this invention achieves global optimality by jointly evaluating layout cost and allocation cost (fitness calculation in step 3), considering dynamic constraint processing and cost weight balancing, thus realizing the layout of interface data conversion devices and the allocation of interface resources. Specifically, as follows:

[0106] Step S401: Define decision variables

[0107] To describe the interface access to the interface data conversion device, define the following decision variables:

[0108] x i,j =

[0109] A decision variable of 1 indicates that the j-th interface data conversion device provides interface resources for that interface, i.e., the I / O... i Assigned to the j-th interface data conversion device; the decision variable is 0, indicating that the I / O is... i Data conversion device IOM not assigned to this interface j .

[0110] Uniqueness of interface allocation: Each interface must be assigned to a single interface data conversion device;

[0111] , j = 1, 2,..., n.

[0112] To describe the connection of a certain type of interface to an interface data conversion device, define the following decision variables:

[0113] y k,j =

[0114] ,Right now It belongs to one of the g types of interfaces provided by the interface data conversion device.

[0115] The decision variable is 1, and the interface type is io i Assigned to the j-th interface data conversion device; the decision variable is 0, indicating that the I / O is... i Data conversion device IOM not assigned to this interface j .

[0116] Step S402: Define assignment constraints

[0117] 1) Define interface association constraints

[0118] Describe the interface association requirements, interface I / O i io l Data must be assigned to the same interface data conversion device:

[0119] x i,j =x l,j , l m, j n;

[0120] When io i When allocated to a certain IOM, I / O l It must be allocated to this IOM.

[0121] A greedy sorting and allocation strategy is used, defining allocation weight factors, and an interface with no relational relationships, where the weight factor = num. i ×cost i For interfaces with related relationships, the weight factor is defined as the number of the current interface. i ×cost i and the associated interface's num i ×cost i The sum of these factors. All interfaces are sorted according to weighting factors, with those having larger weighting factors allocated first, ensuring a more reasonable allocation in this invention.

[0122] 2) Define the total number of interface types constraints

[0123] The resource constraints for the interface data conversion device's interface type are described, and the resources allocated to the interface data conversion device's IOM are determined. j any type of interface i The sum of the interface resources does not exceed the total interface resources of the data conversion device for that interface, max_type_g j .

[0124] , j = 1, 2,..., n , k = 1, 2,..., g; ...

[0125] , j = 1, 2,..., n, k = 1, 2,..., g.

[0126] To balance the availability and allocation of interface data conversion equipment, any type of interface... i The sum of interface resources can be limited to not exceeding the interface resource threshold of the data conversion device for that interface. The interface resource threshold can be determined by referring to the average proportion of the total number of interfaces of that type to be allocated; this fully considers resource margin and facilitates compatibility with subsequent interface expansion. For example, the threshold for type i interfaces can be defined as (typei_total_num / n) × Gamma, where typei_total_num is the total number of type i interfaces, represents the number of interface data conversion devices, and Gamma represents the balance coefficient, which can be greater than 1, but must be less than max_type_gj / (typei_total_num / n).

[0127] Step S403: Define the objective function

[0128] Minimize allocation cost; the allocation cost for a single interface is defined as follows: cost_ io i This indicates the cost of connecting the interface to a certain interface data conversion device.

[0129] cost_ io i =io_dist×num i ×cost i ;

[0130] `io_dist` represents the distance from the access interface to the data conversion device of that interface. `num` i Indicates the number of access interfaces, ost iThis represents the access cost coefficient of the access interface, which is closely related to the access interface type.

[0131] In two-dimensional space, io_dist can define the distance between two points from the access interface to the data conversion device of that interface.

[0132] In three-dimensional space, io_dist defines the third point, point_right, with coordinates (posi_x). i posi_y i ,iom_p_z j ), posi_x i posi_y i Let x, y coordinates of the access point be iom_p_z. j The z-coordinate of the interface data conversion device is io_dist, which is defined as the sum of the distance from the access interface coordinates to the third point coordinates and the distance from the third point coordinates to the interface data conversion device position coordinates.

[0133] cost_ Allocate This represents the cost of allocating all interfaces to all interface data conversion devices;

[0134] cost_ Allocate = 。

[0135] Step S404: Assignment Solution

[0136] Based on the quantified interfaces and allocation constraints, and combined with the interface data conversion device input in step 3, all interface allocations are completed. It should be noted that the joint cost evaluation of fusion layout cost and interface resource allocation cost is implemented through fitness function design (step S302).

[0137] In summary, this invention provides a method for the layout and interface resource allocation of network transmission and interface conversion equipment in an IMA system. Based on the installation locations, interface types, and quantities of equipment from different vendors, and considering the total resource volume of each interface type and on-board layout constraints, a two-stage collaborative optimization method based on genetic algorithms and mixed-integer programming is employed. This includes spatial layout optimization and dynamic allocation optimization. An improved genetic algorithm is used to optimize the spatial layout of the interface data conversion equipment, and mixed-integer programming is used for the dynamic allocation of access interfaces. Finally, through joint cost evaluation of layout and allocation costs, and considering dynamic constraint processing and cost weight balancing, global optimality is achieved, thus solving the problem of interface data conversion equipment layout and interface resource allocation in an IMA system under multiple constraints.

[0138] Although the present invention has been disclosed above with reference to preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art can make some modifications and improvements without departing from the spirit and scope of the present invention. Therefore, the scope of protection of the present invention shall be defined by the claims.

Claims

1. A method for IMA system interface data conversion equipment layout and interface resource allocation, characterized in that, The method comprises the following steps: S1) determining the on-board installation position of the on-board equipment according to the function of the on-board equipment, and determining the interface type, interface quantity, interface constraint and access cost of the on-board equipment interface using the IMA system data conversion equipment; S2) determining the quantity of the IMA system interface data conversion equipment, the total quantity of each available interface type, and the layout restriction area; S3) formulating a comprehensive optimization strategy for hierarchical optimization layout and interface allocation according to the interface resource demand, the interface data conversion equipment resource capacity and the constraint condition thereof, and performing the first stage optimization of a two-stage collaborative optimization method based on a genetic algorithm and a mixed integer programming; S4) performing the second stage optimization in the two-stage collaborative optimization method based on the genetic algorithm and the mixed integer programming according to the interface resource demand and the constraint condition thereof and the interface data conversion equipment resource capacity; The step S3 optimizes the spatial layout of the interface data conversion equipment by using an improved genetic algorithm, sets the forbidden layout area constraint and the equipment connection constraint, and arranges any interface data conversion equipment outside the forbidden layout area and controls the sum of the interconnection distances of the interface data conversion equipment to implement the equipment connection constraint; The step S3 calculates the individual fitness based on the joint cost, and designs the fitness function as a joint cost evaluation function, fuses the interface access cost by optimizing the layout cost of the interface data conversion equipment, and eliminates the solutions that do not meet the conditions and selects the solution with the highest fitness in the evolution process; The step S4 performs dynamic allocation of the access interface by using a mixed integer programming, and evaluates the joint cost of the layout cost and the allocation cost; considers the dynamic constraint processing and the cost weight balance to achieve the global optimum, realizes the layout of the interface data conversion equipment and the allocation of the interface resource, minimizes the allocation cost, and completes the allocation of all interfaces according to the quantified interface, the allocation constraint and the interface data conversion equipment input by S3.

2. The method for IMA system interface data conversion device layout and interface resource allocation as recited in claim 1, wherein, The step S1 quantifies the access interface according to the following formula: Set of access interfaces: IO m = {io1, io2,..., io m m interfaces of the access IMA system data conversion device io i =(posi i ,type i ,num i ,cost i ,bind i ); posi i = (posi_x i , posi_y i , posi_z i ) ; wherein, io i represents the ith access interface, posi i represents the position of the access interface, posi_x i , posi_y i , posi_z i represents the three-dimensional coordinates of the position; type i represents the type of the access interface, num i represents the number of the access interface; cost i represents the access cost coefficient of the type of access interface, bind i represents the associated requirements of the access interface; The access interface comprises an A429 sending interface, an A429 receiving interface, an A825 interface, an analog quantity interface, a discrete quantity interface and a sensor interface; for the interface equipment without special installation position requirement, the access interface data conversion equipment is installed after the appropriate shortest distance is selected.

3. The method of claim 1, wherein the IMA system interface data conversion device layout and interface resource allocation is performed by a computer system. The step S2 quantifies the equipment according to the following formula: Resource device set: IOM = {iom1, iom2, ..., iom} n There are a total of n interface data conversion modules; iom j = (iom_posi j , max_type_1 j , max_type_2 j ,... max_type_g j ); iom_posi j = (iom_p_x j , iom_p_y j , iom_p_z j ); A set of layout constraint regions: ZONE = {zone1, zone2,..., zone p}, p forbidden layout regions. zone s = (zone_type s , zone_Center s , zone_par1 s , zone_par2 s , zone_par3 s ) ; zone_Center s = (zone_p_x s , zone_p_y s , zone_p_z s ) ; wherein iom j denotes the jth interface data conversion device of the IMA system, iom_posi j denotes the position of the interface data conversion device, iom_p_x j , iom_p_y j , iom_p_z j denote its three-dimensional coordinates; max_type_1 j , max_type_2 j ,... max_type_g j denote the total amount of the 1st, 2nd,... gth type interface of the interface data conversion device; zone s represents the s-th layout restriction area within the layout space, through zone_type s represents the type of the layout restriction area, zone_Center s represents the position of the layout restriction area, specifically through zone_p_x s , zone_p_y s , zone_p_z s determines, zone_par1 s , zone_par2 s , zone_par3 s represents the parameters defining the layout restriction area.

4. The method of claim 1, wherein the IMA system interface data conversion device layout and interface resource allocation is performed by a computer system. The step S3 comprises: Step S301, initializing the population: representing the feasible solution of the problem as a chromosome in the solution space by coding, each gene position corresponding to an interface data conversion equipment and its position coordinates, and generating an initial solution based on the forbidden layout area constraint; Step S302, fitness evaluation: calculating the individual fitness based on the joint cost; Step S303, screening the parent individuals: selecting high-quality individuals as the parents for reproduction according to the fitness. Step S304, genetic crossover and mutation operation: adopt simulated binary crossover, randomly crossover all gene positions of two individuals according to demand, generate a random variable subject to exponential distribution, combine two gene positions to generate a new gene position, thereby generating offspring; randomly disturb the offspring gene by using Gaussian mutation or random mutation, and perform boundary constraint on the gene position after mutation; Step S305, population updating: the new population is composed of offspring and part of the parent generation, or the offspring individuals replace the individuals with lower fitness in the old population; Step S306, termination condition judgment: terminate the algorithm when the preset iteration number is reached and / or the change of the optimal fitness value is less than the preset threshold, and output the current optimal individual as the final solution.

5. The method for IMA system interface data conversion device layout and interface resource allocation as recited in claim 1, wherein, The fitness function is: Fitness = a · cost_dist + β · cost_ + γ · cost_ penalty cost_dist Allocate ； cost_ : represents the cost of connecting interface data conversion devices; cost_ penalty : represents the number of interface data conversion devices layout to forbidden area x penalty coefficient, constraint satisfaction layout limit; The step S303 is one of the following selection methods: Allocate : represents the cost of all interfaces assigned to all interface data conversion devices; α, β, γ are tuned by experiment.

6. The method of claim 4, wherein the IMA system interface data conversion device layout and interface resource allocation is performed by a computer system. roulette selection: allocate selection probability according to the proportion of fitness; tournament selection: randomly select individuals for comparison, and retain the optimal one; ranking selection: allocate probability according to fitness ranking. The step S4 includes:

7. The method of claim 1, wherein the IMA system interface data conversion device layout and interface resource allocation is performed by a computer system. Step S402, set allocation constraints, allocate interfaces with interface association requirements to the same interface data conversion device; define an allocation weight factor based on a greedy ordering allocation strategy, and sort all interfaces according to the weight factor, and interfaces with larger weight factors are preferentially allocated; Step S401, defining decision variable x i,j and y k,j Each interface is assigned to an interface data conversion device; ; i.e. belongs to one of g interface types provided by the interface data conversion device; Step S403, set the objective function according to the minimization allocation cost, and complete the allocation of all interfaces. Setting an interface type total amount constraint, distributing to an interface data conversion device iom j The sum of interface resources of any one interface type type i Does not exceed the total amount of interface resources max_type_g of the interface data conversion device j , and the sum of interface resources of any one interface type type i Does not exceed the interface resource threshold of the interface data conversion device; The step S403 includes:

8. The method of claim 4, wherein the IMA system interface data conversion device layout and interface resource allocation is characterized by, cost_ The single interface allocation cost is defined as cost_ io i , which represents the cost of accessing an interface data conversion device. cost_ io i =io_dist×num i ×cost i ; io_dist represents the distance of the access interface to the interface data conversion device, num i represents the number of the access interface, cost i represents the access cost coefficient of the access interface, cost_ cost_ cost_ cost_ cost_ cost_ cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost cost Allocate represents the cost of all interface distribution to all interface data conversion devices; cost Allocate = .

Images