Design of space thrusters: a topology optimization problem solved via a Branch and Bound method |
| |
Authors: | Satafa?Sanogo Email author" target="_blank">Frédéric?MessineEmail author |
| |
Institution: | 1.Université de Toulouse, Laplace (CNRS UMR5213, Toulouse INP),Toulouse,France |
| |
Abstract: | In this paper, an exact Branch and Bound Algorithm has been developed to solve a difficult global optimization problem concerning the design of space thrusters. This optimization problem is hard to solve mainly because the objective function to be minimized is implicit and must be computed by using a Finite Element method code. In a previous paper, we implement a method based on local search algorithms and we then proved that this problem is non convex yielding a strong dependency between the obtained local solution and the starting points. In this paper, by taking into account a monotonicity hypothesis that we validated numerically, we provide properties making it possible the computation of bounds. This yields the development of a topology optimization Branch and Bound code. Some numerical examples show the efficiency of this new approach. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|