Contains python code of an NSGA-II based solver with multiple genetic operator choices for the multiple travelling salesman problem with two objectives. Also contains sample instances from TSPLIB. (Deliverable for the ECE 750 AL: Bio & Comp Fall 2021 individual project @ UWaterloo)
[IROS 2024] iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
This repository contains a Python notebook implementing a class for solving multiple Traveling Salesman Problems (TSP) using Pyomo and the CPLEX solver. The class includes a solution for the simple TSP scenario when there is only one driver.
Multiple Traveling Salesman Problem. Computer Engineering and Industrial Engineering multidisciplinary project.
This project is a comparative study of various metaheuristics applied to the Multiple Traveling Salesman Problem (mTSP). The mTSP is a generalization of the well-known Traveling Salesman Problem (TSP), where multiple salesmen must visit a set of cities, minimizing the total distance traveled by all salesmen.
ACO for multi agent task allocation as mTSP
🧳 A mTSP heuristic algorithm
Optimization algorithms, including Simulated Annealing (SA) and Biased Random-Key Genetic Algorithm (BRKGA) for the multiple Traveling Salesman Problem (mTSP).
A regularly updated FM95/FM2K netplay client written in Visual C++. Made for Windows XP+.
2025/ A mathematical modeling project that optimizes first-responder building sweep routes using m-TSP, AHP room prioritization, ODE smoke modeling, and victim-assistance timing for emergency evacuation scenarios.
Add a description, image, and links to the mtsp topic page so that developers can more easily learn about it.
To associate your repository with the mtsp topic, visit your repo's landing page and select "manage topics."