CN1845155A - Rapid command control method of rapid deployment for war field mechanization infantry - Google Patents

Abstract

The invention relates to a quick command control method for quickly low-risk deploying mechanization infantry on the battlefield. Wherein, the commanded object the all mechanization infantries; according to the lengths from different concentrate points to different deploy points, the transmission non-baffler probability, the deploy amount at the concentrate point, the needed amount at the deploy point, and the speed and load of transmission device, the command control mode purposed for transmitting all infantries in minimum time is built, with lower calculation complexity and high solvability; and using linear programming, and the pair rule of linear programming, to solve said mode, and improve the result via the two-dimension table, to obtain the command control method that meeting the demand of quick deploy time. The invention can improve the battle effectiveness, with wider application. The invention also provides relative technique.

Description

Quick commander's control method that a kind of battlefield mechanized infantry disposes fast

Technical field the present invention relates to national defence and association area, is used for the battlefield mechanized infantry is disposed enforcement commander's control fast fast, realizes the quick deployment to the battlefield mechanized infantry.

Background technology is implemented quick mechanized infantry's transportation between battlefield mechanized infantry's assembly place and deployment point commander's control is an important component part of operational commanding control, length according to mechanized infantry's transportation route from different assembly places to different deployment points, the without hindrance transportation probability of transportation route, the assembly place infantry can the deployment amount and the deployment point to infantry's demand, the speed of means of transport and carrying capacity, structure is that to be the battlefield commander to the battlefield mechanized infantry dispose fast implements the key issue that commander's control fast must solve for target and the commander's control plan with low computational complexity and high solvability to transport all infantries minimum that expends time in, the solution of this problem is for increasing substantially fighting capacity, minimizing has crucial meaning to the demand of deployment mechanized infantry's means of transport.

Mobile operations are most important for the triumph of capturing IT-based warfare, complicated battlefield surroundings may impact the traffic capacity of the transportation route of disposing the mechanized infantry, thereby reduce the passage rate of means of transport, and commander's control of disposing the mechanized infantry between combat division or trip and the subordinate fast is the key that improves mobile operations, and wherein the matter of utmost importance that must solve is commander's control plan of the deployment mechanized infantry of formulation science.The quality of this plan, not only be related to implement the battlefield mechanized infantry dispose the transport resource that consumes how much, can in time arrive the deployment point but also be related to the mechanized infantry, to guarantee that fighting capacity is unlikely to descend because of the delay that the mechanized infantry transports.

For the battlefield mechanized infantry dispose and commander's control of this deployments the time seem more important, constraint condition that therefore must be by reducing commander's controlling models, by antithesis analyze the choose reasonable parameter improve solvability and with deployment time minimum come the battlefield mechanized infantry disposed fast as optimization aim and implement to command fast to control.

The present invention relates to quick commander's control method that the battlefield mechanized infantry disposes fast, relate to military affairs and association area, the object of commander's control is all battlefield mechanized infantries, this method is according to the length of the mechanized infantry's transportation route from different assembly places to different deployment points, the without hindrance transportation probability of transportation route, the assembly place infantry can the deployment amount and the deployment point to infantry's demand, the speed of means of transport and carrying capacity, structure is target and the commander's controlling models with low computational complexity and high solvability to transport all infantries minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meet the option control command that quick deployment time requires until final acquisition, this method has efficiently, simply, objective, characteristics are widely used and obviously improve its combat capabilities etc., can be widely used in quick commander's control that all battlefield mechanized infantries dispose fast, the invention further relates to the technology that realizes this method.

Summary of the invention the present invention is according to the length of the mechanized infantry's transportation route from different assembly places to different deployment points, the without hindrance transportation probability of transportation route, the assembly place infantry can the deployment amount and the deployment point to infantry's demand, the speed of means of transport and carrying capacity, structure is target and the commander's controlling models with low computational complexity and high solvability to transport all infantries minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution this model, obtain to implement to command the scheme of controlling with two-dimentional form description the battlefield mechanized infantry is disposed fast, and check whether this option control command meets the time demand of finishing whole battlefield mechanized infantry's deployment task, if do not meet the demands, then by analysis to this two dimension commander control form, and according to shadow price, the time bottleneck can be adjusted for the mechanized infantry's quantity of deployment and the means of transport of enforcement deployment etc. the relevant episode node, constantly repeat this and find the solution-check analytic process, meet the option control command that the battlefield mechanized infantry requires quick deployment time until final acquisition.Therefore, the battlefield mechanized infantry conception of quick commander's control of deployment is fast proposed, introduce the analytical approach of the without hindrance transportation probability of transportation route, set up linear programming and the dual program model of seeking optimum option control command, come this model of rapid solving by reducing constraint condition, obtain to implement to command the scheme of controlling with two-dimentional form description the battlefield mechanized infantry is disposed fast, and according to finishing the time requirement that whole mechanized infantry disposes, by searching the time bottleneck that whole battlefield mechanized infantry's deployment task is finished in influence, the assembly place can be adjusted for the unreasonable configuration of mechanized infantry's quantity of disposing with to the means of transport of implementing to dispose, continue to optimize and improve this option control command, and the final time requirement that obtains to satisfy the quick deployment of battlefield mechanized infantry, option control command with two-dimentional form description becomes key character of the present invention.

