A method and device for real-time deployment of precision-guided munitions during war

By constructing the transportation cost objective function and using genetic algorithm optimization scheme, the multi-objective optimization problem in real-time allocation of precisely guided munitions during wartime is solved, precise, timely and efficient allocation is achieved, and the controllability of transportation costs and allocation plans is optimized. .

CN117852737BActive Publication Date: 2024-11-22NO 15 INST OF CHINA ELECTRONICS TECH GRP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410067197.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-01-17
Publication Date
2024-11-22
Estimated Expiration
2044-01-17

AI Technical Summary

Technical Problem

The existing technology is difficult to effectively solve the multi-target optimization problem of time, quantity, and transportation costs of real-time allocation of precisely guided munitions in real-time wartime in actual combat environment, especially under the constraints of multi-targets, the transportation from one support center to multiple target units cannot be accurately planned. path.

Method used

By obtaining information about rear warehouses, factories, uninvolved troops and front warehouses, we construct transportation cost objective functions, and combine genetic algorithms to optimize the solution of transporting precisely guided munitions from rear warehouses, factories, and uninvolved troops to front warehouses, and from the front The transportation plan for warehouse transport to each participating troops is considered, time, quantity and size constraints are used to solve multi-objective optimization problems using genetic algorithms.

Benefits of technology

It realizes accurate, timely and efficient real-time allocation of precision-guided munitions during wartime, optimizes transportation costs, improves the timeliness of decision-making and controllability of allocation plans, and meets the needs of real-time allocation and management of precise-guided munitions during wartime in the military.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117852737B_ABST
    Figure CN117852737B_ABST
Patent Text Reader

Abstract

A method and device for real-time deployment of precision-guided munitions in wartime, wherein the method includes: obtaining information of rear warehouses, factories, non-participating troops, forward warehouses and participating troops; wherein the forward warehouses are warehouses on the front line of the battlefield during combat, and the rear warehouses are various fixed warehouses built behind the strategic campaign, which are bases for material storage and supply in the rear of the strategic campaign; constructing a transportation cost objective function, based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-participating troops, the demand volume of precision-guided munitions in the forward warehouses and the transportation cost objective function, determining a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-participating troops to the forward warehouses; based on the location of each participating unit and the required amount of precision-guided munitions, determining a transportation plan for transporting precision-guided munitions from the forward warehouses to each participating unit. The method can accurately, timely and efficiently carry out real-time deployment and support of precision-guided munitions in wartime.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the field of precision guidance, and in particular to a method and a device for real-time deployment of precision guided munitions during war. Background Art

[0002] Precision-guided munitions have the characteristics of high hit accuracy, complex system composition, and high manufacturing cost. It is necessary to timely and accurately control the precision-guided munition support demand and the precision-guided munition support resources to be allocated, and achieve a scientific, reasonable and efficient matching of precision-guided munition support demand and precision-guided munition support resources.

[0003] The existing precision-guided munitions deployment scheme, Wang Guangyuan, Sha Depeng, Zhang Yaoqing, Mao Shichao (2017) considered the optimization problem of missile equipment support scheme under actual combat conditions, combined with transportation scheduling, facility site selection and path planning, studied the equipment parallel distribution problem from multiple supply points to multiple demand points under actual combat conditions, and used the TOPSIS method to comprehensively evaluate the transportation time, transportation mileage, safety factor, carrying capacity, transportation cost and other factors of the equipment distribution route, sorted the comprehensive benefit value of each scheme, established a two-level distribution network model for missile equipment deployment and support, planned the optimal distribution path for each demand point, allocated the optimal distribution quantity, and thus optimized the missile equipment and other equipment and materials of the support troops. However, the optimization model of missile equipment deployment and support scheme under actual combat conditions only considers transportation from a support center to a target unit, and cannot solve the continuous path planning problem of transportation from a support center to multiple target units.

[0004] Wan Chen, Deng Changqi, and Li Jianfeng (2018) considered the equipment scheduling problem of emergency rescue and proposed two optimization goals. The first is to require the earliest completion time of emergency rescue work, and the second is to minimize the total dispatch cost of rescue equipment. A dual-objective optimization scheduling model was established, using the idea of ​​greedy algorithm and hierarchical sequence solution model to save scheduling costs and reduce rescue costs, thereby providing reference and reference for emergency rescue teams to carry out equipment deployment, and timely dispatch of natural disaster emergency rescue equipment, smoothly carry out emergency rescue work, and protect the lives and property of the people. However, the dual-objective optimization scheduling model with the earliest completion time of emergency rescue work and the minimum total dispatch cost of rescue equipment as the goals only considers dual-objective constraints and cannot solve the multi-objective optimization problem of time, quantity, size, and transportation cost of real-time deployment of precision-guided munitions in wartime. Summary of the invention

[0005] The present invention provides a method and device for real-time wartime deployment of precision-guided munitions, which can solve the technical problem of inaccurate deployment schemes for real-time wartime deployment of precision-guided munitions.

[0006] In various method embodiments of the present invention, a method for real-time deployment of precision-guided munitions during wartime is provided, comprising:

[0007] Step S1: Obtain information on rear warehouses, factories, non-combat troops, forward warehouses, and combat troops; wherein the forward warehouses are warehouses on the front line of the battlefield during combat, and the rear warehouses are various fixed warehouses built behind the strategic campaigns, and are bases for material storage and supply behind the strategic campaigns;

[0008] Step S2: constructing a transportation cost objective function, and determining a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function;

[0009] Step S3: Based on the location of each participating force and the required amount of precision-guided munitions, determine the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating force.

[0010] Optionally, the step S1 includes:

[0011] Step S11: Obtain the longitude, latitude, storage capacity of precision-guided ammunition, and priority of each rear warehouse as the transportation starting point, where there are n rear warehouses, and the rear warehouses are recorded as , i=0,1…,n-1, They represent the longitude and latitude of the i-th rear warehouse, and the storage capacity of precision-guided munitions is a 0 ,a 1 ,…,a n-1 , the priority of the transportation starting point is P R ;

[0012] Step S12: Obtain the longitude, latitude, storage capacity of precision-guided munitions, and priority of each factory as the transportation starting point, where there are m factories and the factories are recorded as ,i 1 =0,1,…,m-1, Respectively represent the i 1 The longitude and latitude of the factory are b and the storage capacity of precision-guided munitions is b. 0 ,b 1 ,…,b m-1 , the priority of the transportation starting point is P W ;

[0013] Step S13: Obtain the longitude, latitude, storage capacity of precision-guided munitions, and priority of each non-participating unit as the transportation starting point, where the number of non-participating units is h, and the non-participating units are recorded as ,i 2 =0,1,…,h-1, Respectively represent the i 2The longitude and latitude of the non-combat troops and the storage capacity of precision-guided munitions are e 0 ,e 1 ,…,e h-1 , the demand for precision-guided munitions is f 0 ,f 1 …,f h-1 , the priority of the transportation starting point is P F ;

[0014] Step S14: Obtain the longitude, latitude, precision-guided munitions demand, and precision-guided munitions storage of each forward warehouse, where there are k forward warehouses, and the forward warehouses are recorded as ,i 3 =0,1,…,k-1, Respectively represent the i 3 The longitude and latitude of the forward warehouse, the demand for precision-guided munitions is g 0 ,g 1 ,…,g k-1 , the storage capacity of precision-guided munitions is r 0 ,r 1 ,…,r k-1 ;

