Robust Multi-Objective Optimization for Bicycle Rebalancing in Shared Mobility Systems

• URL: http://arxiv.org/abs/2604.08296v1
• Date: Thu, 09 Apr 2026 14:30:59 GMT
• Title: Robust Multi-Objective Optimization for Bicycle Rebalancing in Shared Mobility Systems
• Abstract summary: Dock-based bike-sharing systems exhibit spatial imbalances between bicycle supply and user demand.<n>This work studies static overnight rebalancing under demand uncertainty modeled as a tri-objective optimization problem.
• Score: 0.09332987715848712
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Dock-based bike-sharing systems exhibit spatial imbalances between bicycle supply and user demand, often addressed through overnight truck-based rebalancing. This work studies static overnight rebalancing under demand uncertainty modeled as a tri-objective optimization problem. The objectives minimize total travel distance, expected unmet demand, and a robustness-oriented unmet demand measure over high-demand scenarios. Route plans are evaluated via a recourse simulation that enforces truck loads and station capacity constraints across multiple demand realizations. The robustness objective supports selecting plans that reduce peak-demand service degradation. Trade-off solutions are approximated with Non-dominated Sorting Genetic Algorithm II using a permutation--partition encoding and domain-specific relocation operators, including a biased best-improvement move for station relocation. Experiments on the real Barcelona Bicing system with 460 stations show well-distributed Pareto sets and substantial contributions to the reference non-dominated set. Greedy constructive baselines mainly yield extreme solutions and are often dominated.

Related papers

• A Neural Network Based Teleoperation for Remote Controlled Vehicles [98.38733381483934]
  Direct teleoperation of vehicles faces critical technical bottlenecks.<n> communication latency and the operator's inability to physically perceive unmodeled environmental disturbances.<n>We propose a tailored unilateral teleoperation framework.
  arXiv  Detail & Related papers  (2026-08-11T01:51:08Z)
• Optimal Reward Shaping: Autonomous Car Parking Case Study [1.1458853556386799]
  We present a parameterized reward shaping framework featuring alignment feedback, drive-direction switch regularization, and an aligned episode termination mechanism evaluated on an autonomous parallel parking task.<n>By employing surrogate-based Bayesian optimization, our co-optimized Deep Q-Network (DQN) agent resolves characteristic control failure modes, significantly outperforming uncalibrated baselines across both success rate and trajectory smoothness.
  arXiv  Detail & Related papers  (2026-07-26T11:49:23Z)
• Selective Ensemble Based on Preference-Directed Multi-Objective Bandits [90.75513823660775]
  We formalize a sequential decision problem under partially specified linear preferences.<n>We then propose a preference-directed upper confidence bound (PrefUCB) algorithm.<n> Experiments on large pre-trained model selective ensemble tasks and online asset allocation under institutional mandates validate our method.
  arXiv  Detail & Related papers  (2026-06-20T07:52:46Z)
• D$^3$-Subsidy: Online and Sequential Driver Subsidy Decision-Making for Large-Scale Ride-Hailing Market [13.613354145103656]
  We introduce D$3$-Subsidy (Dynamic Driver-side Diffusion-based Subsidy), a hierarchical diffusion-based framework for deployable city-wide subsidy control.<n>We show that D$3$-Subsidy improves textttRides and textttGMV while enhancing cap compliance, and a real-world A/B test confirms significant uplift.
  arXiv  Detail & Related papers  (2026-05-19T15:55:55Z)
• HAD: Combining Hierarchical Diffusion with Metric-Decoupled RL for End-to-End Driving [51.268878540511054]
  We propose HAD, an end-to-end planning framework with a Hierarchical Diffusion Policy.<n>We show that HAD achieves new state-of-the-art performance on both NAVSIM and HUGSIM.
  arXiv  Detail & Related papers  (2026-04-04T04:12:47Z)
• A Replicate-and-Quantize Strategy for Plug-and-Play Load Balancing of Sparse Mixture-of-Experts LLMs [64.8510381475827]
  Sparse Mixture-of-Experts (SMoE) architectures are increasingly used to scale large language models efficiently.<n>SMoE models often suffer from severe load imbalance across experts, where a small subset of experts receives most tokens while others are underutilized.<n>We present a systematic analysis of expert routing during inference and identify three findings: (i) load imbalance persists and worsens with larger batch sizes, (ii) selection frequency does not reliably reflect expert importance, and (iii) overall expert workload and importance can be estimated using a small calibration set.
  arXiv  Detail & Related papers  (2026-02-23T15:11:16Z)