The technical scheme of quick commander's control method that a kind of battlefield mechanized infantry of the present invention disposes fast is:

At first, the quick deployment issue of battlefield mechanized infantry is defined as the supply and demand system that the party in request (deployment point) by mechanized infantry's supplier (assembly place) and mechanized infantry is constituted, the feature of this system can be used the length of the transportation route of disposing from different suppliers to the different mechanized infantries of party in request, the without hindrance transportation probability of transportation route, supplier mechanized infantry's supply and the mechanized infantry's of party in request demand, the speed and the carrying capacity of means of transport are described, and according to the time requirement that the battlefield mechanized infantry is disposed, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose and to transport all mechanized infantries minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution this model, obtain to implement to command the scheme of controlling with two-dimentional form description the battlefield mechanized infantry is disposed fast, time bottleneck by continuous searching supply and demand system, quantity to relevant supplier's mechanized infantry is carried out reasonable disposition, adopt methods such as different means of transports, the final time requirement that obtains to satisfy the quick deployment of battlefield mechanized infantry, the battlefield mechanized infantry is disposed the scheme of implementing commander's control fast, finish commander's control that the battlefield mechanized infantry is disposed fast.

The quick commander that the battlefield mechanized infantry is disposed controls, the computational complexity and the needed computing time of finding the solution commander's linear programming of controlling models and dual program should not exerted an influence to the real-time of commander's control decision, therefore reducing unnecessary constraint condition is the important measures that improve commander's control decision real-time, for computational complexity that reduces commander's controlling models and the solvability that improves commander's controlling models, stipulate that the constraint condition relevant with party in request (deployment point) is the constraint condition that equals party in request's demand, the constraint condition relevant with supplier (assembly place) is to be not more than the constraint condition that supplier's maximum can supply the deployment amount.

The traffic capacity of the transportation route that complicated battlefield surroundings may be disposed the mechanized infantry impacts, thereby reduce the passage rate of means of transport, for being the commander control of target to transport mechanized infantry's minimum that expends time in, this reduction has been equivalent to increase the length of transportation route, transportation route length after claiming to increase is equivalent path length, introduced the without hindrance transportation probability of transportation route and solved relevant issues in order to consider this influence, the without hindrance transportation probability of transportation route is with the function of time as variable, equivalent transportation route length then is with the function of the without hindrance transportation probability of actual shipment path and relevant transportation route as variable, when the without hindrance transportation probability of transportation route is 1, actual shipment path and equivalent transportation route equal in length, and the without hindrance transportation probability of transportation route is more little, and then compare equivalent transportation route length with the actual shipment path just long more.

Usually, the target of the objective function of commander's controlling models is for making deployment and transporting all mechanized infantries minimum that expends time in, but when the without hindrance transportation probability of the transportation route in all paths was 1, the target of the objective function of this commander's controlling models was simultaneously also for making deployment and transport all mechanized infantries the carrying capacity that needs to be minimum.

Find the solution commander's controlling models by the method for finding the solution linear programming and finding the solution the dual program of linear programming, can obtain respectively to dispose and transport the minimum time that the mechanized infantry needs to different parties in request from different suppliers, the shadow price relevant with different parties in request constraint condition with different suppliers, the result that will find the solution inserts in a kind of two dimension commander's control form again, by analysis to this form, and according to shadow price, the time bottleneck is adjusted correlation parameter, constantly find the solution and update, can finally obtain to meet the option control command that the battlefield mechanized infantry requires quick deployment time.

Can describe the quantity of disposing and transporting the mechanized infantry from each supplier to each party in request, the size that each party in request needs transport power, the quantity of means of transport, the minimum time and relevant shadow price that transportation expends by the zones of different in the two dimension commander control form, the situation of change of quantity, residue mechanized infantry quantity that each supplier supplies the mechanized infantry is with relevant shadow price and deployment and transport the minimum time that all mechanized infantries expend.

If the option control command of trying to achieve can not satisfy the preset time requirement, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence the bottleneck that the battlefield mechanized infantry disposes T.T., again by supplier's mechanized infantry's quantity being carried out reasonable disposition, increasing the quantity of means of transport and adopt different means such as means of transport, eliminate the time bottleneck, and repeat this process, until the predetermined requirement that meets T.T. of finishing battlefield mechanized infantry deployment and transportation.

