.png){kind=icon}
.png){kind=icon}
Return
Finding preferre d solutions under weighte d Tchebycheff preference functions for multi-objective integer programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2022.11.043.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many interactive approaches in multi-objective optimization assume the existence of an underlying pref-erence function that represents the preferences of a decision maker (DM). In this paper, we develop the theory and an exact algorithm that guarantees finding the most preferred solution of a DM whose pref-erences are consistent with a Tchebycheff function for multi-objective integer programs. The algorithm occasionally presents pairs of solutions to the DM and asks which one is preferred. It utilizes the prefer-ence information together with the properties of the Tchebycheff function to generate solutions that are candidates to be the most preferred solution. We test the performance of the algorithm on a set of three and four-objective combinatorial optimization problems.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Multiple objective programming
Tchebycheff function
Interactive approach
Preferred solution
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W