.png){kind=icon}
Return
Split algorithms for multiobjective integer programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105673.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider split algorithms that partition the objective function space into - 1 dimensional regions so as to search for nondominated points of multiobjective integer programming problems, where is the number of objectives. We provide a unified approach that allows different split strategies to be used within the same algorithmic framework with minimum change. We also suggest an effective way of making use of the information on subregions when setting the parameters of the scalarization problems used in the -split structure. We compare the performances of variants of these algorithms both as exact algorithms and as solution approaches under time restriction, considering the fact that finding the whole set may be computationally infeasible or undesirable in practice. We demonstrate through computational experiments that while the (-1)-split structure is superior in terms of overall computational time, the-split structure provides significant advantage under time/cardinality limited settings in terms of representativeness, especially with adaptive parameter setting and/or a suitably chosen order for regions to be explored.
Keywords:
Multiobjective discrete optimization
Multiobjective integer programming
Pascoletti-Serafini scalarization
Weighted sum scalarization
Epsilon constraint scalarization
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveA Systematic Review of Clinical Diagnostic Systems Used in the Diagnosis of Tuberculosis in Children
OAAI
OAAIShareSaveA method for finding the set of non-dominated vectors for multiple objective integer linear programs
PREAI
ShareSaveShareSave
View more