Muhammad Zubair and Syed Khaliq Shah of Southeast University in Nanjing tackled what they call the integrated rebalancing and faulty bike recycling problem. Instead of sending trucks out on separate missions—one to redistribute bikes, another to collect broken ones—their framework folds both tasks into a single vehicle routing model. Each service truck carries a partitioned cargo hold: a main compartment for rebalancing bikes and a dedicated section for faulty ones. This partitioned capacity design means a vehicle can deliver bikes to deficit stations, collect surplus bikes from oversupplied ones, and scoop up damaged bicycles along the way, all in one tour.

The mathematics behind the model is demanding. The researchers formulated it as a variant of the pickup and delivery problem, with an objective function that balances three competing costs: user dissatisfaction when riders cannot find a bike, operational expenses including travel and loading time, and the handling cost of faulty bicycles. Loading or unloading an operational bike takes about one minute, while a damaged bike requires roughly two minutes of handling time—values drawn from real observations of Nanjing operators. Vehicles must complete their tours within a six-hour shift, and travel times are adjusted by traffic congestion factors derived from Baidu Maps data, ranging from free-flow conditions to heavy congestion.

Exact optimization tools like IBM’s CPLEX solver can crack such models, but only at small scale. The team first validated their formulation on 38 real stations near Southeast University, solving it to near-perfect optimality with percentage gaps as low as 0.02 percent. In 35 of the 38 stations, rebalanced inventory aligned almost exactly with forecast demand, and all faulty bikes were successfully routed back to the depot for repair or recycling. But real-world networks dwarf this testbed: Shanghai operators manage more than 50,000 dockless bikes, and New York’s CitiBike runs over 1,000 stations. Exact mixed-integer programming becomes computationally intractable beyond roughly 50 stations, which is where the researchers’ metaheuristic enters.

Their solution combines a genetic algorithm with adaptive large neighborhood search, wrapped in a cluster-first, route-second decomposition. The genetic algorithm evolves populations of candidate routes using tournament selection, order crossover, and mutation operators, while preserving the best solutions through elitism. The ALNS component then intensifies the search by destroying parts of a solution—removing stations at random, targeting the worst-performing segments, or dismantling entire clusters—and repairing them with greedy, regret, or cheapest insertion strategies. An adaptive weighting mechanism learns which destroy-and-repair combinations perform best, and a simulated annealing acceptance criterion decides whether to embrace worse solutions temporarily to escape local optima.

The clustering stage is where the approach departs most sharply from prior work. Rather than dividing a city into fixed geographic zones, the dynamic clustering procedure jointly optimizes the number of clusters, their centroids, and station assignments based on expected inter-cluster traversal costs. This captures a fundamental trade-off: more clusters shrink the distance vehicles travel within each zone but inflate the cost of moving between zones. In experiments on a 200-station instance, increasing clusters from 3 to 20 cut intra-cluster travel by 65 percent while inflating inter-cluster travel by more than 700 percent. The sweet spot landed at 11 clusters, where total routing distance fell to 362 kilometers—a 26.1 percent improvement over three clusters and a 21.8 percent improvement over twenty.

The performance numbers are striking. On 200-station synthetic instances, the hybrid algorithm produced solutions within 3.2 percent of best-known values in about 15 minutes, a fourfold scale improvement over the most comparable integrated studies, which stall at 50 to 100 stations. Against 50-station benchmarks, the method matched exact solvers with gaps below 0.5 percent while running 3.75 times faster. Dynamic clustering itself shaved 6.5 percent off routing distance compared with static, geography-only approaches. Meanwhile, folding faulty bike collection into rebalancing routes added just 8 to 12 percent computational overhead—yet eliminated the separate collection trips entirely, cutting total vehicle distance by 15 to 25 percent compared with running the two operations sequentially.

The practical implications are substantial. For a 200-station city, the researchers estimate daily savings of 50 to 75 kilometers of vehicle travel, translating to roughly 10 to 15 liters of fuel, two to three hours of driver time, and annual cost reductions of 15,000 to 25,000 US dollars per vehicle. The recycling loop itself follows a four-stage pipeline: IoT sensors and GPS monitoring flag faulty bikes based on battery status, signal strength, failed QR scans, and idle periods exceeding seven days; trucks with partitioned holds collect them during routine rebalancing; capacity constraints keep the two cargo types physically separated throughout the route; and the depot sorts arrivals into immediate repair, scheduled maintenance, or parts recovery.

