Solving a Capacitated Vehicle Routing Problem with time windows constraints (CVRPTW) with Mixed Integer Linear Programming (MILP) in python-gurobi API.

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)

Multiple Traveling Salesman Problem. Computer Engineering and Industrial Engineering multidisciplinary project.

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.

🧳 A mTSP heuristic algorithm

This is the code of course project in Advanced Artificial Intelligence.This project uses NSGA-II to solve the problem of Multiple Traveling Salesmen Problem.

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.

Calculator for carpool pickups.

Optimization algorithms, including Simulated Annealing (SA) and Biased Random-Key Genetic Algorithm (BRKGA) for the multiple Traveling Salesman Problem (mTSP).