[0015] Step S15: Obtain the unit price of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses using different transportation methods. The unit price of road transportation is recorded as u w , the unit price of railway transportation is denoted as u r , the unit price of air transport is recorded as u a ;

[0016] Step S16: construct three constraint matrices for the rear warehouse, factory, and non-combat troops, including the time constraint matrix tdmat for transporting precision-guided munitions to the front warehouse type , the quantity constraint matrix sdmat for transporting precision-guided munitions to the forward warehouse type , size constraint matrix ndmat type , where type={0, 1, 2}, representing rear warehouses, factories, and non-combat troops, respectively. For precision-guided munitions whose length and / or height exceed the preset threshold, road transportation is required; where:

[0017] The meaning of the elements in the constraint matrix is

[0018]

[0019] Among them, i 4 Indicates the starting point of transportation, i 5 Indicates the destination of the transport.

[0020] Preferably, step S2 comprises:

[0021] Step S21: The model automatically selects the mode of transportation for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses according to the constraint matrix. By default, rail transportation is used for transportation. Definition For transporting from rear warehouses, factories and non-combat troops to forward warehouses H j the number of precision-guided munitions;

[0022] make ,

[0023] ,

[0024] ,

[0025] Among them, Z + is a positive integer, The lower bound of the variable is 0, the value is an integer, and there is no upper bound; Indicates rear warehouses, factories, and non-combat troops to the front warehouse H j The shortest path distance between two points;

[0026] Step S22: Calculate the total transportation cost of transporting precision-guided munitions from various rear warehouses, factories, and non-combat troops to the forward warehouse:

[0027] , j = 0, 1, …, k-1, It represents the total transportation cost of transporting precision-guided munitions from various rear warehouses, factories, and non-combat troops to the forward warehouses. Indicates the transfer from the rear warehouse, factory and non-combat troops to the forward warehouse H j Mode of transportation,

[0028] ;

[0029] Among them, u a is the unit price of air transport, u r is the unit price of rail transport, u w is the unit price of road transport, They are transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouse H. j Time constraints, quantity constraints, and size constraints;

[0030] Step S23: Constructing a linear function ,Right now,

[0031] , j = 0, 1, …, k-1,

[0032] It means transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. j The unit cost is RMB / unit; where idx represents the conversion parameter for converting the total transportation cost into the unit cost;

[0033] Step S24: construct a transportation cost objective function, which is:

[0034] ,

[0035] Among them, the first plus symbol represents the sum of all rear warehouses, factories, and non-combat troops.

[0036] Step S25: Determine a constraint condition, which is that the sum of the amount of precision-guided munitions transported from the transport starting point must be less than or equal to the storage capacity of one transport starting point, that is,

[0037] ,

[0038] in, It is the storage capacity in rear warehouses, factories, and transportation starting points for troops not participating in the war;

[0039] Step S26: Based on the storage quantity of precision-guided munitions in rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in forward warehouses, and the transportation cost objective function, a transportation plan for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses is determined.

[0040] Preferably, step S3 comprises:

[0041] Step S31: Obtain the longitude, latitude, and precision-guided munitions requirements of each combat unit, where there are s combat units and the i-th combat unit 6 Combat units are recorded as ,i 6 =0,1,…,s-1, Respectively represent the i 6 The longitude and latitude of a combat unit, the precision-guided munitions required are q 0 ,q 1 ,…,q k-1 ;

[0042] Step S32: define a set:

[0043] ,

[0044] in, From the forward warehouse The i-th delivery 8+1 combat unit, , Indicates forward warehouse Deliver precision-guided munitions to t combat units; assemble Requirements:

[0045] (1) ;

[0046] (2) ;

[0047] Forward warehouse The assembly of combat troops setting out to transport precision-guided munitions, Forward warehouse The assembly of combat troops departing to transport precision-guided munitions, HF j From the front warehouse H j The assembly of combat troops departing to transport precision-guided munitions, F 0 ,F 1 ,…,F S-1 They are s combat units respectively;

[0048] According to the forward warehouses corresponding to the set, for each combat unit that distributes precision-guided munitions corresponding to each forward warehouse, determine the precision-guided munition distribution route according to the order in which the combat units appear in the combat unit array;

[0049] Step S33: Determine the transportation cost corresponding to each delivery route, and then determine the total transportation cost SUM corresponding to all delivery routes

[0050] , where dis(loc 1 ,loc 2 ) indicates the location loc 1 and location loc 2 The geodesic distance between them, unit_cost represents the transportation cost of precision-guided munitions per kilometer, C 1 (loc 1 ,loc 2 ) indicates that the 1 Transporting precision-guided munitions to location loc 2 The cost, Indicates delivery route The cost consumption is: The starting position and target position in The values ​​are , calculate the sum of the transportation costs of precision-guided munitions for each route, any term on the right side of the first formula, for example Indicates delivery route Cost consumption;

[0051] Step S34: The total transportation cost SUM corresponding to all distribution routes is used as the objective function, and is solved by a genetic algorithm. The result is used as the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating unit.

[0052] Preferably, in the genetic algorithm, the gene encoding method of the feasible solution is:

[0053] Step S341: Each combat unit F 0 ,F 1 ,…,F S-1 Randomly sort and get ;

[0054] Step S342: randomly insert u-1 separators sep into the randomly sorted combat unit array to obtain a gene , where u-1 separators sep divide the combat force array into u parts; where each part corresponds to a distribution plan of a forward warehouse; in each part, the precision-guided munitions distribution route is generated according to the order of the combat forces in the randomly sorted combat force array.

[0055] Preferably, the method for real-time deployment of precision-guided munitions during wartime further comprises:

[0056] Step S4: Visually output the intermediate results and final results of the method for real-time deployment of precision-guided munitions in wartime. Visualization methods include charts, roadmaps, and bubble charts.

[0057] In various method embodiments of the present invention, a device for real-time deployment of precision-guided munitions during wartime is provided, comprising:

[0058] Initialization module: configured to obtain information on rear warehouses, factories, non-combat troops, forward warehouses, and combat troops; among them, forward warehouses are warehouses on the front line of the battlefield during combat, and rear warehouses are various fixed warehouses built behind strategic campaigns, which are bases for material storage and supply behind strategic campaigns;

[0059] The first transportation plan module is configured to construct a transportation cost objective function, and determine a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function;

[0060] The second transportation plan module is configured to determine the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating force based on the location of each participating force and the required amount of precision-guided munitions.

[0061] In the above method embodiments of the present invention, a computer-readable storage medium is provided, wherein a plurality of instructions are stored in the storage medium, and the plurality of instructions are used for a processor to load and execute the above method.

[0062] In the above method embodiments of the present invention, an electronic device includes:

[0063] A processor, which is used to execute multiple instructions;

[0064] A memory for storing a plurality of instructions;

[0065] The plurality of instructions are used to be stored in the memory, and loaded and executed by the processor to implement the method as described above.

