Last-Mile Delivery Route Optimizer

Network

Delivery stops 10

Vehicle Mode

Route Planning

Live Metrics

Total distance

0 km

Total cost

Total time

0 min

Trips needed

How it works

This is a capacitated vehicle routing problem (CVRP): a hub must deliver goods to every store using vehicles of limited capacity, choosing a stop order that minimizes total driven distance.

1. Nearest-neighbor: from the hub, repeatedly
   jump to the closest unvisited stop.
2. 2-opt local search: for every pair of edges
   (i,i+1) and (j,j+1) in the tour, reverse the
   segment between them if that shortens the
   total tour length. Repeat until no swap helps.
3. Capacity split: walk the optimized order and
   start a new trip (hub -> ... -> hub) whenever
   adding the next stop's demand would exceed the
   vehicle's capacity.

Cost model per trip: distance × cost-per-km + a fixed dispatch fee. Time model: distance / vehicle speed, plus a fixed loading time per stop. Switching "Optimized route" off replaces step 1–2 with the stops' raw generation order, so you can see exactly how much distance (and cost) the 2-opt pass removes.

Truck — largest capacity, cheapest per km, slowest.
Van — mid capacity, mid cost, faster than a truck.
Drone — tiny capacity (many short trips), most expensive fixed dispatch fee, but fastest per km.

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.