[IROS 2024] iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
-
Updated
Oct 10, 2024 - Python
[IROS 2024] iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
RL-based for mTSP
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
Optimization algorithms, including Simulated Annealing (SA) and Biased Random-Key Genetic Algorithm (BRKGA) for the multiple Traveling Salesman Problem (mTSP).
Add a description, image, and links to the multiple-traveling-salesman-problem topic page so that developers can more easily learn about it.
To associate your repository with the multiple-traveling-salesman-problem topic, visit your repo's landing page and select "manage topics."