Quick commander's control method that the battlefield mechanized infantry of the present invention's design disposes fast is applicable to that it is key character of the present invention that all battlefield mechanized infantries dispose fast.

The case study of quick commander's control that the battlefield mechanized infantry disposes fast is as follows.

Supposing that the quick deployment issue of battlefield mechanized infantry can be used by m supply mechanized infantry's assembly place and n demand mechanized infantry's deployment point and between different supply and demand nodes exists the network in a Transport Machinery infantry's path to describe, and is x from supplying mechanized infantry's quantity that node i transports to demand node j _Ij, the without hindrance transportation probability of transportation route is p _Ij(t), the physical length of transportation route is r _Ij, the equivalent length of transportation route is d _IjThe without hindrance transportation probability of transportation route is meant that complicated battlefield surroundings may impact the traffic capacity of mechanized infantry's transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport mechanized infantry's minimum that expends time in, this reduction has been equivalent to increase the length of transportation route, transportation route length after claiming to increase is equivalent path length, the without hindrance transportation probability of transportation route is with the function of time as variable, equivalent transportation route length then is with the function of the without hindrance transportation probability of actual shipment path and relevant transportation route as variable, when the without hindrance transportation probability of transportation route is 1, actual shipment path and equivalent transportation route equal in length.

The problem that need to solve is that one of design is transported the mechanized infantry to n deployment point from m assembly place, make the carrying capacity and the consumed time of transporting all mechanized infantry's costs be minimum movement plan simultaneously, and calculate the quantity that the required means of transport of mechanized infantry is transported in each assembly place, it is as follows that relevant mechanized infantry disposes commander controlling models and linear programming equation:

Objective function: $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}}$

Deployment point demand constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}=D_j,$ (j＝1，…，n)

Assembly place supply constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}\≤S_i,$ (i＝1，…，m)

Condition of Non-Negative Constrains: x _Ij〉=0, (i=1 ..., m; J=1 ..., n)

The equivalent length of transportation route is: d _Ij=f (r _Ij, p _Ij(t)), (0＜p _Ij(t)≤1; I=1 ..., m; J=1 ..., n)

Assembly place i (i=1 ... m) the means of transport quantity V of Xu Yaoing _i:

From assembly place i (i=1 ... m) transport the mechanized infantry to deployment point j (j=1 ... n) spent time: $T_{\mathrm{ij}}=\frac{d_{\mathrm{ij}}}{C}$

Finish all mechanized infantries and dispose spent minimum time: minT=max{T _Ij}

Wherein:

M is supply mechanized infantry's assembly place sum;

N is demand mechanized infantry's a deployment point sum;

r _IjFor assembly place i (i=1 ... m) with deployment point j (j=1 ... the physical length of the transportation route n) (unit: kilometer);

p _Ij(t) be assembly place i (i=1 ... m) with deployment point j (j=1 ... n) the without hindrance transportation probability of the transportation route between is with the function of time t as variable;

d _IjFor assembly place i (i=1 ... m) with deployment point j (j=1 ... the equivalent length of the transportation route n) (unit: kilometer), work as p _Ij(t)=1 o'clock, r _IjWith d _IjEquate;

V _iFor the supply mechanized infantry assembly place i (i=1 ... m) transport the means of transport quantity that the mechanized infantry needs;

L transports mechanized infantry's ability (unit: the people) for each means of transport;

C transports mechanized infantry's speed (unit: kilometer/hour) for each means of transport;

S _iFor assembly place i (i=1 ... m) can supply mechanized infantry's quantity (unit: the people);

D _jFor deployment point j (j=1 ... n) need mechanized infantry's quantity (unit: the people);

Above-mentioned model shows: try to achieve by linear programming on the basis of minZ value, can calculate mechanized infantry's quantity x that each assembly place must be transported to the related deployment point _Ij,, can calculate the means of transport quantity V that each assembly place needs again according to the dead weight capacity L of means of transport _iTransport mechanized infantry's speed C and the longest path between assembly place and deployment point at last according to means of transport, can calculate again and finish the spent shortest time T of whole mechanized infantry's deployment task, thereby realize that the commander that the battlefield mechanized infantry is disposed fast controls, for constraint condition rationally being set, improving solvability, utilizing above-mentioned linear programming model better, the dual linear programming model that provides this model is as follows:

Objective function: $\max G=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{D}_j{y}_j+\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{S}_i{y}_{n+i}$

Constraint condition: D _jy _j+ S _iy _N+i≤ d _Ij, (i=1 ..., m; J=1 ..., n)

Condition of Non-Negative Constrains: y _j, y _N+i〉=0, (i=1 ..., m; J=1 ..., n)

Wherein: y _j, y _N+iBe respectively shadow price or the relevant decision variable of opportunity cost with the demand of former linear programming and supply mechanized infantry constraint condition,

