An attempt to solve the Traveling Thief Problem for the GECCO 2024 competition.
Explore the docs »
Report Bug
·
Request Feature
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
- Brute Force
- Tabu Search
- Two Opt
- Nearest Insertion
- Simulated Annealing
- Lin kernighan
- Random
-
Clone the repo
git clone https://github.com/filippofinke/ttp
-
Change directory
cd ttp
cargo run --release
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".
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature
) - Commit your Changes (
git commit -m 'Add some AmazingFeature'
) - Push to the Branch (
git push origin feature/AmazingFeature
) - Open a Pull Request
TTP is released under the MIT License. See the LICENSE file for more details.
👤 Filippo Finke
- Website: https://filippofinke.ch
- Github: @filippofinke
- LinkedIn: @filippofinke
👤 Walter Sostene Losa
- Github: @enetsos
Give a ⭐️ if this project helped you!
![Buy Me A McFlurry](https://github.com/filippofinke/filippofinke/raw/main/images/buymeacoffe.png?raw=true)