Performance Evaluation of MDO Architectures within a Variable Complexity Problem

Daiyu Zhang, Baowei Song, Peng Wang and Yanru He

Mathematical Problems in Engineering, 2017, vol. 2017, 1-9

Abstract:

Though quite a number of multidisciplinary design optimization (MDO) architectures have been proposed for the optimal design of large-scale multidisciplinary systems, how their performance changes with the complexity of MDO problem varied is not well studied. In order to solve this problem, this paper presents a variable complexity problem which allows people to obtain a MDO problem with arbitrary complexity by specifying its changeable parameters, such as the number of disciplines and the numbers of design variables. Then four investigations are performed to evaluate how the performance of different MDO architectures changes with the number of disciplines, global variables, local variables, and coupling variables varied, respectively. Finally, the results supply guidance for the selection of MDO architectures in solving practical engineering problems with different complexity.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/2759762.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/2759762.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:2759762

DOI: 10.1155/2017/2759762

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().