Since primal linear programming solves be with deployment point j and assembly place i (i=1 ..., m; J=1 ..., the resource optimal utilization problem that constraint condition n) is relevant, thus dual program solve then be estimate to make deployment point j and assembly place i (i=1 ..., m; J=1 ..., constraint condition n) satisfies the cost problem that must pay, promptly uses the valency problem, and shadow price y _jAnd y _N+iReflection make just deployment point j and assembly place i (i=1 ..., m; J=1, n) constraint condition satisfies the cost that must pay, by making the target function value relevant minimize (or maximization) with cost, shadow price can be used for each constraint condition of comparison and carry out equivalence analysis to the contribution of target function value or to this contribution influence, shadow price is big more, show that this constraint condition is big more to the influence of the minimum delivery power of option control command, but it is also just difficult more to satisfy this condition, therefore, introducing shadow price just can be by comparing shadow price and realistic objective functional value, and can variation that study former linear programming constraint condition make objective function obtain gain.

Embodiment

Implementation example

In IT-based warfare, the mechanized infantry's of mechanization combat division deployment ability is an important component part of its fighting capacity, to huge battlefield mechanized infantry's deployment and the demand of transporting power and time, make commander's control of implementing battlefield mechanized infantry deployment become vital task, suppose that certain mechanization combat division must be 16 people with dead weight capacity, average speed per hour is 70 kilometers a armored personnel carrier, transport the mechanized infantry of specified amount to 14 deployment points from 5 assembly places, the length of transportation route between assembly place and the deployment point, the assembly place infantry can the deployment amount and the deployment point as shown in table 1 to infantry's demand, make the without hindrance transportation Probability p of all transportation routes here _Ij(t) be 1, d _Ij=r _Ij/ p _Ij(t), therefore actual shipment path and equivalent transportation route equal in length, the i.e. r between different supply and demand sides _IjWith d _IjEquate,

Table 1: transportation route length, portion's amount of asking (unit: kilometer, people) between mechanization combat division assembly place and the deployment point

	01 assembly place	02 assembly place	03 assembly place	04 assembly place	05 assembly place	Quantity required
							14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point	37.00 34.00 25.00 14.00 26.00 24.00 120.00 159.00 112.00 62.00 91.00 126.00 90.00 81.00	13.00 25.00 28.00 15.00 35.00 20.00 98.00 138.00 96.00 37.00 66.00 97.00 68.00 56.00	70.00 83.00 108.00 97.00 82.00 110.00 12.00 51.00 96.00 46.00 17.00 81.00 99.00 20.00	74.00 87.00 112.00 101.00 86.00 100.00 129.00 149.00 25.00 50.00 79.00 86.00 104.00 66.00	44.00 31.00 66.00 58.00 56.00 39.00 105.00 145.00 110.00 59.00 73.00 27.00 11.00 75.00	36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00
Can the deployment amount	250.00	200.00	300.00	400.00	150.00

According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, the option control command that the minimum time mechanized infantry of mechanization combat division who calculates by simplex algorithm disposes is as shown in table 2,

Table 2: mechanization combat division minimum time is disposed option control command (unit: people, passenger-kilometer,, minute)

	01 assembly place	02 assembly place	03 assembly place	04 assembly place	05 assembly place	Passenger-kilometer	Chariot quantity	Expend time in	Shadow price
										01 deployment point		36.00				468.00	3	11.14	0.00

14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point	90.00 90.00 70.00	21.00 40.00 40.00 36.00	60.00 16.00 90.00 24.00	29.00	22.00 18.00	525.00 2250.00 1860.00 1820.00 800.00 720.00 816.00 725.00 1332.00 1530.00 594.00 198.00 480.00	2 6 9 5 3 4 1 2 3 6 2 2 2	21.43 21.43 12.26 22.29 17.14 10.29 43.71 21.43 31.71 14.57 23.14 9.43 17.14	12.00 13.00 2.00 14.00 7.00 0.00 39.00 0.00 24.00 5.00 16.00 0.00 8.00
										Add up to	250.00	173.00	190.00	29.00	40.00	14118.00	50	43.71 *
But portion's quantity	250.00	200.00	300.00	400.00	150.00
										Surplus after the portion	0.00	27.00	110.00	371.00	110.00
Shadow price	12.00	13.00	12.00	25.00	11.00

* finishing the minimum time that deployment task expends is 43.71 minutes

