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

Research output: Contribution to conferencePaper

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.
LanguageEnglish
Number of pages8
Publication statusPublished - 13 Jun 2019
Event2019 IEEE Congress on Evolutionary Computation - Wellington, New Zealand
Duration: 10 Jun 201913 Jun 2019

Conference

Conference2019 IEEE Congress on Evolutionary Computation
Abbreviated titleIEEE CEC 2019
CountryNew Zealand
CityWellington
Period10/06/1913/06/19

Fingerprint

Large scale systems
Optimal design
Uncertainty

Keywords

  • worst case scenario
  • min-max
  • epistemic uncertainty
  • benchmark

Cite this

Filippi, G., & Vasile, M. (2019). A memetic approach to the solution of constrained min-max problems. Paper presented at 2019 IEEE Congress on Evolutionary Computation, Wellington, New Zealand.
Filippi, Gianluca ; Vasile, Massimiliano. / A memetic approach to the solution of constrained min-max problems. Paper presented at 2019 IEEE Congress on Evolutionary Computation, Wellington, New Zealand.8 p.
@conference{d9d91179b72245c3a63711d186df1227,
title = "A memetic approach to the solution of constrained min-max problems",
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.",
keywords = "worst case scenario, min-max, epistemic uncertainty, benchmark",
author = "Gianluca Filippi and Massimiliano Vasile",
year = "2019",
month = "6",
day = "13",
language = "English",
note = "2019 IEEE Congress on Evolutionary Computation, IEEE CEC 2019 ; Conference date: 10-06-2019 Through 13-06-2019",

}

Filippi, G & Vasile, M 2019, 'A memetic approach to the solution of constrained min-max problems' Paper presented at 2019 IEEE Congress on Evolutionary Computation, Wellington, New Zealand, 10/06/19 - 13/06/19, .

A memetic approach to the solution of constrained min-max problems. / Filippi, Gianluca; Vasile, Massimiliano.

2019. Paper presented at 2019 IEEE Congress on Evolutionary Computation, Wellington, New Zealand.

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Filippi, Gianluca

AU - Vasile, Massimiliano

PY - 2019/6/13

Y1 - 2019/6/13

N2 - 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.

AB - 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.

KW - worst case scenario

KW - min-max

KW - epistemic uncertainty

KW - benchmark

UR - http://cec2019.org/

M3 - Paper

ER -

Filippi G, Vasile M. A memetic approach to the solution of constrained min-max problems. 2019. Paper presented at 2019 IEEE Congress on Evolutionary Computation, Wellington, New Zealand.