.png){kind=icon}
.png){kind=icon}
Return
Bi-objective robust optimisation
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2016.01.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is important, in practice, to find robust solutions to optimisation problems. This issue has been the subject of extensive research focusing on single-objective problems. Recently, researchers also acknowledged the need to find robust solutions to multi-objective problems and presented some first results on this topic. In this paper, we deal with bi-objective optimisation problems in which only one objective function is uncertain. The contribution of our paper is three-fold. Firstly, we introduce and analyse four different robustness concepts for bi-objective optimisation problems with one uncertain objective function, and we propose an approach for defining a meaningful robust Pareto front for these types of problems. Secondly, we develop an algorithm for computing robust solutions with respect to these four concepts for the case of discrete optimisation problems. This algorithm works for finite and for polyhedral uncertainty sets using a transformation to a multi-objective (deterministic) optimisation problem and the recently published concept of Pareto robust optimal solutions (lancu & Trichakis, 2014). Finally, we apply our algorithm to two real-world examples, namely aircraft route guidance and the shipping of hazardous materials, illustrating the four robustness concepts and their solutions in practical applications. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Multiple objective programming
Robust optimisation
OR in transportation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations