There are 1 repository under shortest-path-routing-algorithm topic.
A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem
Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
The Vehicle Monitoring And Routing System (VMARS) makes use of GPS to provide the exact location of the vehicle. It allows a parent to monitor the vehicle in real-time using a GPS-based device possessed by its driver. It is also capable of finding the shortest route to reach the destination passing through all the checkpoints which uses our proposed algorithm to find the same. This system also possesses the facility of speed monitoring and giving sound alerts to the driver if he over speeds his vehicle. Also, the system gives accident alerts to the vehicle admin via SMS.
Given a fleet of drones, a list of customer orders, and availability of the individual products in warehouses, schedule the drone operations so that the orders are completed as soon as possible.
Cobweb is a multi-modal journey planner offering a server based REST API and a light frontend.
An interactive HTML5 canvas graph that shows the shortest path between any two nodes.
Dijkstra's Algorithm
Project Home Delivery Management System implements Travelling Sales Man problem with many extended features such as calculate estimated distance, time, cost, shortest delivery route and send it to the Delivery boy present in Queue
path finding
A full-stack web application for navigation of the University of Washington Campus that enables shortest-route calculation between buildings and other locations. Builds off the existing, limited University of Washington Campus Map web application in a highly scalable and campus-oriented way.
PathWeaver is an API for creating path-networks like road- or traffic-networks. It offers method like computing shortest paths.
Implementation of Dijkstra Graph Algorithm in Python
Round table arrangemnet solution using greedy, Astar and UCS algorithms on graph data structure.
A cab company software used to track and monitor cab bookings developed using C++, C graphics, graph data structure and Dijkstra's algorithm.
A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute.
Реализация алгоритма Дейкстры для поиска кратчайшего пути между двумя вершинами и оптимального маршрута на 3D поверхности с использованием очереди с приоритетом (PriorityQueue).
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.
USC-Foundations of Artificial Intelligence Codes
Rubbish pick up process optimization with shortest route algorithm, Google Maps API and Gmaps.js. Try it at https://rodrigoagm.github.io/Shortest-route-algorithm-project/Project/index.html
PDSA Assignment
Dissertation project on analysis of Particle Swarm Optimization Algorithm
It is based on the A* algorithm. The user enters his current location and the destination and the program will print the shortest path. The program has an unordered map data structure which contains nodes. The place name, longitude and latitude present in the program are of Karachi, Pakistan.
Newcastle University Group Project - Routes
This project offers a JavaScript implementation of Dijkstra's algorithm with a user-friendly PriorityQueue class, ideal for finding the shortest paths in complex graphs as in routing or network optimization.
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
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.
Uploaded my latest college project
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.
Bu proje merkezi Kocaeli’de kurulan yeni bir kargo firmasının siparişlerini en kısa yoldan yerlerine ulaştırmayı amaçlar.
Implementation of Dijkstra's algorithm to build routing tables for nodes in a network.
🚗 Approach and visualization of the Multi-Depot Vehicle Routing Problem