CN1845153A - Rapid command control method for war field material rapid transport - Google Patents

Abstract

The invention relates to a quick command control method for quickly transmitting the materials in the battlefield. Wherein, the commanded object the all battlefield materials; according to the lengths from different concentrate points to different deploy points, the transmission non-baffle probability, the supply amount of provider, the needed amount of demander, and the speed and load of transmission device, the command control mode purposed for transmitting all materials 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

A kind of battlefield goods and materials are quick commander's control method of transportation fast

Technical field the present invention relates to national defence and association area, is used for the battlefield goods and materials are transported enforcement commander's control fast fast, realizes the quick transportation to the battlefield goods and materials.

Background technology is implemented quick goods and materials transportation between the supply and demand both sides in battlefield commander's control is an important component part of operational commanding control, according to the length of different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, the speed of means of transport and carrying capacity, working out one is that target and the transportation command control plan with low computational complexity and high solvability are that the battlefield commander transports fast the battlefield goods and materials and implements the key issue that commander's control fast must solve to realize that the supply and demand both sides transport all goods and materials minimum that expends time in, the solution of this problem is for increasing substantially fighting capacity, minimizing has crucial meaning to the demand of battlefield goods and materials 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 goods and materials transportation route, thereby reduce the passage rate of means of transport, and commander's control of quick goods and materials transportation is the key that improves mobile operations between combat division or trip and the subordinate, and wherein the matter of utmost importance that must solve is commander's control plan of the goods and materials transportation of formulation science.The quality of this plan, not only be related to and implement what of battlefield goods and materials transport point consumption of natural resource, but also be related to some crucial materiels such as can ammunition, fuel oil etc. in time be transported to mechanization combat troop, to guarantee that fighting capacity is unlikely to descend because of the delay that goods and materials transport.

Time seems more important for commander's control of battlefield goods and materials transportations and this transportation, constraint condition that therefore must be by reducing commander's controlling models, analyzes that the choose reasonable parameter improves solvability and comes the battlefield goods and materials are transported fast as optimization aim with the haulage time minimum by antithesis and implement to command fast to control.

The present invention relates to battlefield goods and materials quick commander's control method of transportation fast, relate to military affairs and association area, the object of commander's control is all battlefield goods and materials, this method is according to the length from different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, 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 goods and materials 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 goods and materials quick haulage time in battlefield 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 the quick commander's control of transportation fast of all battlefield goods and materials, the invention further relates to the technology that realizes this method.

Summary of the invention the present invention is according to the length from different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, 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 goods and materials 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 goods and materials are transported fast, and check whether this option control command meets the time demand of finishing whole battlefield goods and materials transport 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 is adjusted relevant supplier's stock in storage amount and means of transport etc., constantly repeat this and find the solution-check analytic process, meet the option control command that goods and materials quick haulage time in battlefield requires until final acquisition.Therefore, the goods and materials conception of quick commander's control of transportation fast in battlefield is 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 goods and materials are transported fast, and according to the time requirement of finishing whole goods and materials transportation, by searching the time bottleneck that whole battlefield goods and materials transport task is finished in influence, the unreasonable configuration of supplier's stock in storage amount and means of transport adjusted, continue to optimize and improve this option control command, and the final time requirement that obtains to satisfy the quick transportation of battlefield goods and materials, option control command with two-dimentional form description becomes key character of the present invention.

A kind of battlefield of the present invention goods and materials technical scheme of quick commander's control method of transportation fast are:

At first, goods and materials quick transportation problem in battlefield is defined as by the supplier of goods and materials and the supply and demand system that party in request constituted of goods and materials, the feature of this system can be used the length from different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, the speed and the carrying capacity of means of transport are described, and according to the time requirement that the battlefield goods and materials are transported, structure is target and the commander's controlling models with low computational complexity and high solvability to transport all goods and materials 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 goods and materials are transported fast, time bottleneck by continuous searching supply and demand system, quantity of inventory to relevant supplier carries out reasonable disposition, adopt methods such as different means of transports, the final time requirement that obtains to satisfy the quick transportation of battlefield goods and materials, the scheme of commander's control is implemented in transportation to the battlefield goods and materials, finishes the commander's control of transportation fast of battlefield goods and materials.