[0066] The present invention discloses a method for real-time wartime deployment of precision-guided munitions, acquires and processes relevant data on rear warehouses, factories, non-combat troops, forward warehouses and combat troops, wherein the relevant data include location information, storage volume and demand volume of precision-guided munitions, etc.; plans the optimal transportation plan for transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses; plans the optimal transportation plan for transporting precision-guided munitions from forward warehouses to combat troops; outputs the transportation process results of transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses and then to combat troops, including model result status, precision-guided munitions transportation volume matrix, total transportation cost, transportation bubble chart, transportation route, etc.

[0067] The present invention has the following advantages:

[0068] 1. The present invention can accurately, timely and efficiently carry out real-time deployment and support of precision-guided munitions in wartime. The present invention can timely and accurately grasp the quantity and quality of the army's precision-guided munitions, deployment and support requirements, and the execution of deployment plans, and meet the requirements of the army's real-time deployment and management of precision-guided munitions in wartime. The present invention is based on the relevant laws and regulations on the management of the army's precision-guided munitions in wartime, studies the real-time deployment of precision-guided munitions in wartime under the new system, and standardizes and unifies the business process. The present invention provides an important reference for completing the demand application, plan formulation, plan execution, information feedback and other tasks of the army's real-time deployment of precision-guided munitions in wartime in accordance with the business process of real-time deployment of precision-guided munitions in wartime. The present invention improves the real-time control capability of the real-time quantity and quality status of the precision-guided munitions in wartime, helps to formulate the real-time allocation plan of precision-guided munitions in wartime in a rule-based manner, control the execution throughout the process, and provide timely and efficient feedback, thereby optimizing the current business process of real-time allocation management of precision-guided munitions in wartime, thereby realizing the information management of real-time regulation of precision-guided munitions in wartime, so that our military's precision-guided munitions can quickly form combat capability and support capability in real time in wartime.

[0069] 2. The present invention considers transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses, and considers the time constraint matrix, quantity constraint matrix and size constraint matrix of the transportation process. Under the constraints of the storage capacity of rear warehouses, factories and non-combat troops and the demand of forward warehouses, the transportation cost of precision-guided munitions is minimized, multi-objective optimization problems are considered, and the pertinence of the real-time deployment model of precision-guided munitions in wartime is improved.

[0070] 3. The present invention considers the transportation of precision-guided munitions from forward warehouses to combat troops, and uses a genetic algorithm to solve the transportation route of a forward warehouse for multiple combat troops, with a clear focus on support. According to the advancement of the combat process and changes in the situation, the new support focus is accurately determined, and the route for transporting precision-guided munitions from the forward warehouse to the combat troops is adjusted in a timely manner according to the actual situation of each unit.

[0071] 4. The present invention considers a multi-objective optimization model for transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses, and uses a genetic algorithm to solve the transportation path planning for transporting precision-guided munitions from forward warehouses to combat troops, so as to meet the time requirements of the task force to perform the task, and to carry out real-time deployment of precision-guided munitions in wartime in a relatively short period of time, thereby improving the timeliness of decision-making, and reasonably constructing a real-time deployment model for precision-guided munitions in wartime, thereby providing a quantitative method for real-time deployment of precision-guided munitions in wartime and improving the speed of decision-making.

[0072] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0073] The above and other purposes, features and advantages of the present invention will become more apparent by describing the embodiments of the present invention in more detail in conjunction with the accompanying drawings. The accompanying drawings are used to provide a further understanding of the embodiments of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings, the same reference numerals generally represent the same components or steps.

[0074] Figure 1 A schematic flow chart of a method for real-time deployment of precision-guided munitions during wartime according to the present invention;

[0075] Figure 2 It is another flow chart of the method for real-time deployment of precision-guided munitions in wartime according to the present invention;

[0076] Figure 3 A schematic diagram of the process of acquiring and processing data related to rear warehouses, factories, non-combat troops and forward warehouses for the present invention;

[0077] Figure 4A schematic diagram of a flow chart for planning the optimal transportation scheme for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses in the present invention;

[0078] Figure 5 A schematic diagram of a flow chart for planning an optimal transportation scheme for transporting precision-guided munitions from a forward warehouse to combat troops in the present invention;

[0079] Figure 6 Schematic diagram of the process for generating next generation genes for the present invention;

[0080] Figure 7 A flow chart of the present invention using a genetic algorithm to solve the objective function model of minimizing the overall transportation cost and obtaining the optimal transportation plan for transporting precision-guided munitions from a forward warehouse to a combat unit;

[0081] Figure 8 This is a schematic diagram of the structure of a device used for real-time deployment of precision-guided munitions during wartime;

[0082] Fig. 9 The figure is a schematic diagram of the structure of the electronic equipment used for real-time deployment of precision-guided munitions in wartime according to the present invention. DETAILED DESCRIPTION

[0083] Below, the exemplary embodiments according to the present invention will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments of the present invention, and it should be understood that the present invention is not limited to the exemplary embodiments described here.

[0084] It should be noted that unless otherwise specifically stated, the relative arrangement of the components and steps, numerical expressions and numerical values ​​described in these embodiments do not limit the scope of the present invention. It will be appreciated by those skilled in the art that the terms "first", "second", S1, S2, etc. in the embodiments of the present invention are only used to distinguish different steps, devices or modules, etc., and neither represent any specific technical meaning nor represent the necessary logical order between them. It should also be understood that in the embodiments of the present invention, "multiple" may refer to two or more, and "at least one" may refer to one, two or more. It should also be understood that for any component, data or structure mentioned in the embodiments of the present invention, it is generally understood to be one or more in the absence of clear definition or contrary revelation given in the context.

[0085] In addition, the term "and / or" in the present invention is only a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in the present invention generally indicates that the objects associated before and after are in an "or" relationship. It should also be understood that the description of each embodiment of the present invention emphasizes the differences between the embodiments, and the same or similar aspects can be referenced to each other. For the sake of brevity, they will not be repeated one by one.

[0086] The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention and its application or use. Technologies, methods, and devices known to those of ordinary skill in the relevant art may not be discussed in detail, but where appropriate, they should be considered part of the specification. It should be noted that similar reference numerals and letters represent similar items in the following figures, so once an item is defined in one figure, it does not need to be further discussed in subsequent figures.

[0087] Embodiments of the present invention can be applied to electronic devices such as terminal devices, computer systems, servers, etc., which can operate with many other general or special computing system environments or configurations. Examples of well-known terminal devices, computing systems, environments and / or configurations suitable for use with electronic devices such as terminal devices, computer systems, servers, etc. include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, handheld or laptop devices, microprocessor-based systems, set-top boxes, programmable consumer electronics, network personal computers, small computer systems, large computer systems, and distributed cloud computing technology environments including any of the above systems, etc.

[0088] Electronic devices such as terminal devices, computer systems, servers, etc. can be described in the general context of computer system executable instructions (such as program modules) executed by computer systems. Generally, program modules can include routines, programs, object programs, components, logic, data structures, etc., which perform specific tasks or implement specific abstract data types. Computer systems / servers can be implemented in a distributed cloud computing environment, where tasks are performed by remote processing devices linked through a communication network. In a distributed cloud computing environment, program modules can be located on local or remote computing system storage media including storage devices.

[0089] Exemplary Methods

[0090] Figure 1-Figure 2 The flowchart of a method for real-time deployment of precision-guided munitions in wartime provided by an exemplary embodiment of the present invention includes the following steps:

