.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Multiobjective programming
Biobjective mixed 0-1 integer linear programming
Variable neighborhood search
Local branching
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
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveAlginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
ShareSave
View more