Journal of System Simulation
Abstract
Abstract: To solve problem of high computational cost and low convergence speed of initial points away from the optimal solution in collaborative optimization, a new dynamic relaxation cooperative optimization method with fast convergence is presented. Two-phase optimization is adopted in this method. In the accelerating convergence phase, the calculation method of relaxation factor is improved, and the inconsistent information between the optimal value of disciplines and its mean value is used to construct the relaxation factor. The optimization solution of the first phase is adopted as the initial points in the optimization solution phase. The relaxation factor satisfying the consistent precision requirement is selected for cooperative optimization, and the global optimal solution is obtained. A typical numerical example and the reducer MDO problem are adopted to test this optimization method. Experimental results show that the proposed method can greatly reduce the computational cost and accelerate the convergence speed of the initial points away from the optimal solution.
Recommended Citation
Jing, Chen; Lü, Yuchao; and Wang, Limin
(2019)
"Dynamic Relaxation Cooperative Optimization Method with Fast Convergence,"
Journal of System Simulation: Vol. 30:
Iss.
1, Article 12.
DOI: 10.16182/j.issn1004731x.joss.201801012
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol30/iss1/12
First Page
96
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.201801012
Last Page
104
CLC
TP301.6
Recommended Citation
Chen Jing, Lü Yuchao, Wang Limin. Dynamic Relaxation Cooperative Optimization Method with Fast Convergence[J]. Journal of System Simulation, 2018, 30(1): 96-104.
DOI
10.16182/j.issn1004731x.joss.201801012
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons