A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem

Implementation of Dijkstra Graph Algorithm in Python

This assignment was done as part of the COL334 course requirements. The objective of the assignment is to get familiar with the OpenFlow APIs and implement key networking policies : Hub Controller, Learning Switch, Spanning Tree, Shortest-Path Routing and Congestion-aware Shortest-Path Routing.

A Python project for map visualization and route planning using OSM data with interactive HTML output. Kaggle link: https://www.kaggle.com/code/tuncbileko/osm-shortest-path-reconstruction

In this project, I implemented an Evolutionary Algorithm (EA) to solve the Travelling Salesman Problem (TSP), a classic optimization challenge where the goal is to find the shortest route that visits a set of cities exactly once and returns to the starting point.

Native Python implementation of Dijkstra's algorithm.

Algorithmic project in python aiming to exploit traffic data of the city of Montreal (OSMNX) with the aim of optimizing routing for snow plowers. Implementiaon with different algorithms (Fleury, dfs, bfs) to efficiently cover all roads with all snowplows.