EXPERIMENT 002 / ROUTING SYSTEMS

See the decision.
Follow the route.

PARCEL groups pickup points, ranks difficult groups first, and builds feasible bus routes. Each step below comes from the migrated algorithm’s event stream.

Read the original article ↗
Route model / Every bus leaves the movable school, visits its assigned pickups, and returns to school. Colored lines and route times use the public OSRM driving service.
CONTROL DESK / RABAT

Set the conditions.

Explore pickups across Rabat, generate a seeded case, or click the map to place students.

SCENARIO
OBJECTIVE MODE
MAP CLICK
24 pickups across Rabat · 6 available buses · 8 seats per busOSRM requests this run: 0
Click map to add a pickup ↗
School / depot Pickup Cluster Unserviceable zone School round trip Current attempt
ALGORITHM TAPE / DETERMINISTIC REPLAY

How the plan formed.

Step through the decisions emitted by PARCEL. Playback speed changes only the presentation, never the result.

01 — Awaiting a route plan.

The timeline will expose clustering, seeding, candidate checks, bundle construction, rescue attempts and refinement.