Finding Feasible Solutions to Hard Mixed-integer Programming Problems Using Hybrid Heuristics

机译：使用混合启发式查找硬混合整数编程问题的可行解决方案

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

In current mixed-integer programming (MIP) solvers heuristics are used to find feasible solutions before the branch-and-bound or branch-and-cut algorithm is a])plied to the problem. Knowing a feasible solution can improve the solutions found or the time to solve the problem very much. This paper discusses hybrid heuristics for this purpose. Hybrid in this context means that these heuristics use the branch-and-bound algorithm to search a smaller subproblem. Several possible hybrid heuristics are presented and computational results are. given.

机译：在目前的混合整数编程（MIP）中，求解器启发式可以在分支和绑定或分支和切割算法之前找到可行的解决方案）。了解可行的解决方案可以改善发现的解决方案或者时间非常解决问题。本文讨论了这种目的的混合动力车启发式。在这种背景下的混合动力案意味着这些启发式使用分支和绑定算法搜索一个较小的子问题。提出了几种可能的混合动力车启发式，并且计算结果是。给予。

著录项

来源
《International Conference on Operations Research》|2006年||共6页
会议地点
作者
Philipp M. Christophel; Leena Suhl; Uwe H. Suhl;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类 O22-532;
关键词

相似文献

外文文献
中文文献
专利

1. A hybrid primal heuristic for finding feasible solutions to mixed integer programs [J] . Andrade Carlos E., Ahmed Shabbir, Nemhauser George L., European Journal of Operational Research . 2017,第1期

机译：用于查找混合整数程序的可行解决方案的混合原始启发式
2. A new mixed-integer linear programming formulation and particle swarm optimization based hybrid heuristic for the problem of resource investment and balancing of the assembly line with multi-manned workstations [J] . Sahin Murat, Kellegoz Talip Computers & Industrial Engineering . 2019,第JULa期

机译：一种新的混合整数线性规划公式和基于粒子群算法的混合启发式算法，解决了多人工作站的资源投入和装配线平衡问题
3. A new mixed-integer linear programming formulation and particle swarm optimization based hybrid heuristic for the problem of resource investment and balancing of the assembly line with multi-manned workstations [J] . Sahin Murat, Kellegoz Talip Computers & Industrial Engineering . 2019,第Jula期

机译：基于新的混合整数线性编程配方和基于粒子群优化的混合启发式，用于多载流的资源投资问题与汇编线路的平衡
4. Finding Feasible Solutions to Hard Mixed-integer Programming Problems Using Hybrid Heuristics [C] . Philipp M. Christophel, Leena Suhl, Uwe H. Suhl International Conference on Operations Research . 2006

机译：使用混合启发式查找硬混合整数编程问题的可行解决方案
5. Advances in portfolio selection under discrete choice constraints: A mixed-integer programming approach and heuristics. [D] . Stoyan, Stephen James. 2009

机译：离散选择约束下投资组合选择的进展：混合整数编程方法和启发式方法。
6. Large-Scale Bi-Level Strain Design Approaches and Mixed-Integer Programming Solution Techniques [O] . Joonhoon Kim, Jennifer L. Reed, Christos T. Maravelias 2011

机译：大型双水平应变的设计方法和混合整数规划求解技巧
7. A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems [O] . Fang He, Rong Qu 2015

机译：用于投资组合选择问题的两阶段随机混合整数规划建模和混合解决方案方法
8. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity constraint. Technical report [R] . Dantzig, G B 1992

机译：包含von Newmann算法所示的加速收敛的包围，用于找到具有凸性约束的线性程序的可行解。技术报告

Finding Feasible Solutions to Hard Mixed-integer Programming Problems Using Hybrid Heuristics

摘要

著录项

相似文献

相关主题

期刊订阅