Simulated Annealing with Dynamic Programming-based Vertex Insertion for Efficiently Solving the Travelling Thief Problem

This project is a java implementation of heuristic algorithms to solve the Travelling Thief Problem.

Contributors

Hoang Nguyen, Nam Le, Ngoc Hoang Luong, Khang Tran

Environment

• Programing language: Java 11+
• IDEA: IntelliJ IDEA 2022.2.1+
• OS: Linux (Ubuntu 22.04.3 LTS)

Algorithms

SAVI (based on Stimulated Annealing with Vertex Insertion)

Set up

Clone this repo

git clone https://github.com/hoangnqh/TTP-SAVI.git

Instruction

Open the project in IntelliJ IDEA with the previously mentioned environment and run it by executing the CLI class or running multiple instances sequentially using the 'run.py' file with the following command:

python3 run.py

Notes

Due to space constraint, TTP instances have been removed from the repository. You can find them at: TTP instances

Acknowledgements

Our source code is heavily relied and inspired by: Efficiently Solving the Traveling Thief Problem using Hill Climbing and Simulated Annealing by Mohamed El Yafrani and Belaïd Ahiod