LARGE-SCALE SET PARTITIONING PROBLEMS: SOME REAL‐WORLD INSTANCES HIDE A BENEFICIAL STRUCTURE
研究了来自集装箱运输行业的真实大规模集合划分问题，通过计算实验发现这些实例比一般基准实例更容易求解，并分析了其隐藏的有益结构。
In this paper we consider large‐scale set partitioning problems. Our main purpose is to show that real‐world set partitioning problems originating from the container‐trucking industry are easier to tackle in respect to general ones. We show such different behavior through computational experiments: in particular, we have applied both a heuristic algorithm and some exact solution approaches to real‐world instances as well as to benchmark instances from Beasley OR‐library. Moreover, in order to gain an insight into the structure of the real-world instances, we have performed and evaluated various instance perturbations.