By option control command (table 2) is analyzed as can be known; the armored personnel carrier that finishing deployment task needs adds up to 50; time is 43.71 minutes; the armored personnel carrier that 01～05 assembly place needs is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 assembly place implements to lay special stress on protecting; further analyze as can be known; transporting 16 43.71 minutes that the mechanized infantry spent from 03 assembly place to 08 deployment point is bottlenecks that the whole deployment task of restriction is finished sooner; if finish this part mechanized infantry's transportation with helicopter; then can be shortened to 31.71 minutes the time that whole deployment task is finished; reduction is 27.45%; and for example fruit is adopted the bottleneck that uses the same method and eliminated 31.71 minutes; then can be shortened to 23.14 minutes deployment time; reduction reaches 47.06%, almost only is former if having time half

From to demand constraint condition D _j(j=1,14) analysis of shadow price as can be known, the size of price has truly reflected the complexity that the related constraint condition satisfies, shadow price is meant in specific span that for " 0 " relevant constraint condition does not constitute influence to target function value, and is the easiest to be satisfied, again for example, in order to satisfy constraint condition D ₈, transported the mechanized infantry 43.71 minutes consuming time to 08 deployment point, the shadow price of this constraint condition is a maximal value 39, illustrates that this condition is the most difficult satisfied, can be by D with similar method _jThe complexity that satisfies, from difficulty to easy ordering: D ₈, D ₁₀, D ₁₂, D ₅..., to supply constraint condition S _i(i=1 ..., 5) analysis of shadow price as can be known, S _iThe complexity that satisfies, from difficulty to easy ordering: S ₄, S ₂, S ₁, S ₃, S ₅, i.e. constraint condition S ₄It is the most difficult satisfied,

In addition, measure as can be seen from the residue mechanized infantry of each assembly place, back of finishing the work, the surplus of 01 assembly place and 02 assembly place is obviously on the low side, particularly the 01 assembly place mechanized infantry that can dispose exhausts, this statement of facts:, add S if there is more mechanized infantry 01 assembly place ₁Constraint condition more easily satisfies, and just may obtain better to map out the plan, and therefore, can also carry out reasonable configuration to the mechanized infantry of each assembly place with said method, and realization can be disposed the Optimal Management of mechanized infantry's quantity.

Claims (10)

1, the present invention relates to quick commander's control method that the battlefield mechanized infantry disposes fast, relate to military affairs and association area, the object of commander's control is all battlefield mechanized infantries, this method is according to the length of the mechanized infantry's transportation route from different assembly places to different deployment points, the without hindrance transportation probability of transportation route, the assembly place infantry can the deployment amount and the deployment point to infantry's demand, the speed of means of transport and carrying capacity, structure is target and the commander's controlling models with low computational complexity and high solvability to transport all infantries minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meet the option control command that quick deployment time requires until final acquisition, this scheme is applicable to commander's control of all battlefield mechanized infantries' quick deployment.

2, the quick quick commander's control method of disposing of battlefield mechanized infantry according to claim 1, the object that it is characterized in that described commander's control is meant the object as commander's control with all battlefield mechanized infantries for all battlefield mechanized infantries, described commander's control is meant according to the actual demand of battlefield to the mechanized infantry, design is transported to different deployment points with the battlefield mechanized infantry from different assembly places, and make total haulage time of needing or total movement capacity for minimum, can be for the scheme of implementing.

3, the quick quick commander's control method of disposing of battlefield mechanized infantry according to claim 1, it is characterized in that described this method according to the without hindrance transportation probability of length, transportation route of mechanized infantry's transportation route, assembly place infantry from different assembly places to different deployment points can the deployment amount and the deployment point speed of infantry's demand, means of transport and carrying capacity are meant by these parameters can set up the supply and demand system that a battlefield mechanized infantry disposes, obtain on this basis the battlefield mechanized infantry is disposed the method for implementing commander's control.

4, quick commander's control method that battlefield mechanized infantry according to claim 1 disposes fast, it is characterized in that the without hindrance transportation probability of described transportation route is meant that complicated battlefield surroundings may impact the traffic capacity of mechanized infantry's transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport mechanized infantry's minimum that expends time in, this reduction has been equivalent to increase the length of transportation route, transportation route length after claiming to increase is equivalent path length, the without hindrance transportation probability of transportation route is with the function of time as variable, equivalent transportation route length then is with the function of the without hindrance transportation probability of actual shipment path and relevant transportation route as variable, when the without hindrance transportation probability of transportation route is 1, actual shipment path and equivalent transportation route equal in length.

5, the quick quick commander's control method of disposing of battlefield mechanized infantry according to claim 1, it is characterized in that described structure is that the target of target and the commander's controlling models with low computational complexity and the high solvability objective function that is meant this commander's controlling models is transported all infantries minimum that expends time in for making to transport all infantries minimum that expends time in, but when the without hindrance transportation probability of the transportation route in all paths was 1, the target of the objective function of this commander's controlling models was simultaneously also for making the carrying capacity of transporting all infantries' needs for minimum.