[0091] Step S1: Obtain information on rear warehouses, factories, non-combat troops, forward warehouses, and combat troops; wherein the forward warehouses are warehouses on the front line of the battlefield during combat, and the rear warehouses are various fixed warehouses built behind the strategic campaigns, and are bases for material storage and supply behind the strategic campaigns;

[0092] Step S2: constructing a transportation cost objective function, and determining a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function;

[0093] Step S3: Based on the location of each participating force and the required amount of precision-guided munitions, determine the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating force.

[0094] Furthermore, the method for real-time deployment of precision-guided munitions during wartime also includes:

[0095] Step S4: Visually output various intermediate results and final results of the method for real-time deployment of precision-guided munitions in wartime. Visualization methods include charts, roadmaps, bubble charts, etc.

[0096] The present invention considers transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses, and in the planning process, considers selecting rear warehouses, factories and non-combat troops as transportation starting points with different priorities.

[0097] The present invention considers three constraint matrices for transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses, namely a time constraint matrix, a quantity constraint matrix and a size constraint matrix, and automatically selects a transportation method for transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses according to the constraint matrix.

[0098] The present invention minimizes the transportation cost objective function under the constraint condition of considering the storage capacity of rear warehouses, factories and non-combat troops, and outputs the optimal solution found according to the model result state of transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses and the optimal transportation matrix of transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses.

[0099] The present invention considers transporting precision-guided munitions from forward warehouses to combat units. First, a forward warehouse at the starting point of transportation is selected. Second, a number of combat units are allocated to each forward warehouse. Third, a transportation route for precision-guided munitions starting from the forward warehouse and traversing each combat unit in sequence is planned to optimize the overall transportation time.

[0100] The present invention uses a genetic algorithm to solve a transportation model for transporting precision-guided munitions from a forward warehouse to a combat unit, and obtains an optimal precision-guided munitions transportation plan.

[0101] like Figure 3 As shown, the step S1 includes:

[0102] Step S11: Obtain the longitude, latitude, storage capacity of precision-guided ammunition, and priority of each rear warehouse as the transportation starting point, where there are n rear warehouses, and the rear warehouses are recorded as , i=0,1…,n-1, They represent the longitude and latitude of the i-th rear warehouse, and the storage capacity of precision-guided munitions is a 0 ,a 1 ,…,a n-1 , the priority of the transportation starting point is P R ;

[0103] Step S12: Obtain the longitude, latitude, storage capacity of precision-guided munitions, and priority of each factory as the transportation starting point, where there are m factories and the factories are recorded as ,i 1 =0,1,…,m-1, Respectively represent the i 1 The longitude and latitude of the factory are b and the storage capacity of precision-guided munitions is b. 0 ,b 1 ,…,b m-1 , the priority of the transportation starting point is P W ;

[0104] Step S13: Obtain the longitude, latitude, storage capacity of precision-guided munitions, and priority of each non-participating unit as the transportation starting point, where the number of non-participating units is h, and the non-participating units are recorded as ,i 2 =0,1,…,h-1, Respectively represent the i 2 The longitude and latitude of the rear warehouse, the storage capacity of precision-guided munitions are respectively 0 ,e 1 ,…,e h-1 , the demand for precision-guided munitions is f 0 ,f 1 ,…,f h-1 , the priority of the transportation starting point is P F ;

[0105] Step S14: Obtain the longitude, latitude, precision-guided munitions demand, and precision-guided munitions storage of each forward warehouse, where there are k forward warehouses, and the forward warehouses are recorded as ,i 3=0,1,…,k-1, Respectively represent the i 3 The longitude and latitude of the forward warehouse, the demand for precision-guided munitions is g 0 ,g 1 ,…,g k-1 , the storage capacity of precision-guided munitions is r 0 ,r 1 ,…,r k-1 ;

[0106] Step S15: Obtain the unit price of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses using different transportation methods. The unit price of road transportation is recorded as u w , the unit price of railway transportation is denoted as u r , the unit price of air transport is recorded as u a ;

[0107] Step S16: construct three constraint matrices for the rear warehouse, factory, and non-combat troops, including the time constraint matrix tdmat for transporting precision-guided munitions to the front warehouse type , the quantity constraint matrix sdmat for transporting precision-guided munitions to the forward warehouse type , size constraint matrix ndmat type , where type={0, 1, 2}, representing rear warehouses, factories, and non-combat troops, respectively. For precision-guided munitions whose length and / or height exceed the preset threshold, road transportation is required; where:

[0108] The meaning of the elements in the constraint matrix is

[0109]

[0110] Among them, i 4 Indicates the starting point of transportation, i 5 Indicates the destination of the transport.

[0111] In this embodiment, the unit price of each mode of transportation is shown in Table 1.

[0112] Table 1 Unit prices of different modes of transportation

[0113]

[0114] like Figure 4 As shown, step S2 includes:

[0115] Step S21: Automatically select the mode of transportation for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses according to the constraint matrix, and the default mode of transportation is rail transportation; define For transporting from rear warehouses, factories and non-combat troops to forward warehouses H j the number of precision-guided munitions;

[0116] make ,

[0117] ,

[0118] ,

[0119] Among them, Z + is a positive integer, The lower bound of the variable is 0, the value is an integer, and there is no upper bound; Indicates rear warehouses, factories, and non-combat troops to the front warehouse H j The shortest path distance between two points;

[0120] Step S22: Calculate the total transportation cost of transporting precision-guided munitions from each rear warehouse, factory, and non-combat troops to the forward warehouse

[0121] , j = 0, 1, …, k-1, where It represents the total transportation cost of transporting precision-guided munitions from various rear warehouses, factories, and non-combat troops to the forward warehouses. Indicates the transfer from the rear warehouse, factory and non-combat troops to the forward warehouse H j Mode of transportation,

[0122] ;

[0123] Among them, u a is the unit price of air transport, u r is the unit price of rail transport, u w is the unit price of road transport, They are from the rear warehouse, factory and non-combat troops to the front warehouse H j The time constraints, quantity constraints, and size constraints of transporting precision-guided munitions;

[0124] Step S23: Constructing a linear function ,Right now

[0125] , j = 0, 1, …, k-1,

[0126] It means transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. j The unit cost is RMB / unit; where idx represents the conversion parameter for converting the total transportation cost into the unit cost;

[0127] Step S24: construct a transportation cost objective function, which is:

[0128] ,

[0129] Among them, the first plus symbol represents the sum of all rear warehouses, factories, and non-combat troops.

[0130] Step S25: Determine the constraint condition, which is that the sum of the amount of precision-guided munitions transported from the transport starting point must be less than or equal to the storage capacity of one transport starting point, that is,

[0131] ,

[0132] in, It is the storage capacity in rear warehouses, factories, and transportation starting points for troops not participating in the war;

[0133] Step S26: Based on the storage quantity of precision-guided munitions in rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in forward warehouses, and the transportation cost objective function, a transportation plan for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses is determined.

[0134] like Figure 5 As shown, step S3 includes:

[0135] Step S31: Obtain the longitude, latitude, and precision-guided munitions requirements of each combat unit, where there are s combat units and the i-th combat unit 6 Combat units are recorded as ,i 6 =0,1,…,s-1, Respectively represent the i 6 The longitude and latitude of a combat unit, the precision-guided munitions required are q 0 ,q 1 ,…,q k-1 ;

