2017
DOI: 10.1007/978-3-319-54157-0_10
|View full text |Cite
|
Sign up to set email alerts
|

An Approach for the Local Exploration of Discrete Many Objective Optimization Problems

Abstract: Multi-objective optimization problems with more than three objectives, which are also termed as many objective optimization problems, play an important role in the decision making process. For such problems, it is computationally expensive or even intractable to approximate the entire set of optimal solutions. An alternative is to compute a subset of optimal solutions based on the preferences of the decision maker. Commonly, interactive methods from the literature consider the user preferences at every iterati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…A popular approach for MaOPs is comprised of interactive methods [173][174][175][176][177][178]. These methods do not compute the entire set of optimal compromises, but instead interactively explore the Pareto set.…”
Section: Reduction Techniques For Many-objective Optimization Problemsmentioning
confidence: 99%
“…A popular approach for MaOPs is comprised of interactive methods [173][174][175][176][177][178]. These methods do not compute the entire set of optimal compromises, but instead interactively explore the Pareto set.…”
Section: Reduction Techniques For Many-objective Optimization Problemsmentioning
confidence: 99%
“…A popular approach for MaOPs are interactive methods [173][174][175][176][177][178]. These methods do not compute the entire set of optimal compromises but instead interactively explore the Pareto set.…”
Section: Reduction Techniques For Many-objective Optimization Problemsmentioning
confidence: 99%
“…A popular approach for MaOPs are interactive methods [163][164][165][166][167][168]. These methods do not compute the entire set of optimal compromises but instead interactively explore the Pareto set.…”
Section: Reduction Techniques For Many-objective Optimization Problemsmentioning
confidence: 99%