A solution method for mixed-variable constrained blackbox optimization problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization and Engineering Année : 2023

A solution method for mixed-variable constrained blackbox optimization problems

Résumé

Many real-world application problems encountered in industry have no analytical formulation, that is they are blackbox optimization problems, and often make use of expensive numerical simulations. We propose a new blackbox optimization algorithm named BOA to solve mixed-variable constrained blackbox optimization problems where the evaluations of the blackbox functions are computationally expensive. The algorithm is two-phased: in the first phase it looks for a feasible solution and in the second phase it tries to find other feasible solutions with better objective values. Our implementation of the algorithm constructs surrogates approximating the blackbox functions and defines subproblems based on these models. The open-source blackbox optimization solver NOMAD is used for the resolution of the subproblems. Experiments performed on instances stemming from the literature and two automotive applications encountered at Stellantis show promising results of BOA in particular with cubic RBF models. The latter generally outperforms two surrogate-assisted NOMAD variants on the considered problems.
Fichier principal
Vignette du fichier
BOA_OptimizationAndEngineering.pdf (786.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04438239 , version 1 (05-02-2024)

Identifiants

Citer

Marie-Ange Dahito, Laurent Genest, Alessandro Maddaloni, José Neto. A solution method for mixed-variable constrained blackbox optimization problems. Optimization and Engineering, 2023, ⟨10.1007/s11081-023-09874-0⟩. ⟨hal-04438239⟩
23 Consultations
11 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More