Abstract
Since its inception in 2013, the Travelling Thief Problem (TTP) has been widely studied as an example of problems with multiple interconnected sub-problems. The dependency in this model arises when tying the travelling time of the "thief"to the weight of the knapsack. However, other forms of dependency as well as combinations of dependencies should be considered for investigation, as they are often found in complex real-world problems. Our goal is to study the impact of different forms of dependency in the TTP using a simple local search algorithm. To achieve this, we use Local Optima Networks, a technique for analysing the fitness landscape.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2022 Genetic and Evolutionary Computation Conference Companion |
Editors | Jonathan Fieldsend |
Place of Publication | New York NY USA |
Publisher | Association for Computing Machinery (ACM) |
Pages | 188-191 |
Number of pages | 4 |
ISBN (Electronic) | 9781450392686 |
DOIs | |
Publication status | Published - 2022 |
Externally published | Yes |
Event | The Genetic and Evolutionary Computation Conference 2022 - Online, Boston, United States of America Duration: 9 Jul 2022 → 13 Jul 2022 https://dl.acm.org/doi/proceedings/10.1145/3520304 (Proceedings) https://gecco-2022.sigevo.org/HomePage (Website) |
Conference
Conference | The Genetic and Evolutionary Computation Conference 2022 |
---|---|
Abbreviated title | GECCO 2022 |
Country/Territory | United States of America |
City | Boston |
Period | 9/07/22 → 13/07/22 |
Internet address |
|
Keywords
- basins of attraction
- interdependency models
- local optima networks
- travelling thief problem