arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.01077math.OC
收藏

一种基于Oracle的鲁棒组合optimization框架

An oracle-based framework for robust combinatorial optimization

Enrico Bettiol, Christoph Buchheim, Marianna De Santis, Francesco Rinaldi

摘要:

提出了一种求解具有不确定线性目标的组合最优化问题的最小最大鲁棒问题的一般方法。我们专注于离散场景的情况下,但我们的方法可以扩展到其他类型的不确定性集,如多面体或椭球。关于潜在的某些问题,该算法完全基于Oracle,即,我们的方法仅需要用于解决特定问题的(原始)算法。因此,它在潜在问题难以解决的情况下特别有用,或者仅由解决特定情况的给定软件隐式定义。我们的算法的思想是解决凸松弛的鲁棒问题的单纯分解方法,主要的挑战是不可微的情况下,离散或多面体的不确定性的目标函数。由此产生的双重界限,然后使用一个定制的分支和边界的框架内解决鲁棒性问题的最优性。通过计算评估,我们表明,我们的方法优于简单的线性化方法的鲁棒最小生成树问题。此外,使用Concorde求解器的某些甲骨文,我们的方法计算更好的双重边界的鲁棒流动推销员问题在相同的时间。

英文摘要:

We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario case, but our approach can be extended to other types of uncertainty sets such as polytopes or ellipsoids. Concerning the underlying certain problem, the algorithm is entirely oracle-based, i.e., our approach only requires a (primal) algorithm for solving the certain problem. It is thus particularly useful in case the underlying problem is hard to solve, or only defined implicitly by a given software addressing the certain case. The idea of our algorithm is to solve the convex relaxation of the robust problem by a simplicial decomposition approach, the main challenge being the non-differentiability of the objective function in the case of discrete or polytopal uncertainty. The resulting dual bounds are then used within a tailored branch-and-bound framework for solving the robust problem to optimality. By a computational evaluation, we show that our method outperforms straightforward linearization approaches on the robust minimum spanning tree problem. Moreover, using the Concorde solver for the certain oracle, our approach computes much better dual bounds for the robust traveling salesman problem in the same amount of time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