.png){kind=icon}
Return
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2018.05.036.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we present the modified augmented weighted Tchebychev norm, which can be used to generate a complete efficient set of solutions to a discrete multi-objective optimization problem. We contribute a generating algorithm that will, without supervision, generate the entire non-dominated set for any number of objectives. To our knowledge, this is the first generating method for general discrete multi objective problems that uses a variant of the Tchebychev norm. In a computational study, our algorithm's running times are comparable to previously proposed algorithms. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Multiple objective programming
Tchebychev norm
Computational optimization
Generating methods
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
Cited Papers
.png){kind=icon}
ShareSaveA method for finding the set of non-dominated vectors for multiple objective integer linear programs
PREAI
ShareSaveShareSaveShareSave
View more