Empirical research from major Chinese cities underscores why this integration matters. Faulty bike rates can exceed 2 percent during peak usage, and delayed collection measurably damages user satisfaction and safety. Earlier integrated models relied on exact optimization that buckled beyond 50 stations, and most treated vehicle capacity as a single undifferentiated constraint, implicitly assuming sequential loading and unloading. The new framework’s partitioned capacity model and jointly optimized clustering address both shortcomings, and the authors argue the approach could extend beyond bike sharing to fleet management, ride-sharing, and last-mile delivery, where decomposition is often treated as a necessary evil rather than an optimization opportunity.

Limitations remain. The model assumes deterministic demand within a single operational period and a homogeneous fleet, simplifications that real cities may strain against. The researchers point to several frontiers: incorporating stochastic demand through robust optimization, extending to multi-depot networks, adapting the algorithm for real-time rebalancing as conditions change mid-shift, integrating dynamic pricing to encourage users to self-balance the system, and pairing the optimizer with machine learning demand forecasts. For now, the study offers something operators have lacked: a computationally feasible way to keep dockless fleets balanced, functional, and profitable at the scale modern cities actually demand.

Subject of Research: Integrated rebalancing and faulty bike recycling optimization in dockless bike-sharing systems using a hybrid metaheuristic with dynamic clustering

Article Title: Integrated rebalancing and faulty bike recycling in dockless bike-sharing systems: a hybrid metaheuristic approach with dynamic clustering

Article References: Zubair, M., & Shah, S. K. (2026). Integrated rebalancing and faulty bike recycling in dockless bike-sharing systems: a hybrid metaheuristic approach with dynamic clustering. Frontiers in Future Transportation, 7, Article 1919819. https://doi.org/10.3389/ffutr.2026.1919819

Image Credits: AI Generated

DOI: 10.3389/ffutr.2026.1919819

Keywords: bike-sharing, dockless bikes, vehicle routing, metaheuristics, genetic algorithm, adaptive large neighborhood search, dynamic clustering, faulty bike recycling, urban mobility, optimization, Nanjing, transportation systems

The research, led by M Sana Ullah Khan and Fumiko Ito of Tokyo Metropolitan University, tackles a persistent blind spot in how scientists and operators understand bike-share networks. Most previous studies have relied on trip counts and origin-destination flows to describe demand, which are useful for measuring overall ridership but say little about the short-term operational stress that individual stations experience. What matters for service reliability, the authors argue, is whether bicycles are accumulating or depleting at a station over short intervals, creating empty docks or full docks that force users to search elsewhere.

To capture this, the team used a metric called net bike change: simply, the difference in available bicycles at a station between two consecutive fifteen-minute snapshots. A positive value means more bikes were returned than taken, marking the station as a net destination; a negative value means departures dominated, marking it a net origin. The researchers selected the fifteen-minute resolution after pilot testing showed that finer intervals were dominated by noise from single-bike movements while thirty-minute intervals smoothed away the crucial timing of morning and evening transitions. Crucially, the measure comes from publicly available station-availability feeds, requiring no proprietary trip records, making the approach cheap, reproducible, and transferable to cities where origin-destination data simply do not exist.

The dataset covered 3,207 stations from Tokyo’s two dominant dock-based systems, Hello Cycling and Docomo Bike Share, observed across three seasonal windows: October 2023, January 2024, and May 2024. Each window spanned seven consecutive days from 07:00 to 23:00 at fifteen-minute intervals, and only stations present in all three seasons were retained to ensure comparability. From these records the researchers built temporal imbalance profiles for every station, separate profiles for weekdays and weekends, each containing sixty-four values representing the day between 07:15 and 23:00.

Because such profiles are high-dimensional and highly correlated, the team first applied Principal Component Analysis to compress each station’s behaviour into a small set of interpretable temporal contrasts. A scree plot pointed to four principal components, which together explained about nineteen percent of total variance, a modest share that reflects the noise inherent in station-level dynamics but sufficient to preserve the dominant morning-versus-late-day and weekday-weekend patterns. Hierarchical clustering using Ward’s method, which merges stations while minimising within-group variance, then produced a strikingly clean three-cluster solution, validated by a silhouette score of 0.767 and confirmed as robust across alternative specifications.

