A memetic approach to the solution of constrained min-max problems

Tools

Filippi, Gianluca and Vasile, Massimiliano (2019) A memetic approach to the solution of constrained min-max problems. In: 2019 IEEE Congress on Evolutionary Computation, 2019-06-10 - 2019-06-13.

[thumbnail of Filippi-Vasile-CEC-2019-A-memetic-approach-to-the-solution-of-constrained]
Preview
 Text. Filename: Filippi_Vasile_CEC_2019_A_memetic_approach_to_the_solution_of_constrained.pdf
Accepted Author Manuscript
Download (769kB)| Preview

Abstract

This paper proposes a novel memetic algorithm for the solution of constrained min-max problems that derive from the optimal design of complex systems under worst-case conditions. In this context the maximisation of a quantity of interest over the space of uncertain variables is required to identify the worst-case scenario (or worst-case solution under uncertainty). An optimal design vector is then identified such that the worst-case value of the quantity of interest is minimised. In the most general case, both maximisation and minimisation are subject to strict feasibility constraints. The ultimate goal of the minimisation problem is to identify the design solution that is feasible for all possible values of the uncertain parameters.

ORCID iDs

Filippi, Gianluca and Vasile, Massimiliano ORCID logoORCID: https://orcid.org/0000-0001-8302-6465;
CORE (COnnecting REpositories)