Collaborative Optimization Algorithm Based on the Penalty Function

Article Preview

Abstract:

The paper discusses the collaborative optimization problems with bounded. Based the penalty function the system-level optimization convert to a unconstraint programming. To the discipline-level optimization, the normalized weighted coefficients are used and combine relaxation factors to solve. It uses the relaxation factor to expand the feasible region, and possibly makes the iteration in the calculation process run inside feasible region. The data have shown that the algorithm has expanded the choice range of the initial points with high calculation accuracy and better algorithm stability.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

447-450

Citation:

Online since:

April 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. Sobieski: AIAA Journal. Vol. 28 (1990), pp.153-160.

Google Scholar

[2] J. Sobieski: NASA/CP-3031(1989), 249-260.

Google Scholar

[3] Braunrd A.A. Moore I.M. Kroo: Hampton, Va., USA: NASA Technical Report server(1996).

Google Scholar

[4] Haiyan Li, Mingxu Ma, Yuanwei Jing, and Rui Liu: Computer Integrated Manufacturing Systems, Vol. 15(2009), pp.2363-2369. In Chinese.

Google Scholar

[5] Bangguo Lie, Xia okai Chen, and Yi Lin: Journal of Jilin University (Engineering and Technology Edition), Vol. 40(2010), pp.1497-1501. In Chinese.

Google Scholar

[6] Haiyan Li, Yuanwei Jing, Mingxu Ma, and Ciying Zhang: Control and Decision, Vol. 24(2009), pp.911-920. In Chinese.

Google Scholar