Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Evolutionary multi-objective worst-case robust optimisation

Tools
- Tools
+ Tools

Lu, Ke (2017) Evolutionary multi-objective worst-case robust optimisation. PhD thesis, University of Warwick.

[img]
Preview
PDF
WRAP_Theses_Lu_2017.pdf - Submitted Version - Requires a PDF viewer.

Download (3759Kb) | Preview
Official URL: http://webcat.warwick.ac.uk/record=b3229679~S15

Request Changes to record.

Abstract

Many real-world problems are subject to uncertainty, and often solutions should not only be good, but also robust against environmental disturbances or deviations from the decision variables. While most papers dealing with robustness aim at finding solutions with a high expected performance given a distribution of the uncertainty, we examine the trade-off between the allowed deviations from the decision variables (tolerance level), and the worst case performance given the allowed deviations. In this research work, we suggest two multi-objective evolutionary algorithms to compute the available trade-offs between allowed tolerance level and worst-case quality of the solutions, and the tolerance level is defined as robustness which could also be the variations from parameters. Both algorithms are 2-level nested algorithms. While the first algorithm is point-based in the sense that the lower level computes a point of worst case for each upper level solution, the second algorithm is envelope-based, in the sense that the lower level computes a whole trade-off curve between worst-case fitness and tolerance level for each upper level solution.

Our problem can be considered as a special case of bi-level optimisation, which is computationally expensive, because each upper level solution is evaluated by calling a lower level optimiser. We propose and compare several strategies to improve the efficiency of both algorithms. Later, we also suggest surrogate-assisted algorithms to accelerate both algorithms.

Item Type: Thesis or Dissertation (PhD)
Subjects: Q Science > QA Mathematics
Library of Congress Subject Headings (LCSH): Robust optimization, Uncertainty, Mathematical optimization, Evolutionary computation
Official Date: September 2017
Dates:
DateEvent
September 2017Submitted
Institution: University of Warwick
Theses Department: Warwick Business School
Thesis Type: PhD
Publication Status: Unpublished
Supervisor(s)/Advisor: Branke, Jürgen, 1969- ; Gülpinar, Nalân
Format of File: pdf
Extent: vi, 112 leaves : illustrations, charts
Language: eng

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us