6, the quick quick commander's control method of disposing of battlefield mechanized infantry according to claim 1, it is characterized in that described structure is that target and the commander's controlling models with low computational complexity and high solvability are meant for the computational complexity that reduces this commander's controlling models and improve the solvability of this commander's controlling models to transport all infantries minimum that expends time in, stipulate that the constraint condition relevant with the deployment point is that the constraint condition that equals deployment point deployment amount, the constraint condition relevant with the assembly place are to be not more than the constraint condition that the assembly place maximum can the deployment amount.

7, quick commander's control method that battlefield mechanized infantry according to claim 1 disposes fast, it is characterized in that described and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meeting option control command that quick deployment time requires until final acquisition is meant by the method for finding the solution linear programming and finding the solution the dual program of linear programming and finds the solution commander's controlling models, can obtain minimum time respectively from different assembly place Transport Machinery infantries to different deployment points needs, with different assembly places and the relevant shadow price of different deployment points constraint condition, the result that will find the solution inserts in a kind of two dimension commander's control form again, according to analysis to this two dimension commander control form, and pass through according to shadow price, the time bottleneck is adjusted correlation parameter, constantly find the solution and update, meet the option control command that the battlefield mechanized infantry requires quick deployment time until final acquisition.

8, quick commander's control method that battlefield mechanized infantry according to claim 1 disposes fast, it is characterized in that described and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meeting until final acquisition that option control command that quick deployment time requires is meant can be by describing from each assembly place as the zones of different in the two-dimentional form of option control command to each deployment point Transport Machinery infantry's quantity, each deployment point needs the size of transport power, the quantity of means of transport, the minimum time that transportation expends can be disposed mechanized infantry's quantity with relevant shadow price, each assembly place, the situation of change of residue mechanized infantry quantity is with relevant shadow price and transport the minimum time that all mechanized infantries expend.

9, quick commander's control method that battlefield mechanized infantry according to claim 1 disposes fast, it is characterized in that the length of described this method according to mechanized infantry's transportation route from different assembly places to different deployment points, the without hindrance transportation probability of transportation route, the assembly place infantry can the deployment amount and the deployment point to infantry's demand, the speed of means of transport and carrying capacity, structure is target and the commander's controlling models with low computational complexity and high solvability to transport all infantries minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution the case study that this model is meant that the following quick commander that the battlefield mechanized infantry is disposed fast controls, but following mathematical formulae, derivation, result of calculation and application process are applicable to quick commander's control that all battlefield mechanized infantries are disposed fast

Supposing that the quick deployment issue of battlefield mechanized infantry can be used by m supply mechanized infantry's assembly place and n demand mechanized infantry's deployment point and between different supply and demand nodes exists the network in a Transport Machinery infantry's path to describe, and is x from supplying mechanized infantry's quantity that node i transports to demand node j _Ij, the without hindrance transportation probability of transportation route is p _Ij(t), the physical length of transportation route is r _Ij, the equivalent length of transportation route is d _IjThe without hindrance transportation probability of transportation route is meant that complicated battlefield surroundings may impact the traffic capacity of mechanized infantry's transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport mechanized infantry's minimum that expends time in, this reduction has been equivalent to increase the length of transportation route, transportation route length after claiming to increase is equivalent path length, the without hindrance transportation probability of transportation route is with the function of time as variable, equivalent transportation route length then is with the function of the without hindrance transportation probability of actual shipment path and relevant transportation route as variable, when the without hindrance transportation probability of transportation route is 1, actual shipment path and equivalent transportation route equal in length

The problem that need to solve is that one of design is transported the mechanized infantry to n deployment point from m assembly place, make the carrying capacity and the consumed time of transporting all mechanized infantry's costs be minimum movement plan simultaneously, and calculate the quantity that the required means of transport of mechanized infantry is transported in each assembly place, it is as follows that relevant mechanized infantry disposes commander controlling models and linear programming equation:

Objective function: $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}}$

Deployment point demand constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}=D_j,(j=1,\·\·\·,n)$

Assembly place supply constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}\≤S_i,(i=1,\·\·\·,m)$

Condition of Non-Negative Constrains: x _Ij〉=0, (i=1 ..., mj=1 ..., n)

The equivalent length of transportation route is: d _Ij=f (r _Ij, p _Ij(t)), (0＜p _Ij(t)≤1; I=1 ..., m; J=1 ..., n)

Assembly place i (i=1 ... m) the means of transport quantity of Xu Yaoing

From assembly place i (i=1 ... m) transport the mechanized infantry to deployment point j (j=1 ... n) spent time: $T_{\mathrm{ij}}=\frac{d_{\mathrm{ij}}}{C}$

Finish all mechanized infantries and dispose spent minimum time: minT=max{T _Ij}

Wherein:

M is supply mechanized infantry's assembly place sum;

N is demand mechanized infantry's a deployment point sum;