The three clusters turned out to have vivid and intuitive meanings. The first group, commuter-destination stations, shows a sharp weekday morning inflow between roughly 07:15 and 09:00 as bikes flood into commercial and employment areas, followed by a pronounced evening outflow around 19:00 as workers ride away. The second group, commuter-origin stations, displays the mirror image: strong morning outflow from residential and mixed inner-city neighbourhoods, then steady evening inflow as bikes return home. The third group comprises balanced or low-signature stations with nearly flat profiles around zero across both weekdays and weekends, indicating either evenly matched arrivals and departures or generally low activity.

Perhaps the most consequential finding is how stable these roles proved across seasons. Tracking cluster membership for each individual station across autumn, winter, and spring, the researchers found that 86.4 percent of stations stayed in the same role in all three seasons, and pairwise agreement between seasons ranged from 89.3 to 93.1 percent. Persistence was strongest for the balanced role, which retained between 96.8 and 99.2 percent of its stations across any seasonal pair. The commuter roles were somewhat more season-sensitive, with the commuter-destination cluster shrinking from 209 stations in autumn to just 15 in spring as some stations drifted into the balanced category, but the core weekday structure held firm. Weekend profiles, by contrast, were consistently flatter and more dispersed, confirming that discretionary leisure use forms a secondary, less predictable layer atop the rigid weekday skeleton.

The spatial mapping of these roles reveals Tokyo’s urban anatomy with unusual clarity. Commuter-destination stations concentrate in the commercial core and bay-side employment districts served by major rail terminals, with 72.7 percent located in commercial land-use areas and, remarkably, 100 percent lying within 800 metres of a train station, the distance of roughly a ten-minute walk. Commuter-origin stations cluster in inner-city sub-centres and mixed-use zones, showing the most heterogeneous land-use profile with the highest industrial share. Balanced stations spread across residential outer wards and the western Tama municipalities, where rail stations are more widely spaced. Statistical tests confirmed that cluster membership was significantly associated with land-use type and train-station proximity, but not with bus-stop proximity, suggesting that rail accessibility, not bus coverage, is what structurally shapes the bike-share network.

The practical implications are direct. Rebalancing operations, the costly business of trucking bicycles from full stations to empty ones, can be organised according to station role and time of day rather than applied uniformly. Stations with morning inflow need empty dock capacity cleared in advance of the peak; stations with morning outflow need bikes pre-positioned before commuters arrive. Balanced stations may require far less frequent intervention, freeing resources for the hotspots where recurrent directional pressure is strongest. More broadly, because the method depends only on publicly available availability data, operators in cities worldwide could replicate the classification without access to proprietary trip logs, giving transit planners a role-based tool for integrating shared bicycles into last-mile networks.

The study also extends previous station-typology research by demonstrating, in a dense rail-oriented metropolis, that the functional meaning of station groups persists across multiple seasons rather than being re-formed each time. The authors caution that net bike change is an indirect proxy for demand, partly shaped by operator rebalancing and dock-capacity constraints, and that their analysis rests on seasonal snapshots rather than a full-year panel. Future work, they suggest, should incorporate weather and event effects, cycling infrastructure, capacity-normalised measures, and comparisons with cities of different urban forms. But the central message stands: in Tokyo, the shared bicycle is not an independent mode but a finely tuned appendage of the railway system, and its daily ebb and flow writes the commuting geography of the city in fifteen-minute installments.

Subject of Research: Classification of bicycle sharing station functional roles in Tokyo using temporal imbalance profiles derived from high-frequency station-availability data.

Article Title: Classifying bicycle sharing station roles using temporal imbalance profiles in Tokyo

Article References: Classifying bicycle sharing station roles using temporal imbalance profiles in Tokyo. (n.d.). https://doi.org/10.1007/s44327-026-00353-6

Image Credits: AI Generated

DOI: 10.1007/s44327-026-00353-6

Keywords: bike sharing, Tokyo, temporal imbalance, net bike change, principal component analysis, hierarchical clustering, commuter stations, last-mile connectivity, transit-oriented development, urban mobility, rail integration, rebalancing