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

arXiv: https://arxiv.org/abs/2004.12045 · HTML: https://mlsanity.com/paper/2004.12045/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Apr 2020.

## Built on by (most cited first, 1 of 1)

- [Solving Travelling Thief Problems using Coordination Based Methods](https://mlsanity.com/paper/2310.07156/) (2023)

## Abstract (arXiv)

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.