.png){kind=icon}
返回
A recombination-based matheuristic for mixed integer programming problems with binary variables
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12526.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work introduces a heuristic for mixed integer programming (MIP) problems with binary variables, based on information obtained from differences between feasible solutions as well as solutions from the linear relaxation. This information is used to build a neighborhood that is explored as a sub-MIP problem. The proposed heuristic is evaluated using 45 problems from the MIPLIB repository. Its performance, in terms of solution improvement over the results obtained after exploring 50,000 nodes of the branch-and-bound tree, is compared against that of Solution Polishing, which is another recombination-based heuristic for MIP problems used within the CPLEX solver; as well as against the solution obtained by running the default CPLEX branch-and-cut (B&C) method under a same time limit. The computational results indicate that the proposed method is able to yield results that are significantly better than those obtained by the default CPLEX B&C approach and comparable to those of Solution Polishing in terms of the mean solution quality. This equivalence of expected solution quality, coupled with a simpler implementation, suggests the use of the proposed approach as a possible alternative for improving the quality of solutions in MIP problems.
Keyword:
combinatorial optimization
integer programming
metaheuristics
branch and bound
local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Recovery of salinity gradient energy in desalination plants by reverse electrodialysis.png)
DesalinationOAAI
DesalinationIF0
OAAI分享收藏
Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environmentsRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容