Microtransit Dispatch 2D — Cheapest-Insertion Routing

This 2D top-down companion keeps the exact dispatch model of the 3D version: rider requests (pickup and dropoff) arrive on a city grid and a dispatcher must instantly decide which shuttle should serve each one using the cheapest-insertion heuristic for the dynamic dial-a-ride problem — inserting each pickup and dropoff wherever it adds the least extra driving distance to a vehicle's current route, subject to seat capacity. Unlike the 3D version, here you can click directly on the map to drop your own pickup point and then a dropoff point, watching in real time which van and which slot in its route the greedy heuristic chooses. Live readouts track trips served, average rider wait time, the average detour ratio riders experience from being pooled, and how fully the fleet is utilized, so you can see the effect of adding vans, changing seat capacity, or driving up demand.