.png){kind=icon}
返回
Generating hard instances for robust combinatorial optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.07.036.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a missing set of benchmark instances that make algorithm performance better comparable, and makes reproducing instances unnecessary. Such a benchmark set should contain hard instances in particular, but so far, the standard approach to produce instances has been to sample values randomly from a uniform distribution. In this paper we introduce a new method to produce hard instances for min-max combinatorial optimization problems, which is based on an optimization model itself. Our approach does not make any assumptions on the problem structure and can thus be applied to any combinatorial problem. Using the SELECTION and TRAVELING SALESMAN problems as examples, we show that it is possible to produce instances which are up to 500 times harder to solve for a mixed-integer programming solver than the current state-of-the-art instances. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Robustness and sensitivity analysis
Robust optimization
Problem benchmarking
Problem generation
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
分享收藏分享收藏A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problemminmax后悔优化中点解的新界及其在鲁棒最短路径问题中的应用OAAI
OAAI分享收藏分享收藏Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints具有时间窗约束的车辆路径和调度问题的算法
PREAI
分享收藏The ASP1 gene of Saccharomyces cerevisiae, encoding the intracellular isozyme of l-asparaginase.png)
Gene
GeneIF0
PREAI
分享收藏
查看更多内容