Papers › Hyper-pool: pooling private trips into high-occupancy transit-like attractive shared rides
Hyper-pool: pooling private trips into high-occupancy transit-like attractive shared rides
Rafal Kucharski, Oded Cats
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We propose Hyper-pool, an analytical, offline, utility-driven ride-pooling algorithm to aggregate individual trip requests into attractive shared rides of high-occupancy. We depart from our ride-pooling ExMAS algorithm where single rides are pooled into attractive door-to-door rides and propose two novel demand-side algorithms for further aggregating individual demand towards more compact pooling. First, we generate stop-to-stop rides, with a single pick up and drop off points optimal for all the travellers. Second, we bundle such rides again, resulting with hyper-pooled rides compact enough to resemble public transport operations. We propose a bottom-up framework where the pooling degree of identified rides is gradually increased, thereby ensuring attractiveness at subsequent aggregation levels. Our Hyper-pool method outputs the set of attractive pooled rides per service variant for a given travel demand. The algorithms are publicly available and reproducible. It is applicable for real-size demand datasets and opens new opportunities for exploiting the limits of ride-pooling potential. In our Amsterdam case-study we managed to pool over 220 travellers into 40 hyper-pooled rides of average occupancy 5.8 pax/veh.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections