CN105868463A - Dynamical optimization method for complexity of complex product - Google Patents

Abstract

The invention relates to a dynamical optimization method for the complexity of a complex product. The method comprises the following steps that 1, a complexity model of the complex product is built, a constraint equation in the complexity model is extracted, and a constraint equation set CN(P)=0 is formed, wherein P is a constrained parameter set in the complexity model; 2, after the function of the complex product is changed, a constrained parameter steady-state value set PS in the constraint equation set CN(P)=0 is obtained; 3, whether the constrained parameter steady-state value set PS in the step 2 is a null set or not is judged, if yes, dynamical optimization fails, and if not, dynamical optimization succeeds, wherein the constrained parameter equilibrium value of the complex product is PS. Compared with the prior art, the dynamical optimization method has the advantages of being simple, high in operational precision, high in reliability and the like.

Description

A kind of complex product complexity Dynamics Optimization method

Technical field

The present invention relates to a kind of Dynamics Optimization method, especially relate to a kind of complex product complexity kinetics excellent Change method.

Background technology

Complex product refers to that R&D costs are high, scale is big, with high content of technology, relate to multidisciplinary technological know-how, manufacture A kind of product that assembling resource requirement is very many, its customer demand, system composition, product technology, manufacture process, Project managements etc. are the most extremely complex.

The change of complex product only the most constantly follow-up external environment condition just adapts to the new demand in market and consumer, because of This complex product is accomplished by being continuously updated optimization, and the optimization that updates of complex product is not to redesign new complicated product Product, but carry out on the basis of existing Complex Product System, including to existing Complex Product Structure and function Renewal optimization.The complexity of complex product is increasingly regarded as studying the important point of penetration of complex product at present, Therefore updating to optimize and becoming to become for carrying out the newest research of complex product is studied by the complexity of complex product Gesture.

Summary of the invention

Defect that the purpose of the present invention is contemplated to overcome above-mentioned prior art to exist and provide a kind of complex product multiple Polygamy Dynamics Optimization method.

The purpose of the present invention can be achieved through the following technical solutions:

A kind of complex product complexity Dynamics Optimization method, the method comprises the steps:

(1) set up the complexity model of complex product, extract the constraint equation in this complexity model and form about Bundle equation group CN (P)=0, constrained parameters set during wherein P is complex model；

(2), after the change of complex product function, constrained parameters steady-state value set in Constrained equations CN (P)=0 is asked for P^S；

(3) constrained parameters steady-state value set P in step (2) is judged^SWhether is empty set, the most then kinetics is excellent Changing unsuccessfully, otherwise Dynamics Optimization success, the constrained parameters equilibrium valve of complex product is P^S。

The described constraint equation described in step (1) includes structure link constraint equation and the function of complex product Constraint equation.

Described step (2) includes following sub-step:

(201) obtaining constraint equation number in Constrained equations CN (P)=0 is Num and constrained parameters set Middle constrained parameters number is g, performs step (202)；

(202) compare the size of Num and g, if Num is equal to g, perform step (203), if Num is big In g, perform step (204), if Num is less than g, perform step (207)；

(203) the gloomy iterative method of newton pressgang is used to ask for constrained parameters steady-state value collection in Constrained equations CN (P)=0 Close P^S, and terminate；

(204) from Constrained equations CN (P)=0, arbitrarily choose g constraint equation and form the first equation group CN_g(P)=0, remaining (Num-g) individual constraint equation forms the second equation group CN_Num-g(P)=0, perform step (205)；

(205) the gloomy iterative method of newton pressgang is used to ask for the first equation group CN_g(P) constrained parameters steady-state value in=0 SetPerform step (206)；

(206) constraint IF parameter steady-state value setWhether meet the second equation group CN_Num-g(P) precision of=0 Requirement, if then assignmentAnd terminate, otherwise P^SFor empty set and terminate；

(207) stable state before changing of each constrained parameters in complex product function constrained parameters set P before changing is obtained It is worth and forms constraint steady-state value set before changingPerform step (208)；

(208) from constrained parameters set P, choose Num constrained parameters and form new constrained parameters set P ', From retraining steady-state value set before changingExtract steady-state value before changing corresponding to the constrained parameters of remaining (g-Num) also The set of compositionWill setIn value bring Constrained equations CN (P)=0 into, obtain third party Journey group CN (P ')=0, performs step (209)；

(209) the gloomy iterative method of newton pressgang is used to ask for the constrained parameters steady-state value P ' of third party's journey group CN (P ')=0^S And preserve, perform step (210)；

(210) the constrained parameters steady-state value set of Constrained equations CN (P)=0 is obtainedAnd Terminate.

The gloomy iterative method of newton pressgang described in step (203), step (205) and step (208) includes as follows Sub-step:

A corresponding Constrained equations is denoted as F (X)=[f by ()₁(X),f₂(X)…f_n(X)]=0, wherein X=[x₁,x₂…x_n] it is corresponding constrained parameters set, f₁(X) it is the 1st constraint equation, f₂(X) it is the 2nd Constraint equation, f_n(X) it is the n-th constraint equation, x₁It is the 1st constrained parameters, x₂It is the 2nd constrained parameters, x_nBeing the n-th constrained parameters, n is to retrain in constraint equation number and constrained parameters set in Constrained equations The number of parameter, performs step (b)；

B () assignment k=0, chooses each constrained parameters initial value composition constrained parameters in constrained parameters set X initial Value set, is denoted asWhereinIt is the 1st constrained parameters initial value,Be the 2nd about Bundle initial parameter value,It is the n-th constrained parameters initial value, performs step (c)；

C () calculatesPerform step (d)；

D () judgesWhether existing, if being carried out step (e), otherwise performing step (g)；

(e) calculating following formula:

$X^{k+1}=X^k-{\[\frac{\∂F\left(X^k\right)}{\∂X^k}\]}^{-1}F\left(X^k\right),$

Wherein, X^kFor constrained parameters kth time iterative value set, X^k+1For+1 iterative value collection of constrained parameters kth Close, F (X^k) it is Constrained equations kth time iterative value, perform step (f)；

F () calculates iteration difference ε_k+1=X^k+1-X^k, judge ε simultaneously_k+1 ^Tε_k+1＜ Acu_stopWhether set up, if Constraint EQ parameter steady-state value set P^S=X^k+1And terminate, otherwise assignment k=k+1 return step (c), wherein Acu_stopFor setting accuracy；

(g) constrained parameters steady-state value set P^SFor empty set, terminate.

The parameter steady-state value set of step (206) constraint IFWhether meet the second equation group CN_Num-g(P)=0 Required precision, particularly as follows:

(2061) the constraint function set CN in the second equation group is extracted_Num-g(P)=0, by constrained parameters steady-state value SetIn value bring constraint function set CN into_Num-g(P) constraint function accuracy value, is asked for

(2062) Δ ＜ Acu is judged_acp, if so, constrained parameters steady-state value setMeet the second equation group CN_Num-g(P) required precision of=0, the otherwise set of constrained parameters steady-state valueIt is unsatisfactory for the second equation group CN_Num-g(P) required precision of=0 wherein Acu_acpFor given constraint function precision.

Compared with prior art, present invention have the advantage that

(1) this invention is using complex product complexity model as object of study, improves the feasibility of research and grinds Study carefully the vindicability of result；

(2) constraint equation includes structure link constraint equation and the functional restraint functional equation of complex product, multiple After the change of miscellaneous product function, in structure link constraint equation and functional restraint function, constrained parameters equilibrium valve is complicated producing The result of the Dynamics Optimization of product, by concrete numerical response whole Dynamics Optimization process, intuitive is strong, optimizes Result is more preferable；

(3) the gloomy iterative method of newton pressgang both ensure that higher calculating speed, improves again the degree of accuracy of result of calculation, And the space complexity of algorithm is the least.

Accompanying drawing explanation

Fig. 1 is the flow chart of complex product complexity Dynamics Optimization method of the present invention.

Detailed description of the invention

The present invention is described in detail with specific embodiment below in conjunction with the accompanying drawings.

Embodiment

As it is shown in figure 1, a kind of complex product complexity Dynamics Optimization method comprises the following steps:

Step 1: set up the complexity model of complex product, extracts the constraint equation in this complexity model and forms Constrained equations CN (P)=0, constrained parameters set during wherein P is complex model, described constraint equation includes The structure link constraint equation of complex product and functional restraint equation；

Step 2: after the change of complex product function, ask for constrained parameters steady-state value collection in Constrained equations CN (P)=0 Close P^S；

Step 3: judge constrained parameters steady-state value set P in step (2)^SWhether it is empty set, the most then power Learning optimizes unsuccessfully, otherwise Dynamics Optimization success, and the constrained parameters equilibrium valve of complex product is P^S。

Wherein, the complex model setting up complex product in described step 1 uses existing method, and embodiment is to send out As a example by motivation, setting up the complex model of electromotor, the complexity model of complex product is to link Complex Product Structure Constraint and the mathematical expression of functional restraint, this is so the complex model of electromotor to be expected have to be from electromotor Extract suitable structure link constraint function and functional restraint function, these constraint functions form complex product Complexity model, the Dynamics Optimization of rear engine complexity does basis for it.The mistake completed from the duty of engine Journey i.e. the four of electromotor stroke studies the complexity of electromotor, because the four of electromotor strokes not only relate to The core institution of electromotor, also the function with electromotor is closely related, the constraint drawn from four strokes of electromotor Characteristic parameter in the structure relating to electromotor of meeting maximum possible and functional parameter functionally, to maximum layer The complexity model covering complex product of degree, thus more fully verify the correctness of complex product complexity model. The constraint equation synopsis obtained during the acting of four-stroke engine is as shown in table 1:

The constraint equation synopsis of the acting process of table 1 four-stroke engine

In complex model, restricted parameter set is combined into:

P={l, d, sr, W, n, T, d_cyl,d_pis,d_ubsh,d_csft,d_crod,h_csft,r_csft,h_eng),

Constrained equations is:

$CN\left(P\right)=\left[\begin{array}{c}sr-1-\frac{d}{l}\\ W-nRT\ln \left(sr\right)\\ d_{cyl}-d_{pis}\\ d_{ubsh}-d_{csft}\\ r_{csft}-\frac{d}{2}\\ d_{crod}+l+d-(r_{csft}-h_{csft}+h_{eng})\end{array}\right]=0.$

Described step 2 includes following sub-step:

(201) obtaining constraint equation number in Constrained equations CN (P)=0 is Num and constrained parameters set Middle constrained parameters number is g, performs step (202)；

(202) compare the size of Num and g, if Num is equal to g, perform step (203), if Num is big In g, perform step (204), if Num is less than g, perform step (207)；

(203) the gloomy iterative method of newton pressgang is used to ask for constrained parameters steady-state value collection in Constrained equations CN (P)=0 Close P^S, and terminate；

(204) from Constrained equations CN (P)=0, arbitrarily choose g constraint equation and form the first equation group CN_g(P)=0, remaining (Num-g) individual constraint equation forms the second equation group CN_Num-g(P)=0, perform step (205)；

(205) the gloomy iterative method of newton pressgang is used to ask for the first equation group CN_g(P) constrained parameters steady-state value in=0 SetPerform step (206)；

(206) constraint IF parameter steady-state value setWhether meet the second equation group CN_NumThe precision of-g (P)=0 Requirement, if then assignmentAnd terminate, otherwise P^SFor empty set and terminate；

(207) stable state before changing of each constrained parameters in complex product function constrained parameters set P before changing is obtained It is worth and forms constraint steady-state value set before changingPerform step (208)；

(208) from constrained parameters set P, choose Num constrained parameters and form new constrained parameters set P ', From retraining steady-state value set before changingExtract steady-state value before changing corresponding to the constrained parameters of remaining (g-Num) also The set of compositionWill setIn value bring Constrained equations CN (P)=0 into, obtain third party Journey group CN (P ')=0, performs step (209)；

