[System Design] Ride-Hailing Dispatch Algorithm: How Uber DISCO & Grab DispatchGym Match Drivers
![[System Design] Ride-Hailing Dispatch Algorithm: How Uber DISCO & Grab DispatchGym Match Drivers](/img-proxy?url=https%3A%2F%2Fmedia2.dev.to%2Fdynamic%2Fimage%2Fwidth%3D1200%2Cheight%3D627%2Cfit%3Dcover%2Cgravity%3Dauto%2Cformat%3Dauto%2Fhttps%253A%252F%252Fdev-to-uploads.s3.amazonaws.com%252Fuploads%252Farticles%252Fjq2knhbkqoozr9es4432.png&w=1024)
The article explains how ride‑hailing platforms match riders to drivers, showing that a simple greedy nearest‑driver approach leads to suboptimal system‑wide ETA. It describes the use of bipartite graph matching and the Hungarian algorithm applied to batches of requests to achieve global optimization. The piece also outlines Uber’s DISCO architecture and similar mechanisms used by Grab and other services.
- ▪A greedy closest‑driver strategy can double the total ETA compared to a globally optimal assignment.
- ▪Lyft formalizes dispatch as a minimum‑weight bipartite matching problem solved by the Hungarian algorithm with O(n³) complexity.
- ▪Platforms collect ride requests in a 2‑5 second batching window, build a cost matrix, and run the Hungarian algorithm to dispatch assignments simultaneously.
- ▪Uber’s DISCO engine implements this batched matching approach to pair millions of riders with drivers each day.
DEV.to (Top) files mainly under programming. We currently carry 4,924 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | DEV.to (Top) |
| Canonical URL | https://dev.to/vesviet/system-design-ride-hailing-dispatch-algorithm-how-uber-disco-grab-dispatchgym-match-drivers-pp4 |
| Publication time | Mon, 15 Jun 2026 00:01:48 +0000 |
| Retrieval time | 2026-06-15T00:37:34.617Z |
| Last seen | 2026-06-15T00:37:34.617Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | QzX9CcYYdQWm |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
try { if(localStorage) { let currentUser = localStorage.getItem('current_user'); if (currentUser) { currentUser = JSON.parse(currentUser); if (currentUser.id === 1552279) { document.getElementById('article-show-container').classList.add('current-user-is-article-author'); } } } } catch (e) { console.error(e); } Tuấn Anh Posted on Jun 15 • Originally published at tanhdev.com [System Design] Ride-Hailing Dispatch Algorithm: How Uber DISCO & Grab DispatchGym Match Drivers #systemdesign #architecture #algorithms #go Ride-Hailing Architecture at Scale (3 Part Series) 1 [System Design] GPS Location Ingestion at Scale: gRPC Streaming, MQTT & Kalman Filter in Ride-Hailing 2 [System Design] H3 Geospatial Indexing: How Uber Finds Nearby Drivers with Hexagonal Spatial Index 3 [System Design]…
Excerpt limited to ~120 words for fair-use compliance. The full article is at DEV.to (Top).
Discussion
0 commentsMore from DEV.to (Top)
