.png){kind=icon}
返回
Split algorithms for multiobjective integer programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105673.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Multiobjective discrete optimization
Multiobjective integer programming
Pascoletti-Serafini scalarization
Weighted sum scalarization
Epsilon constraint scalarization
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
A decision space algorithm for multiobjective convex quadratic integer optimization多目标凸二次整数优化的决策空间算法
OAAI
.png){kind=icon}
OAAI分享收藏A Systematic Review of Clinical Diagnostic Systems Used in the Diagnosis of Tuberculosis in ChildrenOAAI
OAAI分享收藏A method for finding the set of non-dominated vectors for multiple objective integer linear programs一种求多目标整数线性规划非支配向量集的方法
PREAI
分享收藏
查看更多内容