r _IjFor assembly place i (i=1 ... m) with deployment point j (j=1 ... the physical length of the transportation route n) (unit: kilometer);

p _Ij(t) be assembly place i (i=1 ... m) with deployment point j (j=1 ... n) the without hindrance transportation probability of the transportation route between is with the function of time t as variable;

d _IjFor assembly place i (i=1 ... m) with deployment point j (j=1 ... the equivalent length of the transportation route n) (unit: kilometer), when

p _Ij(t)=1 o'clock, r _IjWith d _IjEquate;

V _iFor the supply mechanized infantry assembly place i (i=1 ... m) transport the means of transport quantity that the mechanized infantry needs;

L transports mechanized infantry's ability (unit: the people) for each means of transport;

C transports mechanized infantry's speed (unit: kilometer/hour) for each means of transport;

S _iFor assembly place i (i=1 ... m) can supply mechanized infantry's quantity (unit: the people);

D _jFor deployment point j (j=1 ... n) need mechanized infantry's quantity (unit: the people);

Above-mentioned model shows: try to achieve by linear programming on the basis of minZ value, can calculate mechanized infantry's quantity x that each assembly place must be transported to the related deployment point _Ij,, can calculate the means of transport quantity V that each assembly place needs again according to the dead weight capacity L of means of transport _iTransport mechanized infantry's speed C and the longest path between assembly place and deployment point at last according to means of transport, can calculate again and finish the spent shortest time T of whole mechanized infantry's deployment task, thereby realize that the commander that the battlefield mechanized infantry is disposed fast controls, for constraint condition rationally being set, improving solvability, utilizing above-mentioned linear programming model better, the dual linear programming model that provides this model is as follows:

Objective function: $\max G=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{D}_j{y}_j+\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{S}_i{y}_{n+i}$

Constraint condition: D _jy _j+ S _iy _N+i≤ d _Ij, (i=1 ..., m; J=1 ..., n)

Condition of Non-Negative Constrains: y _j, y _N+i〉=0, (i=1 ..., m; J=1 ..., n)

Wherein: y _j, y _N+iBe respectively shadow price or the relevant decision variable of opportunity cost with the demand of former linear programming and supply mechanized infantry constraint condition,

Since primal linear programming solves be with deployment point j and assembly place i (i=1 ..., m; J=1 ..., the resource optimal utilization problem that constraint condition n) is relevant, thus dual program solve then be estimate to make deployment point j and assembly place i (i=1 ..., m; J=1 ..., constraint condition n) satisfies the cost problem that must pay, promptly uses the valency problem, and shadow price y _jAnd y _N+iReflection make just deployment point j and assembly place i (i=1 ..., m; J=1, n) constraint condition satisfies the cost that must pay, by making the target function value relevant minimize (or maximization) with cost, shadow price can be used for each constraint condition of comparison and carry out equivalence analysis to the contribution of target function value or to this contribution influence, shadow price is big more, show that this constraint condition is big more to the influence of the minimum delivery power of option control command, but it is also just difficult more to satisfy this condition, therefore, introducing shadow price just can be by comparing shadow price and realistic objective functional value, and can variation that study former linear programming constraint condition make objective function obtain gain.

10, quick commander's control method that battlefield mechanized infantry according to claim 1 disposes fast, it is characterized in that the length of described this method according to mechanized infantry's transportation route from different assembly places to different deployment points, the without hindrance transportation probability of transportation route, the assembly place infantry can the deployment amount and the deployment point to infantry's demand, the speed of means of transport and carrying capacity, structure is target and the commander's controlling models with low computational complexity and high solvability to transport all infantries minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, the option control command that meets quick deployment time requirement until final acquisition is meant if the option control command of trying to achieve can not satisfy the preset time requirement, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence the bottleneck that the battlefield mechanized infantry disposes T.T., carry out reasonable disposition by mechanized infantry's quantity again to the assembly place, increase the quantity of means of transport and adopt different means such as means of transport, eliminate the time bottleneck, and repeat this process, until the predetermined requirement that meets T.T. of finishing battlefield mechanized infantry deployment, this process can be described with following example, but the mathematical formulae described in example, result of calculation, various forms and application process are applicable to quick commander's control that all battlefield mechanized infantries are disposed fast

Suppose that certain mechanization combat division must be that 16 people, average speed per hour are 70 kilometers armored personnel carrier with dead weight capacity, transport the mechanized infantry of specified amount to 14 deployment points from 5 assembly places, between assembly place and the deployment point length of transportation route, assembly place infantry can the deployment amount and the deployment point as shown in table 1 to infantry's demand, make the without hindrance transportation Probability p of all transportation routes here _Ij(t) be 1, d _Ij=r _Ij/ p _Ij(t), therefore actual shipment path and equivalent transportation route equal in length, the i.e. r between different supply and demand sides _IjWith d _IjEquate,