(209) the gloomy iterative method of newton pressgang is used to ask for the constrained parameters steady-state value P ' of third party's journey group CN (P ')=0^S And preserve, perform step (210)；

(210) the constrained parameters steady-state value set of Constrained equations CN (P)=0 is obtainedAnd Terminate.

The gloomy iterative method of newton pressgang described in step (203), step (205) and step (208) includes as follows Sub-step:

A corresponding Constrained equations is denoted as F (X)=[f by ()₁(X),f₂(X)…f_n(X)]=0, wherein X=[x₁,x₂…x_n] it is corresponding constrained parameters set, f₁(X) it is the 1st constraint equation, f₂(X) it is the 2nd Constraint equation, f_n(X) it is the n-th constraint equation, x₁It is the 1st constrained parameters, x₂It is the 2nd constrained parameters, x_nBeing the n-th constrained parameters, n is to retrain ginseng in constraint equation number and constrained parameters set in Constrained equations The number of number, performs step (b)；

B () assignment k=0, chooses each constrained parameters initial value composition constrained parameters in constrained parameters set X initial Value set, is denoted asWhereinIt is the 1st constrained parameters initial value,Be the 2nd about Bundle initial parameter value,It is the n-th constrained parameters initial value, performs step (c)；

C () calculatesPerform step (d)；

D () judgesWhether existing, if being carried out step (e), otherwise performing step (g)；

(e) calculating following formula:

$X^{k+1}=X^k-{\[\frac{\∂F\left(X^k\right)}{\∂X^k}\]}^{-1}F\left(X^k\right),$

Wherein, X^kFor constrained parameters kth time iterative value set, X^k+1For+1 iterative value collection of constrained parameters kth Close, F (X^k) it is Constrained equations kth time iterative value, perform step (f)；

F () calculates iteration difference ε_k+1=X^k+1-X^k, judge ε simultaneously_k+1 ^Tε_k+1＜ Acu_stopWhether set up, if Constraint EQ parameter steady-state value set P^S=X^k+1And terminate, otherwise assignment k=k+1 return step (c), wherein Acu_stopFor setting accuracy；

(g) constrained parameters steady-state value set P^SFor empty set, terminate.

The parameter steady-state value set of step (206) constraint IFWhether meet the second equation group CN_Num-g(P)=0 Required precision, particularly as follows:

(2061) the constraint function set CN in the second equation group is extracted_Num-g(P)=0, by constrained parameters steady-state value SetIn value bring constraint function set CN into_Num-g(P) constraint function accuracy value, is asked for

(2062) Δ ＜ Acu is judged_acp, if so, constrained parameters steady-state value setMeet the second equation group CN_Num-g(P) required precision of=0, the otherwise set of constrained parameters steady-state valueIt is unsatisfactory for the second equation group CN_Num-g(P) required precision of=0 wherein Acu_acpFor given constraint function precision.

Claims (5)

1. a complex product complexity Dynamics Optimization method, it is characterised in that the method comprises the steps:

(1) set up the complexity model of complex product, extract the constraint equation in this complexity model and form about Bundle equation group CN (P)=0, constrained parameters set during wherein P is complex model；

(2), after the change of complex product function, constrained parameters steady-state value set in Constrained equations CN (P)=0 is asked for P^S；

(3) constrained parameters steady-state value set P in step (2) is judged^SWhether is empty set, the most then kinetics is excellent Changing unsuccessfully, otherwise Dynamics Optimization success, the constrained parameters equilibrium valve of complex product is P^S。

A kind of complex product complexity Dynamics Optimization method the most according to claim 1, it is characterised in that The described constraint equation described in step (1) includes structure link constraint equation and the functional restraint of complex product Equation.

A kind of complex product complexity Dynamics Optimization method the most according to claim 1, it is characterised in that Described step (2) includes following sub-step:

(201) obtaining constraint equation number in Constrained equations CN (P)=0 is Num and constrained parameters set Middle constrained parameters number is g, performs step (202)；

(202) compare the size of Num and g, if Num is equal to g, perform step (203), if Num is big In g, perform step (204), if Num is less than g, perform step (207)；

(203) the gloomy iterative method of newton pressgang is used to ask for constrained parameters steady-state value collection in Constrained equations CN (P)=0 Close P^S, and terminate；

(204) from Constrained equations CN (P)=0, arbitrarily choose g constraint equation and form the first equation group CN_g(P)=0, remaining (Num-g) individual constraint equation forms the second equation group CN_Num-g(P)=0, perform step (205)；

(205) the gloomy iterative method of newton pressgang is used to ask for the first equation group CN_g(P) constrained parameters steady-state value in=0 SetPerform step (206)；

(206) constraint IF parameter steady-state value setWhether meet the second equation group CN_Num-g(P) precision of=0 Requirement, if then assignmentAnd terminate, otherwise P^SFor empty set and terminate；

(207) stable state before changing of each constrained parameters in complex product function constrained parameters set P before changing is obtained It is worth and forms constraint steady-state value set before changingPerform step (208)；

(208) from constrained parameters set P, choose Num constrained parameters and form new constrained parameters set P ＇, From retraining steady-state value set before changingExtract steady-state value before changing corresponding to the constrained parameters of remaining (g-Num) also The set of compositionWill setIn value bring Constrained equations CN (P)=0 into, obtain third party's journey Group CN (P ＇)=0, performs step (209)；

(209) the gloomy iterative method of newton pressgang is used to ask for the constrained parameters steady-state value P ＇ of third party's journey group CN (P ＇)=0^S And preserve, perform step (210)；

(210) the constrained parameters steady-state value set of Constrained equations CN (P)=0 is obtainedAnd Terminate.

A kind of complex product complexity Dynamics Optimization method the most according to claim 3, it is characterised in that The gloomy iterative method of newton pressgang described in step (203), step (205) and step (208) includes following sub-step Rapid:

A corresponding Constrained equations is denoted as F (X)=[f by ()₁(X),f₂(X)…f_n(X)]=0, wherein X=[x₁,x₂…x_n] it is corresponding constrained parameters set, f₁(X) it is the 1st constraint equation, f₂(X) it is the 2nd Constraint equation, f_n(X) it is the n-th constraint equation, x₁It is the 1st constrained parameters, x₂It is the 2nd constrained parameters, x_nBeing the n-th constrained parameters, n is to retrain ginseng in constraint equation number and constrained parameters set in Constrained equations The number of number, performs step (b)；

B () assignment k=0, chooses each constrained parameters initial value composition constrained parameters in constrained parameters set X initial Value set, is denoted asWhereinIt is the 1st constrained parameters initial value,Be the 2nd about Bundle initial parameter value,It is the n-th constrained parameters initial value, performs step (c)；

C () calculatesPerform step (d)；

D () judgesWhether existing, if being carried out step (e), otherwise performing step (g)；

(e) calculating following formula:

$X^{k+1}=X^k-{\[\frac{\∂F\left(X^k\right)}{\∂X^k}\]}^{-1}F\left(X^k\right),$

Wherein, X^kFor constrained parameters kth time iterative value set, X^k+1For+1 iterative value collection of constrained parameters kth Close, F (X^k) it is Constrained equations kth time iterative value, perform step (f)；

F () calculates iteration difference ε_k+1=X^k+1-X^k, judge ε simultaneously_k+1 ^Tε_k+1＜ Acu_stopWhether set up, if Constraint EQ parameter steady-state value set P^S=X^k+1And terminate, otherwise assignment k=k+1 return step (c), wherein Acu_stopFor setting accuracy；

(g) constrained parameters steady-state value set P^SFor empty set, terminate.

A kind of complex product complexity Dynamics Optimization method the most according to claim 3, it is characterised in that The parameter steady-state value set of step (206) constraint IFWhether meet the second equation group CN_Num-g(P) precision of=0 Requirement, particularly as follows:

(2061) the constraint function set CN in the second equation group is extracted_Num-g(P)=0, by constrained parameters steady-state value SetIn value bring constraint function set CN into_Num-g(P) constraint function accuracy value, is asked for (2062) Δ ＜ Acu is judged_acp, if so, constrained parameters steady-state value setMeet the second equation group CN_Num-g(P) required precision of=0, the otherwise set of constrained parameters steady-state valueIt is unsatisfactory for the second equation group CN_Num-g(P) required precision of=0 wherein Acu_acpFor given constraint function precision.