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.
Originalsprog | Engelsk |
---|---|
Titel | GECCO 2022 Companion - Proceedings of the 2022 Genetic and Evolutionary Computation Conference |
Antal sider | 4 |
Forlag | Association for Computing Machinery (ACM) |
Publikationsdato | 9 jul. 2022 |
Sider | 188-191 |
ISBN (Elektronisk) | 9781450392686 |
DOI | |
Status | Udgivet - 9 jul. 2022 |
Begivenhed | 2022 Genetic and Evolutionary Computation Conference, GECCO 2022 - Virtual, Online, USA Varighed: 9 jul. 2022 → 13 jul. 2022 |
Konference
Konference | 2022 Genetic and Evolutionary Computation Conference, GECCO 2022 |
---|---|
Land/Område | USA |
By | Virtual, Online |
Periode | 09/07/2022 → 13/07/2022 |
Sponsor | ACM SIGEVO |
Navn | GECCO 2022 Companion - Proceedings of the 2022 Genetic and Evolutionary Computation Conference |
---|
Bibliografisk note
Publisher Copyright:© 2022 Owner/Author.