Article Dans Une Revue Journal of Global Optimization Année : 2016

Design of space thrusters: a topology optimization problem solved via a Branch and Bound method

Résumé

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.

Fichier non déposé

Dates et versions

hal-03942709 , version 1 (17-01-2023)

Identifiants

Citer

Satafa Sanogo, Frédéric Messine. Design of space thrusters: a topology optimization problem solved via a Branch and Bound method. Journal of Global Optimization, 2016, 64 (2), pp.273-288. ⟨10.1007/s10898-015-0334-z⟩. ⟨hal-03942709⟩
80 Consultations
0 Téléchargements

Altmetric

Partager

  • More