Quick commander's control to the transportation of battlefield goods and materials, 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 is the constraint condition that equals party in request's demand, the constraint condition relevant with the supplier is the constraint condition that is not more than supplier's Maximum Supply Quantity.

Complicated battlefield surroundings may impact the traffic capacity of goods and materials transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport the goods and materials 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 transported all goods and materials minimum that expends time in for making, 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 goods and materials needs for 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 minimum time respectively from different supplier's transporting supplies to different parties in request needs, 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 goods and materials quick haulage time in battlefield requires.

Can describe the quantity from each supplier to each party in request's transporting supplies, 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, surplus material that each supplier supplies goods and materials is with relevant shadow price and transport the minimum time that all goods and materials 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 of battlefield goods and materials transportation T.T., carry out reasonable disposition, increase the quantity of means of transport and adopt different means such as means of transport by stock in storage again the supplier, eliminate the time bottleneck, and repeat this process, until making the predetermined requirement that meets T.T. of finishing battlefield goods and materials transportation.

The battlefield goods and materials of the present invention's design quick commander's control method of transportation fast are applicable to that it is key character of the present invention that all battlefield goods and materials transport fast.

The case study of quick commander's control that the battlefield goods and materials transport fast is as follows.

The transportation problem of supposing the battlefield goods and materials can be used by m supply goods and materials node and n demand goods and materials node and exist the network in the path of a transporting supplies to describe between different supply and demand nodes, is x from supplying the goods and materials 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 goods and materials transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport the goods and materials 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 supplied node from m and transported goods and materials to n demand node, make the carrying capacity and the consumed time of transporting all goods and materials costs be minimum movement plan simultaneously, and calculate the quantity that each supply node transports the required truck of goods and materials, relevant battlefield goods and materials transportation command controlling models and linear programming equation are as follows:

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

Demand constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}{=D}_j,$ (j＝1，…，n)

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)

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

From supply node i (i=1 ... m) transport goods and materials to demand node j (j=1 ... n) spent time: $T_{\mathrm{ij}}=\frac{d_{\mathrm{ij}}}{C}$

Finish the minimum time that all battlefield goods and materials transport points expend: minT=max{T _Ij}

Wherein:

M is the node sum of supply goods and materials;

N is the node sum of demand goods and materials;

r _IjFor supply node i (i=1 ... m) with demand node j (j=1 ... the physical length of the transportation route n) (unit: kilometer);

p _Ij(t) for supply node i (i=1 ... m) with demand node 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 supply node i (i=1 ... m) with demand node 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 goods and materials node i (i=1 ... m) transport the means of transport quantity that goods and materials need;

L transports the ability (unit: ton) of goods and materials for each means of transport;

C transports the speed (unit: kilometer/hour) of goods and materials for each means of transport;

S _iFor supply node i (i=1 ... m) can supply the quantity (unit: ton) of goods and materials;

D _jFor demand node j (j=1 ... n) need the quantity (unit: ton) of goods and materials;

Above-mentioned model shows: try to achieve by linear programming on the basis of minZ value, can calculate the goods and materials quantity x that each supply node must transport to the related needs node _Ij,, can calculate the means of transport quantity V that each supply node needs again according to the dead weight capacity L of means of transport _i, transport at last the speed C and the longest path between the supply and demand node of goods and materials according to means of transport, can calculate again and finish the spent shortest time T of whole goods and materials transport task, thereby realize the commander's control of transportation fast of battlefield goods and materials.

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 _iy _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 demand and " shadow price " or " opportunity cost " relevant decision variable of supplying goods and materials constraint condition with former linear programming.