[0136] Step S32: Define a set

[0137] ,

[0138] in, From the forward warehouse The i-th delivery 8 +1 combat unit, , Indicates forward warehouse Deliver precision-guided munitions to t combat units; assemble Requirements:

[0139] (1) ;

[0140] (2) ;

[0141] Forward warehouse The assembly of combat troops setting out to transport precision-guided munitions, Forward warehouse The assembly of combat troops departing to transport precision-guided munitions, HF j From the front warehouse H j The assembly of combat troops departing to transport precision-guided munitions, F 0 ,F 1 ,…,F S-1 For s combat troops;

[0142] That is: HF 0 , HF 1 ,…, HF k-1 It is a division of a collection of combat forces.

[0143] According to the forward warehouses corresponding to the collection, for each combat unit that distributes precision-guided munitions corresponding to each forward warehouse, determine the precision-guided munition distribution route according to the order in which the combat units appear in the combat unit array.

[0144] .

[0145] Step S33: Determine the transportation cost corresponding to each delivery route, and then determine the total transportation cost SUM corresponding to all delivery routes

[0146] ,

[0147] in, ,

[0148] Among them, dis(loc 1 ,loc 2 ) indicates the location loc 1 and location loc 2 The geodesic distance between them, unit_cost represents the transportation cost of precision-guided munitions per kilometer, C 1 (loc 1 ,loc 2 ) indicates that the 1 Transporting precision-guided munitions to location loc 2 The cost, Indicates delivery route The cost consumption is: The starting position and target position in The values ​​are , calculate the sum of the transportation costs of precision-guided munitions for each route, any term on the right side of the first formula, for example Indicates delivery route Cost consumption;

[0149] Step S34: The total transportation cost SUM corresponding to all distribution routes is used as the objective function, and is solved by a genetic algorithm. The result is used as the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating unit.

[0150] Furthermore, if Figure 6-Figure 7 shown.

[0151] In the genetic algorithm, the gene encoding method of the feasible solution is:

[0152] Step S341: Each combat unit F 0 ,F 1 ,…,F S-1 Randomly sort and get ;

[0153] Step S342: randomly insert u-1 separators sep into the randomly sorted combat unit array to obtain a gene , where u-1 separators sep divide the combat force array into u parts; where each part corresponds to a distribution plan of a forward warehouse; in each part, the precision-guided munitions distribution route is generated according to the order of the combat forces in the randomly sorted combat force array.

[0154] Furthermore, when the genetic algorithm performs a crossover operation on genes in a population, the crossover method includes:

[0155] Perform a crossover operation on genes gene_x and gene_y at a given crossover rate and make appropriate adjustments. Randomly delete redundant separators sep or randomly insert missing separators sep to make the gene contain exactly u-1 separators. Randomly sort the missing pre-warehouses and replace the repeated pre-warehouses in the array to make them legal genes (that is, each pre-warehouse appears only once in the gene, and the gene contains exactly u-1 separators). Obtain two mutated genes and assign them to gene_x_new and gene_y_new respectively.

[0156] Furthermore, when the genetic algorithm performs mutation operation on genes in the population, the mutation method includes:

[0157] The two new genes gene_x_new and gene_y_new are mutated at the given mutation rates, and appropriate adjustments are made. The missing pre-position warehouses are randomly sorted and the repeated pre-position warehouses in the array are replaced to make them legal genes (that is, each pre-position warehouse appears only once in the gene, and the gene contains exactly u-1 separators). The two mutated genes are obtained and are still assigned to gene_x_new and gene_y_new respectively.

[0158] The present invention provides an embodiment of a method for real-time deployment of precision-guided munitions during wartime.

[0159] Step 1: Obtain and process relevant data about rear warehouses, factories, non-combat troops and forward warehouses, including location information, storage volume and demand volume of precision-guided munitions, etc.

[0160] Step 1.1: Get n rear warehouses , i=0,1…,n-1, longitude and latitude, storage capacity of precision-guided munitions a 0 ,a 1 ,…,a n-1 And the priority P of selecting the rear warehouse as the transportation starting point R ,in, Respectively represent the longitude and latitude of the i-th rear warehouse.

[0161] Step 1.2: Get m factories ,i 1 =0,1,…,m-1, longitude and latitude, storage capacity of precision-guided munitions b 0 ,b 1 ,…,b m-1 and the priority P for selecting the factory as the transportation starting point W ,in, Respectively represent the i 1 The longitude and latitude of the factory.

[0162] Step 1.3: Get h non-combat troops ,i 2 =0,1,…,h-1, longitude and latitude, storage capacity of precision-guided munitions e 0 ,e 1 ,…,e h-1 The demand for precision-guided munitions is f 0 ,f 1 ,…,f h-1 And the priority P of selecting non-combat troops as the transportation starting point F ,in, Respectively represent the i 2The longitude and latitude of the non-combatant troops.

[0163] Step 1.4: Get k front warehouses ,i 3 =0,1,…,k-1 longitude and latitude, precision-guided munitions demand g 0 ,g 1 ,…,g k-1 and the storage capacity of precision-guided munitions 0 ,r 1 ,…,r k-1 ,in, Respectively represent the i 3 The longitude and latitude of the forward warehouse.

[0164] Step 1.5: Obtain the unit prices of three modes of transportation for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. The three modes of transportation are road, rail, and air.

[0165] Step 1.6: Determine the three constraint matrices for selecting the mode of transportation. The three constraint matrices are the time constraint matrix, quantity constraint matrix, and size constraint matrix for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. The three constraint matrices (time constraint matrix tdmat type , the quantity constraint matrix sdmat type , the dimension constraint matrix ndmat type ) means the matrix elements in

[0166]

[0167] Among them, i 4 Indicates the starting point of transportation, i 5 Indicates the destination of the transport.

[0168] Step 2: Plan the optimal transportation plan for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses.

[0169] Step 2.1: According to the constraint matrix, select the mode of transportation for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. The default mode is rail transportation.

[0170] Step 2.2: Definition

[0171] =Transport from rear warehouses, factories and non-combat troops to forward warehouses H j The number of precision-guided munitions, j=0,1,…,k-1.

[0172] make

[0173]

[0174]

[0175]

[0176] The lower bound of the variable is 0, the value must be an integer, and there is no upper bound.

[0177] Step 2.3: Use the most accurate WGS-84 ellipsoid and geodesic distance Indicates the surface rear warehouse, factory and non-combat troops to the front warehouse H j The shortest path distance between two points, j=0,1,…,k-1.

[0178] Step 2.4: Calculate the cost of transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the transportation distance from each rear warehouse, factory, and non-combat troops to each forward warehouse and the unit price of the corresponding transportation method.

[0179] ,j=0,1,…,k-1

[0180] in, Indicates the transfer from the rear warehouse, factory and non-combat troops to the forward warehouse H j Mode of transportation,

[0181] ;

[0182] Among them, u a is the unit price of air transport, u r is the unit price of rail transport, u w is the unit price of road transport, They are from the rear warehouse, factory and non-combat troops to the front warehouse H j The time constraints, quantity constraints, and size constraints of transporting precision-guided munitions;

[0183] Step 2.5: Define the cost of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses as a linear function of the number of transported precision-guided munitions, that is,

