Polish-Japanese Academy of Information Technology, Warsaw, Poland
Complexica, Adelaide, Australia
Evol Comput. 2018 Fall;26(3):507-533. doi: 10.1162/EVCO_a_00211. Epub 2017 Jun 20.
Real-world optimization problems have been studied in the past, but the work resulted in approaches tailored to individual problems that could not be easily generalized. The reason for this limitation was the lack of appropriate models for the systematic study of salient aspects of real-world problems. The aim of this article is to study one of such aspects: multi-hardness. We propose a variety of decomposition-based algorithms for an abstract multi-hard problem and compare them against the most promising heuristics.
过去已经研究过真实世界的优化问题，但这些工作产生的方法针对特定问题进行了定制，不容易推广。造成这种限制的原因是缺乏适当的模型来系统研究真实世界问题的突出方面。本文的目的是研究其中一个方面：多硬度。我们针对一个抽象的多硬度问题提出了多种基于分解的算法，并将它们与最有前途的启发式算法进行了比较。