Table 1: transportation route length, portion's amount of asking (unit: kilometer, people) between mechanization combat division assembly place and the deployment point 01 assembly place 02 assembly place 03 assembly place 04 assembly place 05 assembly place Quantity required 14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point 37.00 34.00 25.00 14.00 26.00 24.00 120.00 159.00 112.00 62.00 91.00 126.00 90.00 81.00 13.00 25.00 28.00 15.00 35.00 20.00 98.00 138.00 96.00 37.00 66.00 97.00 68.00 56.00 70.00 83.00 108.00 97.00 82.00 110.00 12.00 51.00 96.00 46.00 17.00 81.00 99.00 20.00 74.00 87.00 112.00 101.00 86.00 100.00 129.00 149.00 25.00 50.00 79.00 86.00 104.00 66.00 44.00 31.00 66.00 58.00 56.00 39.00 105.00 145.00 110.00 59.00 73.00 27.00 11.00 75.00 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00 Can the deployment amount 250.00 200.00 300.00 400.00 150.00

According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, the option control command that the minimum time mechanized infantry of mechanization combat division who calculates by simplex algorithm disposes is as shown in table 2,

Table 2: mechanization combat division minimum time is disposed option control command (unit: people, passenger-kilometer,, minute) 01 assembly place 02 assembly place 03 assembly place 04 assembly place 05 assembly place Passenger-kilometer Chariot quantity Expend time in Shadow price 14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point 90.00 90.00 70.00 36.00 21.00 40.00 40.00 36.00 60.00 16.00 90.00 24.00 29.00 22.00 18.00 468.00 525.00 2250.00 1860.00 1820.00 800.00 720.00 816.00 725.00 1332.00 1530.00 594.00 198.00 480.00 3 2 6 9 5 3 4 1 2 3 6 2 2 2 11.14 21.43 21.43 12.26 22.29 17.14 10.29 43.71 21.43 31.71 14.57 23.14 9.43 17.14 0.00 12.00 13.00 2.00 14.00 7.00 0.00 39.00 0.00 24.00 5.00 16.00 0.00 8.00 Add up to 250.00 173.00 190.00 29.00 40.00 14118.00 50 43.71 ^* But portion's quantity 250.00 200.00 300.00 400.00 150.00 Surplus after the portion 0.00 27.00 110.00 371.00 110.00 Shadow price 12.00 13.00 12.00 25.00 11.00

* finishing the minimum time that deployment task expends is 43.71 minutes

By option control command (table 2) is analyzed as can be known; the armored personnel carrier that finishing deployment task needs adds up to 50; time is 43.71 minutes; the armored personnel carrier that 01～05 assembly place needs is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 assembly place implements to lay special stress on protecting; further analyze as can be known; transporting 16 43.71 minutes that the mechanized infantry spent from 03 assembly place to 08 deployment point is bottlenecks that the whole deployment task of restriction is finished sooner; if finish this part mechanized infantry's transportation with helicopter; then can be shortened to 31.71 minutes the time that whole deployment task is finished; reduction is 27.45%; and for example fruit is adopted the bottleneck that uses the same method and eliminated 31.71 minutes; then can be shortened to 23.14 minutes deployment time; reduction reaches 47.06%, almost only is former if having time half

From to demand constraint condition D _j(j=1,14) analysis of shadow price as can be known, the size of price has truly reflected the complexity that the related constraint condition satisfies, shadow price is 0 to be meant in specific span, and relevant constraint condition does not constitute influence to target function value, the easiliest satisfies, again for example, in order to satisfy constraint condition D ₈, transported the mechanized infantry 43.71 minutes consuming time to 08 deployment point, the shadow price of this constraint condition is a maximal value 39, illustrates that this condition is the most difficult satisfied, can be by D with similar method _jThe complexity that satisfies, from difficulty to easy ordering: D ₈, D ₁₀, D ₁₂, D ₅..., to supply constraint condition S _i(i=1 ..., 5) analysis of shadow price as can be known, S _iThe complexity that satisfies, from difficulty to easy ordering: S ₄, S ₂, S ₁, S ₃, S ₅, i.e. constraint condition S ₄It is the most difficult satisfied,

In addition, measure as can be seen from the residue mechanized infantry of each assembly place, back of finishing the work, the surplus of 01 assembly place and 02 assembly place is obviously on the low side, particularly the 01 assembly place mechanized infantry that can dispose exhausts, this statement of facts:, add S if there is more mechanized infantry 01 assembly place ₁Constraint condition more easily satisfies, and just may obtain better to map out the plan, and therefore, can also carry out reasonable configuration to the mechanized infantry of each assembly place with said method, and realization can be disposed the Optimal Management of mechanized infantry's quantity.