[0184] , j = 0, 1…, k-1,

[0185] It means transporting precision-guided munitions from rear warehouses, factories and non-combat troops to forward warehouses. jThe unit cost (yuan / piece) is , where idx represents the conversion parameter that converts the total cost of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops into unit cost.

[0186] Step 2.6: Define the transportation cost objective function

[0187] ,

[0188] Step 2.7: Considering the storage capacity and demand, the sum of the amount of precision-guided munitions shipped from a rear warehouse, factory, and non-combat troops must be less than or equal to the storage capacity of a rear warehouse, factory, and non-combat troops. Define the constraints

[0189] ,

[0190] Step 2.8: Under the constraints, minimize the cost objective function and obtain the optimal transportation plan for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses.

[0191] Step 3: Plan the optimal transportation plan for transporting precision-guided munitions from forward warehouses to combat units.

[0192] Step 3.1: Get the longitude, latitude, and ammunition requirements of each combat unit. There are s combat units, and the i-th 6 Combat units are recorded as ,i 6 =0,1,…,s-1, Respectively represent the i 6 The longitude and latitude of a combat unit, the precision-guided munitions required are q 0 ,q 1 ,…,q k-1 ;

[0193] Step 3.2: Select the forward warehouse at the transportation starting point, assign a number of combat troops to each forward warehouse, and plan the precision-guided munitions distribution route:

[0194] ,i=0,1,…,k-1

[0195] Optimize the overall time.

[0196] Step 3.3: Define the collection

[0197] ,i 7 =0,1,…,k-1,

[0198] in, From the forward warehouse The i-th delivery 8 +1 combat unit, . Indicates forward warehouse Deliver precision-guided munitions to t combat units. Requirements:

[0199] (1) ;

[0200] (2) .

[0201] That is: HF 0 , HF 1 ,…, HF k-1 It is a division of a collection of combat forces. Forward warehouse The assembly of combat troops setting out to transport precision-guided munitions, Forward warehouse The assembly of combat troops departing to transport precision-guided munitions, HF j From the front warehouse H j The assembly of combat troops departing to transport precision-guided munitions, F 0 ,F 1 ,…,F S-1 For s combat troops;

[0202] Step 3.4: Define delivery routes The cost consumption is:

[0203] ,

[0204] in, ,

[0205] Among them, dis(loc 1 ,loc 2 ) indicates the location loc 1 and location loc 2 The geodesic distance between them, unit_cost represents the transportation cost of precision-guided munitions per kilometer, C 1 (loc 1 ,loc 2 ) indicates that the 1 Transporting precision-guided munitions to location loc 2 The cost, Indicates delivery route The cost consumption is: The starting position and target position in The values ​​are , calculate the sum of the transportation costs of precision-guided munitions for each route,.

[0206] Step 3.5: Define the total transportation cost SUM

[0207] SUM=C 10 +C 11 +…+C 1 k-1 , where any term on the right side of the formula, for example Indicates delivery route cost consumption.

[0208] Step 3.6: Use genetic algorithm to solve the objective function model of minimizing the overall transportation cost and obtain the optimal transportation plan for transporting precision-guided munitions from the forward warehouse to the combat troops.

[0209] Step 3.6.1: Define the population size of the first generation of genes as num_of_genes.

[0210] Step 3.6.2: Define the maximum number of iterations.

[0211] Step 3.6.3: The αth gene is encoded as α=0,1,…,num_of_genes-1.

[0212] Step 3.6.3.1: Combat Force Array F 0 ,F 1 ,…,F S-1 Randomly sort and get

[0213] ,

[0214] Step 3.6.3.2: Randomly insert u-1 separators sep into the randomly sorted combat force array to obtain a gene

[0215]

[0216] Among them, u-1 separators sep divide the combat force array into u parts. Each part corresponds to a distribution plan of a forward warehouse; in each part, the precision-guided ammunition distribution route is generated according to the combat force order of the combat force array after random sorting. Therefore, a gene corresponds to the overall distribution plan of k forward warehouses. Assume that the i-th part is:

[0217] ,

[0218] It means that starting from the i-th forward warehouse, the delivery route of precision-guided munitions is

[0219] ,

[0220] In particular, there may be a part that is an empty set, which means that the corresponding forward warehouse does not distribute precision-guided munitions to combat troops.

[0221] Step 3.6.4: Select the parent gene.

[0222] Step 3.6.4.1: Calculate the overall delivery cost of each gene corresponding solution.

[0223] Step 3.6.4.2: Sort the overall delivery costs and select the first (num_of_genes * selection rate) genes with the shortest overall delivery time as the winning parent genes, recorded as gene_parents.

[0224] Step 3.6.4.3: Record the lowest overall delivery cost.

[0225] Step 3.6.5: Generate the next generation of genes.

[0226] Step 3.6.5.1: Define the next generation gene population gene_next_generation = gene_parents, where gene_parents represents the number of winning parent genes.

[0227] Step 3.6.5.2: Select: Select two parent genes gene_x and gene_y from the parent genes gene_parents;

[0228] Step 3.6.5.3: Crossover: Perform a crossover operation on genes gene_x and gene_y at a given crossover rate and make appropriate adjustments to make them legal genes (i.e., each front warehouse appears only once in the gene and the gene contains exactly u-1 separators), and obtain two mutated genes, which are assigned to gene_x_new and gene_y_new respectively.

[0229] Step 3.6.5.4: Mutation: Mutate the two new genes gene_x_new and gene_y_new at the given mutation rates, and make appropriate adjustments to make them legal genes (that is, each front warehouse appears only once in the gene, and the gene contains exactly u-1 separators). The two mutated genes are still assigned to gene_x_new and gene_y_new respectively.

[0230] Step 3.6.5.5: Add: Calculate the overall transportation costs cost_x and cost_y for the corresponding solutions of genes gene_x_new and gene_y_new respectively. Compare cost_x and cost_y, and add the gene with the smaller overall delivery cost to the next generation gene population gene_next_generation.

[0231] Step 3.6.5.6: Repeat Step 3.6.3.2 to Step 3.6.3.5 until the number of the next generation gene population gene_next_generation is num_of_genes.

[0232] Step 3.6.6: Iteration: Repeat Step 3.6.4 and Step 3.6.5 until the loop stop threshold is reached (the maximum number of iterations is reached, or the minimum overall transportation cost no longer decreases within the set number of iterations).

[0233] Step 3.6.7: Output the distribution plan.

[0234] Output the shortest overall transportation cost and its corresponding gene, and obtain the optimal precision-guided munitions transportation plan from the forward warehouse to the combat troops from the gene.

[0235] Since the iterative (evolutionary) process of the genetic algorithm contains several random steps, even under the same settings, the results obtained after running the algorithm will vary greatly. Therefore, the relatively optimal solution can be obtained by running the algorithm multiple times.

[0236] Step 4: Output the results of the transportation process of precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses and then to combat troops, including model result status, precision-guided munitions transportation volume matrix, total transportation cost, transportation bubble chart, transportation route, algorithm iteration process and number of iterations, etc.

[0237] Step 4.1: Output the model result state of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses to find the optimal solution.

