Scatter Search to Generate Diverse MIP Solutions
Scatter Search to Generate Diverse MIP Solutions
复制标题
分散搜索生成多样化的 MIP 解决方案
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
D. L. Woodruff
中科院分区：
文献类型：
--
作者：
F. Glover;A. Løkketangen;D. L. Woodruff
目标函数通常只是组织及其利益相关者的实际目标的粗略近似。因此，一个最优的解决方案可能并不比其他提供良好价值的解决方案更有趣。除此之外，一组成员具有不同特征的“好”解决方案对于实际分析和规划可能比任何单一的“最佳”解决方案更有价值。然而，系统地揭示如此多样化的解决方案，甚至假设其定义特征可能是什么，这一挑战显然被忽视了。我们解决这一挑战0-1混合整数规划问题，并提供我们的方法的计算效率的演示。
An objective function often is only a rough approximation of the actual goals of the organization and its stakeholders. Consequently, an optimal solution may be no more interesting than other solutions that provide good values. Beyond this, a set of “good” solutions whose members have diverse characteristics can be significantly more valuable for practical analysis and planning than any single, “best” solution. Yet the challenge of systematically uncovering such a diverse set of solutions, or even postulating what its defining features may be, has been conspicuously neglected. We address this challenge for 0-1 mixed integer programming problems and provide demonstrations of the computational efficiency of our approach.