Since primal linear programming solves be with demand node j and supply node 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 satisfy the demands node j and supply node i (i=1 ..., m; J=1 ..., the cost problem that constraint condition n) must be paid is promptly used the valency problem, and shadow price y _jAnd y _N+iSatisfy the demands just node j and the supply node i of reflection (i=1 ..., m; J=1, n) cost that constraint condition must be paid minimizes (or maximization) by making the target function value relevant with cost, and 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, shows 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 battlefield movement capacity of mechanization combat division is an important component part of its fighting capacity, to huge battlefield goods and materials transporting power and the demand of time, the commander's control that makes enforcement battlefield goods and materials transport becomes vital task, suppose that certain mechanization combat division must be that 16 tons, average speed per hour are 70 kilometers truck with dead weight capacity, transport the materiel of specified amount to 14 demand points from 5 supply centre, the length of transportation route and supply and demand amount are as shown in table 1 between the supply and demand point, 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, supply and demand amount (unit: kilometer, ton) between the mechanization combat division supply and demand point

	01 supply centre	02 supply centre	03 supply centre	04 supply centre	05 supply centre	Quantity required
							01 demand point, 02 demand point, 03 demand point, 04 demand point, 05 demand point, 06 demand point, 07 demand point, 08 demand point, 09 demand point, 10 demand points, 11 demand points, 12 demand points, 13 demand points, 14 demand points	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
Quantity available	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, as shown in table 2 by the mechanization combat division minimum time transportation command controlling schemes that simplex algorithm calculates.

Table 2: mechanization combat division minimum time transportation command controlling schemes (unit: ton, ton kilometre,, minute)

	01 supply centre	02 supply centre	03 supply centre	04 supply centre	05 supply centre	Ton kilometre	Truck quantity	Expend time in	Shadow price
										01 demand point, 02 demand point, 03 demand point, 04 demand point, 05 demand point, 06 demand point, 07 demand point, 08 demand point	90.00 90.00 70.00	36.00 21.00 40.00 40.00	60.00 16.00			468.00 525.00 2250.00 1860.00 1820.00 800.00 720.00 816.00	3 2 6 9 5 3 4 1	11.14 21.43 21.43 12.26 22.29 17.14 10.29 43.71	0.00 12.00 13.00 2.00 14.00 7.00 0.00 39.00

09 demand point, 10 demand points, 11 demand points, 12 demand points, 13 demand points, 14 demand points		36.00	90.00 24.00	29.00	22.00 18.00	725.00 1332.00 1530.00 594.00 198.00 480.00	2 3 6 2 2 2	21.43 31.71 14.57 23.14 9.43 17.14	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 *
Quantity available	250.00	200.00	300.00	400.00	150.00
										For the back surplus	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 transport task expends is 43.71 minutes

By option control command (table 2) is analyzed as can be known; it is 43.71 minutes that the truck that finishing transport task needs adds up to 50, time; the truck that 01～05 supply centre needs is respectively 17,14,13,2 and 4, therefore must implement to lay special stress on protecting to 01,02 and 03 supply centre.Further analyze as can be known, transporting 16 tons of 43.71 minutes that goods and materials spent from 03 supply centre to 08 demand point is bottlenecks that the whole transport task of restriction is finished sooner, if finish the transportation of this part goods and materials with helicopter, then can be shortened to 31.71 minutes the time that whole transport 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 haulage time can be shortened to 23.14 minutes, 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 goods and materials 43.71 minutes consuming time to 08 demand 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 ₅...From 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 ₄The most difficult satisfied.

In addition, from finish the work the back each supply centre tank farm stock as can be seen, the stock of 01 supply centre and 02 supply centre is obviously on the low side, particularly 01 supply centre stock in storage exhausts, this statement of facts: if there are more goods and materials 01 supply centre, add S ₁Constraint condition more easily satisfies, and just may obtain better movement plan.Therefore, can also carry out reasonable configuration to the goods and materials of each supply centre, realize the Optimal Management of tank farm stock with said method.

Claims (10)

1, the present invention relates to battlefield goods and materials quick commander's control method of transportation fast, relate to military affairs and association area, the object of commander's control is all battlefield goods and materials, this method is according to the length from different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, 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 goods and materials 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 goods and materials quick haulage time in battlefield requires until final acquisition, this scheme is applicable to the commander's control of transportation fast of all battlefield goods and materials.

2, quick commander's control method of the quick transportation of battlefield goods and materials according to claim 1, the object that it is characterized in that described commander's control is meant the object of all battlefield goods and materials as commander's control for all battlefield goods and materials, described commander's control is meant according to the actual demand of battlefield to goods and materials, design is transported to different parties in request with the battlefield goods and materials from different suppliers, and make total haulage time of needing or total movement capacity for minimum, can be for the scheme of implementing.

