Traveling Thief Problem - Gecco 2024

An attempt to solve the Traveling Thief Problem for the GECCO 2024 competition.
Explore the docs »

Report Bug · Request Feature

About The Project

This project is an attempt to solve the Traveling Thief Problem for the GECCO 2024 competition.
The Traveling Thief Problem (TTP) is a combination of the Traveling Salesman Problem (TSP) and the Knapsack Problem (KP).

Demo

demo.mp4

Algorithms

TSP

• Brute Force
• Tabu Search
• Two Opt
• Nearest Insertion
• Simulated Annealing
• Lin kernighan

KP

• Random

Getting Started

Installation

1. Clone the repo

   git clone https://github.com/filippofinke/ttp

2. Change directory

   cd ttp

Usage

cargo run --release

Contributing

Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.

If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement".

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

TTP is released under the MIT License. See the LICENSE file for more details.

Author

👤 Filippo Finke

• Website: https://filippofinke.ch
• Github: @filippofinke
• LinkedIn: @filippofinke

👤 Walter Sostene Losa

• Github: @enetsos

Show your support

Give a ⭐️ if this project helped you!