The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms

Many real-world optimisation problems involve dynamic and stochastic\ncomponents. While problems with multiple interacting components are omnipresent\nin inherently dynamic domains like supply-chain optimisation and logistics,\nmost research on dynamic problems focuses on single-component problems. With\nthis article, we define a number of scenarios based on the Travelling Thief\nProblem to enable research on the effect of dynamic changes to sub-components.\nOur investigations of 72 scenarios and seven algorithms show that -- depending\non the instance, the magnitude of the change, and the algorithms in the\nportfolio -- it is preferable to either restart the optimisation from scratch\nor to continue with the previously valid solutions.\n