论文标题
动态旅行小偷问题：基准和进化算法的性能
The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms
论文作者
论文摘要
许多实际优化问题涉及动态和随机组件。尽管多个交互组件的问题在固有的动态域（如供应链优化和物流）中无所不在，但有关动态问题的大多数研究都集中在单组分问题上。在本文中，我们根据旅行小偷问题定义了许多方案，以研究对亚材料的动态变化的影响。我们对72个方案和7种算法的调查表明，取决于实例，更改的幅度以及投资组合中的算法 - 最好是从划痕重新启动优化或继续使用先前有效的解决方案。
Many real-world optimisation problems involve dynamic and stochastic components. While problems with multiple interacting components are omnipresent in inherently dynamic domains like supply-chain optimisation and logistics, most research on dynamic problems focuses on single-component problems. With this article, we define a number of scenarios based on the Travelling Thief Problem to enable research on the effect of dynamic changes to sub-components. Our investigations of 72 scenarios and seven algorithms show that -- depending on the instance, the magnitude of the change, and the algorithms in the portfolio -- it is preferable to either restart the optimisation from scratch or to continue with the previously valid solutions.
