2009
DOI: 10.1016/j.na.2009.02.077
|View full text |Cite
|
Sign up to set email alerts
|

Interval Robust Multi-objective Algorithm

Abstract: a b s t r a c tThis paper introduces a method for solving multi-objective optimization problems in uncertain environment. When the uncertainty factors of the optimization problem can be included into the mathematical model, through bounded intervals, [I]RMOA (Interval Robust Multi-objective Algorithm) can find an enclosure of the robust Pareto frontier. In this approach, the robust Pareto solutions are the ones that have the best performance when the worst case scenario, characterized by the uncertainty parame… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…In our approach, J was calculated with all n possible combinations of management ({J k } k=1 n ), separately for the ETH (J E ) and SMHIRCA (J S ) climate scenarios to account for climate projection uncertainties and identify robust optimum solutions. A robust solution was defined here as the one with best performance for the worst case scenario (Soares et al 2009). This means in practice that, for every k, the minimum between J E and J S was selected to make a new series J * , which was maximized for every pixel.…”
Section: Spatial Optimization Routinementioning
confidence: 99%
“…In our approach, J was calculated with all n possible combinations of management ({J k } k=1 n ), separately for the ETH (J E ) and SMHIRCA (J S ) climate scenarios to account for climate projection uncertainties and identify robust optimum solutions. A robust solution was defined here as the one with best performance for the worst case scenario (Soares et al 2009). This means in practice that, for every k, the minimum between J E and J S was selected to make a new series J * , which was maximized for every pixel.…”
Section: Spatial Optimization Routinementioning
confidence: 99%
“…The Pareto set P of MOP (27) Similar in spirit are methods based on interval analysis (e.g., [47][48][49][50]). These interval analysis techniques ensure that the box collection is always a superset of the Pareto set, that is, that no sub-box that contains a part of P is rejected wrongly, leading to reliable numerical computations of the Pareto set.…”
Section: Set Oriented Approachesmentioning
confidence: 99%
“…For instance, Soares et al [25] built a guaranteed wrapper over the robust Pareto front using a deterministic algorithm based only on interval methods. Also, Soares et al [26] utilized an evolutionary approach to solve a constrained multi-objective electromagnetic design problem.…”
Section: Robust Multi-objective Problemmentioning
confidence: 99%