Zeitkomplexität/Theory of computation
-
Updated
Apr 22, 2024
Zeitkomplexität/Theory of computation
This project solves the GECCO19 Traveling Thief Problem (TTP) using a Multi-objective Evolutionary Algorithm (MOEA) to optimize both travel time (TSP) and profit (KNP) with advanced crossover, mutation, and selection operators
Add a description, image, and links to the npproblem topic page so that developers can more easily learn about it.
To associate your repository with the npproblem topic, visit your repo's landing page and select "manage topics."