.png){kind=icon}
返回
Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.04.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this study, biobjective mixed 0-1 integer linear programming problems are considered and two heuristic approaches are presented to find the Pareto frontier of these problems. The first heuristic is a variant of the variable neighborhood search and explores the k-neighbors of a feasible solution (in terms of binary variables) to find the extreme supported Pareto points. The second heuristic is adapted from the local branching method, which is well-known in single objective mixed 0-1 integer linear programming. Finally, an algorithm is proposed to find Pareto segments of outcome line segments of these heuristics. A computational analysis is performed by using some test problems from the literature and the results are presented. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Multiobjective programming
Biobjective mixed 0-1 integer linear programming
Variable neighborhood search
Local branching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case混合0-1线性规划的多目标分支和界限: 对双目标情况的修正和改进
PREAI
分享收藏Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
Radiation-induced graft copolymerization of dimethylaminoethyl methacrylate onto graphene oxide for Cr(VI) removal辐射诱导甲基丙烯酸二甲基氨基乙酯在氧化石墨烯上的接枝共聚以去除Cr(VI)
PREAI
分享收藏
查看更多内容