Maritime Routing Engine

Dijkstra/A*-based routing engine for global maritime networks, ~95% accuracy against real shipping routes.

Tech Stack

What Was Built

• Engineered a maritime routing engine using Dijkstra and A* algorithms over a global maritime network graph to compute optimal sea routes between any two ports worldwide.
• Architected the spatial database layer using PostGIS and H3 hexagonal indexing to store, cluster, and query global maritime networks and sea nodes efficiently.
• Optimized pathfinding performance by leveraging H3 hierarchical indexing for spatial clustering and A* heuristic pruning, achieving ~30% reduction in path computation time compared to brute-force Dijkstra.
• Migrated the routing service from a Python prototype to a production-grade Node.js implementation for consistency with the rest of the backend stack.