[0238] Step 4.2: Output the optimal transportation matrix for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. Each row of the transportation matrix represents the amount of precision-guided munitions transported from rear warehouses, factories, and non-combat troops to forward warehouses, and each column represents the amount of precision-guided munitions received by the forward warehouse from rear warehouses, factories, and non-combat troops.

[0239] Step 4.3: Output the total transportation cost of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses.

[0240] Step 4.4: Output the transportation bubble diagram of precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses.

[0241] Step 4.5: Output the overall transportation cost and overall transportation route map for transporting precision-guided munitions from the forward warehouse to the combat troops.

[0242] Step 4.6: Output the algorithm iteration process and number of iterations for transporting precision-guided munitions from the forward warehouse to the combat troops.

[0243] Exemplary Devices

[0244] Figure 8 FIG. 1 is a schematic diagram of a device for real-time deployment of precision-guided munitions during wartime, provided by an exemplary embodiment of the present invention. Figure 8 As shown, this embodiment includes:

[0245] Initialization module: configured to obtain information on rear warehouses, factories, non-combat troops, forward warehouses, and combat troops; among them, forward warehouses are warehouses on the front line of the battlefield during combat, and rear warehouses are various fixed warehouses built behind strategic campaigns, which are bases for material storage and supply behind strategic campaigns;

[0246] The first transportation plan module is configured to construct a transportation cost objective function, and determine a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function;

[0247] The second transportation plan module is configured to determine the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating force based on the location of each participating force and the required amount of precision-guided munitions.

[0248] Exemplary Electronic Devices

[0249] Fig. 9 This is the structure of an electronic device 90 provided by an exemplary embodiment of the present invention. The electronic device may be any one or both of the first device and the second device, or a stand-alone device independent of them, and the stand-alone device may communicate with the first device and the second device to receive the collected input signals from them. Fig. 9 FIG. 1 is a block diagram of an electronic device according to an embodiment of the present disclosure. Fig. 9As shown, the electronic device includes one or more processors 91 and memory 92 .

[0250] The processor 91 may be a central processing unit (CPU) or other forms of processing units having data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device to perform desired functions.

[0251] The memory 92 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and / or cache memory (cache), etc. The non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 91 may run the program instructions to implement the method for real-time deployment of precision-guided munitions in wartime and / or other desired functions of the software program of each embodiment of the present disclosure described above. In one example, the electronic device may also include: an input device 93 and an output device 94, which are interconnected through a bus system and / or other forms of connection mechanisms (not shown).

[0252] In addition, the input device 93 may also include, for example, a keyboard, a mouse, and the like.

[0253] The output device 94 can output various information to the outside. The output device 94 can include, for example, a display, a speaker, a printer, a communication network and a remote output device connected thereto.

[0254] Of course, to simplify, Fig. 9 Only some of the components related to the present disclosure in the electronic device are shown, and components such as a bus, an input / output interface, etc. are omitted. In addition, according to specific application situations, the electronic device may further include any other appropriate components.

[0255] Exemplary computer program products and computer-readable storage media

[0256] In addition to the above-mentioned methods and devices, an embodiment of the present disclosure may also be a computer program product, which includes computer program instructions, which, when executed by a processor, enable the processor to execute the steps of the method for real-time wartime deployment of precision-guided munitions according to various embodiments of the present disclosure described in the above-mentioned "Exemplary Method" section of this specification.

[0257] The computer program product may be written in any combination of one or more programming languages ​​to write program code for performing the operations of the disclosed embodiments, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0258] In addition, an embodiment of the present disclosure may also be a computer-readable storage medium having computer program instructions stored thereon, which, when executed by a processor, causes the processor to execute the steps of the method according to various embodiments of the present disclosure described in the above “Exemplary Method” section of this specification.

[0259] The computer readable storage medium can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can include, for example, but is not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0260] The basic principles of the present disclosure are described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, effects, etc. mentioned in the present disclosure are only examples and not limitations, and it cannot be considered that these advantages, strengths, effects, etc. are required by each embodiment of the present disclosure. In addition, the specific details disclosed above are only for the purpose of illustration and ease of understanding, and are not limitations. The above details do not limit the present disclosure to the necessity of adopting the above specific details to be implemented.

[0261] Each embodiment in this specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0262] The block diagrams of the devices, apparatuses, equipment, and systems involved in this disclosure are only illustrative examples and are not intended to require or imply that they must be connected, arranged, and configured in the manner shown in the block diagrams. As will be appreciated by those skilled in the art, these devices, apparatuses, equipment, and systems can be connected, arranged, and configured in any manner. Words such as "including", "comprising", "having", etc. are open words, referring to "including but not limited to", and can be used interchangeably with them. The words "or" and "and" used here refer to the words "and / or" and can be used interchangeably with them, unless the context clearly indicates otherwise. The word "such as" used here refers to the phrase "such as but not limited to", and can be used interchangeably with it.

[0263] The method and apparatus of the present disclosure may be implemented in many ways. For example, the method and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above order of steps for the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above, unless otherwise specifically stated. In addition, in some embodiments, the present disclosure may also be implemented as a program recorded in a recording medium, which includes machine-readable instructions for implementing the method according to the present disclosure. Therefore, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.

[0264] It should also be noted that in the apparatus, equipment and method of the present disclosure, each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be regarded as equivalent schemes of the present disclosure. The above description of the disclosed aspects is provided to enable any technician in the field to make or use the present disclosure. Various modifications to these aspects are very obvious to those skilled in the art, and the general principles defined herein can be applied to other aspects without departing from the scope of the present disclosure. Therefore, the present disclosure is not intended to be limited to the aspects shown here, but to the widest scope consistent with the principles and novel features disclosed herein.

[0265] The above description has been given for the purpose of illustration and description. In addition, this description is not intended to limit the embodiments of the present disclosure to the forms disclosed herein. Although multiple example aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, changes, additions and sub-combinations thereof.

Claims