3, quick commander's control method of the quick transportation of battlefield goods and materials according to claim 1, it is characterized in that described this method is meant the supply and demand system that can set up a battlefield goods and materials transportation by these parameters according to supply and the demand of party in request's goods and materials, the speed and the carrying capacity of means of transport of the without hindrance transportation probability of length, transportation route from different suppliers to different parties in request goods and materials transportation route, supplier's goods and materials, obtains the method to battlefield goods and materials transportation enforcement commander control on this basis.

4, battlefield according to claim 1 goods and materials are quick commander's control method of transportation 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 goods and materials transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport the goods and materials 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, quick commander's control method of the quick transportation of battlefield goods and materials 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 goods and materials minimum that expends time in for making to transport all goods and materials 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 goods and materials needs for minimum.

6, quick commander's control method of the quick transportation of battlefield goods and materials 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 goods and materials minimum that expends time in, and stipulates that the constraint condition relevant with party in request is that the constraint condition that equals party in request's demand, the constraint condition relevant with the supplier are the constraint condition that is not more than supplier's Maximum Supply Quantity.

7, battlefield according to claim 1 goods and materials are quick commander's control method of transportation 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 goods and materials quick haulage time in battlefield 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 supplier's transporting supplies to different parties in request needs, 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, according to analysis to this two dimension commander control form, and pass through shadow price, the time bottleneck is adjusted correlation parameter, constantly find the solution and update, meet the option control command that goods and materials quick haulage time in battlefield requires until final acquisition.

8, battlefield according to claim 1 goods and materials are quick commander's control method of transportation 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 goods and materials quick haulage time in battlefield requires is meant can be by describing the quantity from each supplier to each party in request's transporting supplies as the zones of different in the two-dimentional form of option control command, each party in request needs the size of transport power, the quantity of means of transport, the minimum time that transportation expends is supplied the quantity of goods and materials with relevant shadow price, each supplier, the situation of change of surplus material is with relevant shadow price and transport the minimum time that all goods and materials expend.

9, battlefield according to claim 1 goods and materials are quick commander's control method of transportation fast, it is characterized in that described this method is according to the length from different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, 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 goods and materials minimum that expends time in, and use linear programming, the dual program method of linear programming is found the solution this model and is meant following to the case study of quick commander's control of transportation fast of battlefield goods and materials, but following mathematical formulae, derivation, result of calculation and application process are applicable to the quick commander's control of transportation fast of all battlefield goods and materials

The transportation problem of supposing the battlefield goods and materials can be used by m supply goods and materials node and n demand goods and materials node and exist the network in the path of a transporting supplies to describe between different supply and demand nodes, is x from supplying the goods and materials 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 goods and materials transportation route, thereby reduce the passage rate of means of transport, for being the commander control of target to transport the goods and materials 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 supplied node from m and transported goods and materials to n demand node, make the carrying capacity and the consumed time of transporting all goods and materials costs be minimum movement plan simultaneously, and calculate the quantity that each supply node transports the required means of transport of goods and materials, relevant battlefield goods and materials transportation command controlling models and linear programming equation are as follows:

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

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

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)

Supply node i (i=1 ... m) the means of transport number of Xu Yaoing

From supply node i (i=1 ... m) transport goods and materials to demand node j (j=1 ... n) spent time: $T_{\mathrm{ij}}=\frac{d_{\mathrm{ij}}}{C}$

Finish the minimum time that all battlefield goods and materials transport points expend: minT=max{T _Ij}

Wherein:

M is the node sum of supply goods and materials;

N is the node sum of demand goods and materials;

r _IjFor supply node i (i=1 ... m) with demand node j (j=1 ... the physical length of the transportation route n) (unit: kilometer);

p _Ij(t) for supply node i (i=1 ... m) with demand node 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 supply node i (i=1 ... m) with demand node 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 goods and materials node i (i=1 ... m) transport the means of transport quantity that goods and materials need;

L transports the ability (unit: ton) of goods and materials for each means of transport;

C transports the speed (unit: kilometer/hour) of goods and materials for each means of transport;

S _iFor supply node i (i=1 ... m) can supply the quantity (unit: ton) of goods and materials;

D _jFor demand node j (j=1 ... n) need the quantity (unit: ton) of goods and materials;

