Abstract

Probabilistic Analytical Target Cascading (PATC) is a methodology for hierarchical multilevel optimization under uncertainty. In PATC, the statisticalmoments of the stochastic interrelated responses are matched between neighbouring levels to ensure the consistency of the solution. When the interrelated response is far from normal distribution, high order moments may need to be matched in the PATC formulation, which results in great computational difficulty. To overcome this disadvantage, a sequential PATC (SPATC) approach is proposed in this paper. SPATC firstly decouples the original probabilistic design problem into deterministic optimization problem and probabilistic analysis, and then hierarchically decomposes them into subproblems. The statistical information matching between neighbouring levels in the existing PATC framework is eliminated in SPATC. All in one probabilistic analysis and hierarchical probabilistic analysis are established to calculate the probabilistic characteristic of the interrelated responses and linking variables. Three examples are used to demonstrate the effectiveness and efficiency of the proposed SPATC approach. The results show that the SPATC approach is more efficient and accurate than PATC, especially for the multilevel design problem with non-normal interrelated responses.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.