Abstract

An optimisation algorithm that uses a bi-level structure in order to consolidate the solution among multiple discipline optimisations with both local and global design variables is presented. This algorithm is following the bi-level integrated system synthesis decomposition scheme but each discipline level optimisation has its own distinct objective function and constraints. The constraints from all the disciplines are accumulated at the system level optimisation in order to ensure that the final solution is feasible for all disciplines. The structure and the computational process of the algorithm are presented. Two analytical examples are solved for demonstrating the utility of the new algorithm. In all analyses, the optimal results converge on the Pareto front. It is further demonstrated that utilising different weights in the system level objective function allows constructing points on the Pareto front.

Full Text
Published version (Free)

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