Analysis of two algorithms for multi-objective min-max optimization

Simone Alicino, Massimiliano Vasile

Research output: Contribution to conferencePaper

94 Downloads (Pure)

Abstract

This paper presents two memetic algorithms to solve multi-objective min-max problems, such as the ones that arise in evidence-based robust optimization. Indeed, the solutions that minimize the design budgets are robust under epistemic uncertainty if they maximize the belief in the realization of the value of the design budgets. Thus robust solutions are found by minimizing with respect to the design variables the global maximum with respect to the uncertain variables. A number of problems, composed of functions whose uncertain space is modelled by means of Evidence Theory, and presenting multiple local maxima as well as concave, convex, and disconnected fronts, are used to test the performance of the proposed algorithms.
Original languageEnglish
Pages1-13
Publication statusPublished - 13 Sep 2014
EventBio-inspired Optimization Methods and their Applications, BIOMA 14 - Ljubljana, Slovenia
Duration: 13 Sep 201413 Sep 2014

Conference

ConferenceBio-inspired Optimization Methods and their Applications, BIOMA 14
CountrySlovenia
CityLjubljana
Period13/09/1413/09/14

Keywords

  • evidence-based robust optimization
  • multi-objective optimization
  • worst-case scenario design

Fingerprint Dive into the research topics of 'Analysis of two algorithms for multi-objective min-max optimization'. Together they form a unique fingerprint.

Cite this