.png){kind=icon}
Return
Experiments with classification-based scalarizing functions in interactive multiobjective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.06.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In multiobjective optimization methods, the multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions and such functions may be constructed in many ways. We compare both theoretically and numerically the performance of three classification-based scalarizing functions and pay attention to how well they obey the classification information. In particular, we devote special interest to the differences the scalarizing functions have in the computational cost of guaranteeing Pareto optimality. It turns out that scalarizing functions with or without so-called augmentation terms have significant differences in this respect. We also collect a set of mostly nonlinear benchmark test problems that we use in the numerical comparisons. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
multiple objective programming
classification
interactive methods
test problems
guaranteeing pareto optimality
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
Organization
No organization information available
Cited Papers
INTERACTIVE MULTIOBJECTIVE DECISION-MAKING BY THE SEQUENTIAL PROXY OPTIMIZATION TECHNIQUE - SPOT
OAAI
.png){kind=icon}
OAAIShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveAttitudes of Agricultural Experts Toward Genetically Modified Crops: A Case Study in Southwest Iran
PREAI
ShareSave
View more