Above-mentioned model shows: try to achieve by linear programming on the basis of minZ value, can calculate the goods and materials quantity x that each supply node must transport to the related needs node _Ij,, can calculate the means of transport quantity V that each supply node needs again according to the dead weight capacity L of means of transport _iTransport the speed C and the longest path between the supply and demand node of goods and materials at last according to means of transport, can calculate again and finish the spent shortest time T of whole goods and materials transport task, thereby realize the commander's control of transportation fast of battlefield goods and materials, 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 goods and materials constraint condition,

Since primal linear programming solves be with demand node j and supply node 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 demand node j and supply node 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 demand node j and supply node 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, battlefield according to claim 1 goods and materials are quick commander's control method of transportation fast, it is characterized in that described this method is according to the length from different suppliers to different parties in request goods and materials transportation route, the without hindrance transportation probability of transportation route, the demand of the supply of supplier's goods and materials and party in request's goods and materials, 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 goods and materials 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 goods and materials quick haulage time requirement in battlefield 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 of battlefield goods and materials transportation T.T., carry out reasonable disposition by stock in storage again to the supplier, 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 goods and materials transportation, 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 the quick commander's control of transportation fast of all battlefield goods and materials

Suppose that certain mechanization combat division must be that 16 tons, average speed per hour are 70 kilometers truck with dead weight capacity, transport the materiel of specified amount to 14 demand points from 5 supply centre, the length of transportation route and supply and demand amount are as shown in table 1 between the supply and demand point, 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, supply and demand amount (unit: kilometer, ton) between the mechanization combat division supply and demand point 01 supply centre 02 supply centre 03 supply centre 04 supply centre 05 supply centre Quantity required 01 demand point, 02 demand point, 03 demand point, 04 demand point, 05 demand point, 06 demand point, 07 demand point, 08 demand point, 09 demand point, 10 demand points, 11 demand points, 12 demand points, 13 demand points, 14 demand points 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 Quantity available 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, as shown in table 2 by the mechanization combat division minimum time transportation command controlling schemes that simplex algorithm calculates,

Table 2: mechanization combat division minimum time transportation command controlling schemes (unit: ton, ton kilometre,, minute) 01 supply centre 02 supply centre 03 supply centre 04 supply centre 05 supply centre Ton kilometre Truck quantity Expend time in Shadow price 01 demand point, 02 demand point 36.00 21.00 468.00 525.00 3 2 11.14 21.43 0.00 12.00 03 demand point, 04 demand point, 05 demand point, 06 demand point, 07 demand point, 08 demand point, 09 demand point, 10 demand points, 11 demand points, 12 demand points, 13 demand points, 14 demand points 90.00 90.00 70.00 40.00 40.00 36.00 60.00 16.00 90.00 24.00 29.00 22.00 18.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 6 9 5 3 4 1 2 3 6 2 2 2 21.43 12.26 22.29 17.14 10.29 43.71 21.43 31.71 14.57 23.14 9.43 17.14 3.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 ^* Quantity available 250.00 200.00 300.00 400.00 150.00 For the back surplus 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 transport task expends is 43.71 minutes

By option control command (table 2) is analyzed as can be known; the truck that finishing transport task needs adds up to 50; time is 43.71 minutes; the truck that 01～05 supply centre needs is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 supply centre implements to lay special stress on protecting; further analyze as can be known; transporting 16 tons of 43.71 minutes that goods and materials spent from 03 supply centre to 08 demand point is bottlenecks that the whole transport task of restriction is finished sooner; if finish the transportation of this part goods and materials with helicopter; then can be shortened to 31.71 minutes the time that whole transport 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 haulage time can be shortened to 23.14 minutes; 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 goods and materials 43.71 minutes consuming time to 08 demand 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, from finish the work the back each supply centre tank farm stock as can be seen, the stock of 01 supply centre and 02 supply centre is obviously on the low side, particularly 01 supply centre stock in storage exhausts, this statement of facts: if there are more goods and materials 01 supply centre, add S ₁Constraint condition more easily satisfies, and just may obtain better movement plan, therefore, can also carry out reasonable configuration, the Optimal Management of realization tank farm stock to the goods and materials of each supply centre with said method.