• Quantum and classical algorithms for daily railway rolling stock circulation plans [0.0]
  We study daily rolling stock circulation planning for electric multiple units (EMUs) on a regional passenger network.<n>Motivated by the operational needs of the regional operator Silesian Railways in Poland, we formulate an acyclic mixed-integer linear program on a one-day horizon.<n>We show that the ILP approach can obtain high-quality daily circulation plans within at most about 40 minutes.
  arXiv  Detail & Related papers  (2025-12-22T12:36:20Z)
• QoS-Aware Hierarchical Reinforcement Learning for Joint Link Selection and Trajectory Optimization in SAGIN-Supported UAV Mobility Management [52.15690855486153]
  A space-air-ground integrated network (SAGIN) has emerged as an essential architecture for enabling ubiquitous UAV connectivity.<n>This paper formulates UAV mobility management in SAGIN as a constrained multiobjective joint optimization problem.
  arXiv  Detail & Related papers  (2025-12-17T06:22:46Z)
• Single Agent Robust Deep Reinforcement Learning for Bus Fleet Control [9.910562011343009]
  Bus bunching is a challenge for urban transit due to traffic and passenger demand.<n>We propose a novel single-agent reinforcement learning framework for bus holding control.<n>We show that our modified soft actor-critic achieves more stable and superior performance than benchmarks.
  arXiv  Detail & Related papers  (2025-08-28T13:47:40Z)
• Scalable Ride-Sourcing Vehicle Rebalancing with Service Accessibility Guarantee: A Constrained Mean-Field Reinforcement Learning Approach [42.070187224580344]
  We introduce continuous-state mean-field control (MFC) and mean-field reinforcement learning (MFRL) models that employ continuous vehicle repositioning actions.<n>MFC and MFRL offer scalable solutions by modeling each vehicle's behavior through interaction with the vehicle distribution, rather than with individual vehicles.<n>Our approach scales to tens of thousands of vehicles, with training times comparable to the decision time of a single linear programming rebalancing.
  arXiv  Detail & Related papers  (2025-03-31T15:00:11Z)
• Exploring the Boundary of Diffusion-based Methods for Solving Constrained Optimization [46.75288477458697]
  We propose a novel diffusion-based framework for Continuous Constrained Optimization problems called DiOpt.<n>DiOpt operates in two distinct phases: an initial warm-start phase, implemented via supervised learning, followed by a bootstrapping phase.<n>It is designed to iteratively refine solutions, thereby improving the objective function while rigorously satisfying problem constraints.
  arXiv  Detail & Related papers  (2025-02-14T17:43:08Z)
• A Reinforcement Learning Approach for Dynamic Rebalancing in Bike-Sharing System [11.237099288412558]
  Bike-Sharing Systems provide eco-friendly urban mobility, contributing to the alleviation of traffic congestion and healthier lifestyles. Devising effective rebalancing strategies using vehicles to redistribute bikes among stations is therefore of uttermost importance for operators. This paper introduces atemporal reinforcement learning algorithm for the dynamic rebalancing problem with multiple vehicles.
  arXiv  Detail & Related papers  (2024-02-05T23:46:42Z)
• Modeling routing problems in QUBO with application to ride-hailing [0.0]
  We focus on one such routing problem, the Ride Pooling Problem (RPP), where multiple customers can request on-demand pickups and drop-offs from shared vehicles within a fleet. The task is to optimally pool customer requests using the limited set of vehicles, akin to a small-scale flexible bus route.
  arXiv  Detail & Related papers  (2022-12-09T14:55:34Z)
• Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems using Multi-objective Reinforcement Learning [79.61517670541863]
  How to use AI to provide efficient bicycle dispatching solutions based on dynamic bicycle rental demand is an essential issue for dockless PBS (DL-PBS) We propose a dynamic bicycle dispatching algorithm based on multi-objective reinforcement learning (MORL-BD) to provide the optimal bicycle dispatching solution for DL-PBS.
  arXiv  Detail & Related papers  (2021-01-19T03:09:51Z)
• Distributed Multi-agent Meta Learning for Trajectory Design in Wireless Drone Networks [151.27147513363502]
  This paper studies the problem of the trajectory design for a group of energyconstrained drones operating in dynamic wireless network environments. A value based reinforcement learning (VDRL) solution and a metatraining mechanism is proposed.
  arXiv  Detail & Related papers  (2020-12-06T01:30:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.