Will Add an outline of the repo & some outputs
Description: Finding the shortest possible route that visits a set of cities and returns to the origin city.
Solution Algorithms:
Exact Algorithms: Dynamic Programming, Branch and Bound, Linear Programming.
Heuristic Algorithms: Nearest Neighbor Heuristic [O(
A shortest route from Miami to other 9n cities in Florida is shown Fig1 (the Python implementation using Christofides Approximation algorithm from NetWorkX can be found here
Fig1: An optimized TSP route
Description: Optimizing the final leg of the delivery process to ensure timely delivery to customers.
Solution Algorithms: Exact Algorithms: Mixed-Integer Programming (MIP). Heuristic Algorithms: Clarke-Wright Savings Algorithm, Local Search. Metaheuristic Algorithms: Genetic Algorithms, Simulated Annealing, Ant Colony Optimization. ++
Description: Optimizing the assignment of loads to vehicles and scheduling deliveries.
Solution Algorithms: Exact Algorithms: Integer Programming. Heuristic Algorithms: Greedy Algorithms, Local Search. Metaheuristic Algorithms: Genetic Algorithms, Simulated Annealing.