1. A method for real-time deployment of precision-guided munitions during wartime, characterized in that: The method comprises the following steps: Step S1: Obtain information on rear warehouses, factories, non-combat troops, forward warehouses, and combat troops; wherein the forward warehouses are warehouses on the front line of the battlefield during combat, and the rear warehouses are various fixed warehouses built behind the strategic campaigns, and are bases for material storage and supply behind the strategic campaigns; Step S2: constructing a transportation cost objective function, and determining a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function; Step S3: Based on the location of each participating force and the amount of precision-guided munitions required, determine the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating force. The step S1 comprises: Step S11: Obtain the longitude, latitude, storage capacity of precision-guided ammunition, and priority of each rear warehouse as the transportation starting point, where there are n rear warehouses, and the rear warehouses are recorded as , i=0,1,…,n-1, They represent the longitude and latitude of the i-th rear warehouse, and the storage capacity of precision-guided munitions is a0, a1, …, a n-1 , the priority of the transportation starting point is P R ; Step S12: Obtain the longitude, latitude, storage capacity of precision-guided munitions, and priority of each factory as the transportation starting point, where there are m factories and the factories are denoted as , i1=0,1,…,m-1, denote the longitude and latitude of the i1th factory respectively, and the storage capacity of precision-guided munitions is b0, b1, …, b m-1 , the priority of the transportation starting point is P W ; Step S13: Obtain the longitude, latitude, storage capacity of precision-guided munitions, and priority of each non-participating unit as the transportation starting point, where the number of non-participating units is h, and the non-participating units are recorded as , i2=0,1,…,h-1, They represent the longitude and latitude of the i2th non-combat unit, and the storage capacity of precision-guided munitions is e0, e1, …, e h-1 , the demand for precision-guided munitions is f0,f1,…,f h-1 , the priority of the transportation starting point is P F ; Step S14: Obtain the longitude, latitude, precision-guided munitions demand, and precision-guided munitions storage of each forward warehouse, where there are k forward warehouses, and the forward warehouses are recorded as , i3=0,1,…,k-1, They represent the longitude and latitude of the i3th forward warehouse, and the demand for precision-guided munitions is g0, g1, …, g k-1 , the storage capacity of precision-guided munitions is r0, r1, …, r k-1 ; Step S15: Obtain the unit price of transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses using different transportation methods. The unit price of road transportation is recorded as u w , the unit price of railway transportation is denoted as u r , the unit price of air transport is recorded as u a ; Step S16: construct three constraint matrices for the rear warehouse, factory, and non-combat troops, including the time constraint matrix tdmat for transporting precision-guided munitions to the front warehouse type , the quantity constraint matrix sdmat for transporting precision-guided munitions to the forward warehouse type , size constraint matrix ndmat type , where type={0, 1, 2}, respectively representing rear warehouses, factories, and non-combat troops. For precision-guided munitions whose length and / or height exceed the preset threshold, road transportation is required; where: The meaning of the elements in the constraint matrix is: , Among them, i4 represents the transportation starting point, i5 represents the transportation end point, The step S2 comprises: Step S21: Automatically select the mode of transportation for transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses according to the constraint matrix, and the default mode of transportation is rail transportation; define For transporting from rear warehouses, factories and non-combat troops to forward warehouses H j the number of precision-guided munitions; make , , , Among them, Z + is a positive integer, The lower bound of the variable is 0, the value is an integer, and there is no upper bound; Indicates rear warehouses, factories, and non-combat troops to the front warehouse H j The shortest path distance between two points; Step S22: Calculate the total transportation cost of transporting precision-guided munitions from each rear warehouse, factory, and non-combat troops to the forward warehouse: , j = 0, 1, …, k-1, It represents the total transportation cost of transporting precision-guided munitions from various rear warehouses, factories, and non-combat troops to the forward warehouses. Indicates the transfer from the rear warehouse, factory and non-combat troops to the forward warehouse H j Mode of transportation, ; Among them, u a is the unit price of air transport, u r is the unit price of rail transport, u w is the unit price of road transport, They are transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouse H. j Time constraints, quantity constraints, and size constraints; Step S23: Constructing a linear function ,Right now ,j=0,1,…,k-1, It means transporting precision-guided munitions from rear warehouses, factories, and non-combat troops to forward warehouses. j The unit cost is RMB / unit; where idx represents the conversion parameter for converting the total transportation cost into the unit cost; Step S24: construct a transportation cost objective function, which is: , The first plus sign indicates the sum of all rear warehouses, factories, and non-combat troops. Step S25: Determine the constraint condition, which is that the sum of the amount of precision-guided munitions transported from the transport starting point must be less than or equal to the storage capacity of one transport starting point, that is, , in, It is the storage capacity in rear warehouses, factories, and transportation starting points for troops not participating in the war; Step S26: Based on the storage amount of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function, a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses is determined. The step S3 comprises: Step S31: Obtain the longitude, latitude, and precision-guided munitions requirements of each combat unit, where there are s combat units, and the i6th combat unit is recorded as , i6=0,1,…,s-1, They represent the longitude and latitude of the i6th combat unit, and the demand for precision-guided munitions is q0, q1, …, q k-1 ; Step S32: define a set: , in, From the forward warehouse The i8+1th combat unit set out for distribution, , , Indicates forward warehouse Deliver precision-guided munitions to t combat units; assemble Requirements: (1) ; (2) ; Forward warehouse The assembly of combat troops setting out to transport precision-guided munitions, Forward warehouse The assembly of combat troops departing to transport precision-guided munitions, HF j From the front warehouse H j The set of combat forces that set out to transport precision-guided munitions, F0, F1, …, F S-1 They are s combat units respectively; According to the forward warehouses corresponding to the set, for each combat unit that distributes precision-guided munitions corresponding to each forward warehouse, determine the precision-guided munition distribution route according to the order in which the combat units appear in the combat unit array; Step S33: Determine the transportation cost corresponding to each delivery route, and then determine the total transportation cost SUM corresponding to all delivery routes: , Where dis(loc1,loc2) represents the geodesic distance between location loc1 and location loc2, unit_cost represents the transportation cost of precision-guided munitions per kilometer, and C1(loc1,loc2) represents the cost of transporting precision-guided munitions from location loc1 to location loc2. Indicates delivery route The cost consumption is: The starting position and target position in The values ​​are , calculate the sum of the transportation costs of precision-guided munitions for each route, and use it as the right side of any term in the first formula in this step Indicates delivery route Cost consumption; Step S34: The total transportation cost SUM corresponding to all distribution routes is used as the objective function, and is solved by a genetic algorithm. The result is used as the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating unit.

2. The method according to claim 1, characterized in that In the genetic algorithm, the gene encoding method of the feasible solution is: Step S341: Assign each combat unit F0, F1, ..., F S-1 Randomly sort and get ; Step S342: randomly insert u-1 separators sep into the randomly sorted combat unit array to obtain a gene , where u-1 separators sep divide the combat force array into u parts; where each part corresponds to a distribution plan of a forward warehouse; in each part, the precision-guided munitions distribution route is generated according to the order of the combat forces in the randomly sorted combat force array.

3. The method according to any one of claims 1 to 2, characterized in that: The method for real-time deployment of precision-guided munitions during wartime also includes: Step S4: Visually output the intermediate results and final results of the method for real-time deployment of precision-guided munitions during wartime, and the visualization methods include charts, roadmaps, and bubble charts.

4. A device for real-time deployment of precision-guided munitions during wartime, characterized in that: For implementing the method according to any one of claims 1 to 3, the device comprises: Initialization module: configured to obtain information on rear warehouses, factories, non-combat troops, forward warehouses, and combat troops; among them, forward warehouses are warehouses on the front line of the battlefield during combat, and rear warehouses are various fixed warehouses built behind strategic campaigns, which are bases for material storage and supply behind strategic campaigns; The first transportation plan module is configured to construct a transportation cost objective function, and determine a transportation plan for transporting precision-guided munitions from the rear warehouses, factories, and non-combat troops to the forward warehouses based on the storage volume of precision-guided munitions in the rear warehouses, factories, and non-combat troops, the demand for precision-guided munitions in the forward warehouses, and the transportation cost objective function; The second transportation plan module is configured to determine the transportation plan for transporting precision-guided munitions from the forward warehouse to each participating force based on the location of each participating force and the required amount of precision-guided munitions.

5. A computer-readable storage medium, characterized in that: The storage medium stores a plurality of instructions; the plurality of instructions are used for a processor to load and execute the method as described in any one of claims 1 to 3.

6. An electronic device, characterized in that: The electronic device comprises: A processor, which is used to execute multiple instructions; A memory for storing a plurality of instructions; The plurality of instructions are used to be stored in the memory and loaded and executed by the processor according to any one of claims 1 to 3.