Skip to content

Latest commit

 

History

History
36 lines (24 loc) · 1.82 KB

README.md

File metadata and controls

36 lines (24 loc) · 1.82 KB
Raw

Operations-Research-projects

Will Add an outline of the repo & some outputs

Travelling Salesman Problem

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($n^2$)], Christofides Algorithm. Metaheuristic Algorithms: Genetic Algorithms, Simulated Annealing, Ant Colony Optimization.

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

tsp_route

Fig1: An optimized TSP route

Last-Mile Delivery Optimization

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. ++

Scheduling

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.