Capstone project · about 120 minutes
Delivery Route Optimiser 🚚
Dijkstra across a road network, a travelling-salesman round, and van loads that respect capacity. Then measure what the optimisation actually saved.
Two famous algorithms doing an honest day of work. Dijkstra finds the cheapest path between towns; then you plan the order of the drops, compare a fast greedy route against the true optimum, and split the parcels across vans that can only carry so much. The number that matters at the end is the saving, because that…
This is a Pro project. Six portfolio projects are free, so you can see how they work before deciding.