Designing Dynamic Pricing for Bike-sharing Systems via Differentiable Agent-based Simulation

• URL: http://arxiv.org/abs/2507.23344v1
• Date: Thu, 31 Jul 2025 08:43:54 GMT
• Title: Designing Dynamic Pricing for Bike-sharing Systems via Differentiable Agent-based Simulation
• Authors: Tatsuya Mitomi, Fumiyasu Makinoshima, Fumiya Makihara, Eigo Segawa,
• Abstract summary: Bike-sharing systems are emerging in various cities as a new ecofriendly transportation system.<n>In these systems, varying user demands lead to imbalanced inventory at bicycle stations, resulting in additional relocation costs.<n>We develop a differentiable agent-based simulation to rapidly design dynamic pricing for such a system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bike-sharing systems are emerging in various cities as a new ecofriendly transportation system. In these systems, spatiotemporally varying user demands lead to imbalanced inventory at bicycle stations, resulting in additional relocation costs. Therefore, it is essential to manage user demand through optimal dynamic pricing for the system. However, optimal pricing design for such a system is challenging because the system involves users with diverse backgrounds and their probabilistic choices. To address this problem, we develop a differentiable agent-based simulation to rapidly design dynamic pricing in bike-sharing systems, achieving balanced bicycle inventory despite spatiotemporally heterogeneous trips and probabilistic user decisions. We first validate our approach against conventional methods through numerical experiments involving 25 bicycle stations and five time slots, yielding 100 parameters. Compared to the conventional methods, our approach obtains a more accurate solution with a 73% to 78% reduction in loss while achieving more than a 100-fold increase in convergence speed. We further validate our approach on a large-scale urban bike-sharing system scenario involving 289 bicycle stations, resulting in a total of 1156 parameters. Through simulations using the obtained pricing policies, we confirm that these policies can naturally induce balanced inventory without any manual relocation. Additionally, we find that the cost of discounts to induce the balanced inventory can be minimized by setting appropriate initial conditions.

Related papers

• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Smart Recommendations for Renting Bikes in Bike Sharing Systems [1.5115914900997285]
  Vehicle-sharing systems have become increasingly popular in big cities in recent years. One of their advantages is their availability, e.g., the possibility of taking (or leaving) a vehicle almost anywhere in a city. Agglutination problems -- where, due to usage patterns, available vehicles are concentrated in certain areas, whereas no vehicles are available in others -- are quite common in such systems. We present and compare strategies for recommending stations to users who wish to rent or return bikes in station-based bike-sharing systems.
  arXiv  Detail & Related papers  (2024-01-22T19:29:33Z)
• Analytical model for large-scale design of sidewalk delivery robot systems [4.510000677649468]
  We propose a model that captures both the initial cost and the operation cost of the delivery system and evaluates the impact of constraints and operation strategies on the deployment. We then apply the model in neighborhoods in New York City to evaluate deploying the sidewalk delivery robot system in a real-world scenario.
  arXiv  Detail & Related papers  (2023-10-26T15:26:12Z)
• Predicting Citi Bike Demand Evolution Using Dynamic Graphs [81.12174591442479]
  We apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset. In this paper, we attempt to apply a graph neural network model to predict bike demand in the New York City, Citi Bike dataset.
  arXiv  Detail & Related papers  (2022-12-18T21:43:27Z)
• A Data-driven Pricing Scheme for Optimal Routing through Artificial Currencies [1.3419982985275638]
  Mobility systems often suffer from a high price of anarchy due to the uncontrolled behavior of selfish users. This paper presents a data-driven approach to automatically adapt artificial-currency tolls within repetitive-game settings.
  arXiv  Detail & Related papers  (2022-11-27T11:23:29Z)
• A Cluster-Based Trip Prediction Graph Neural Network Model for Bike Sharing Systems [2.1423963702744597]
  Bike Sharing Systems (BSSs) are emerging as an innovative transportation service. Ensuring the proper functioning of a BSS is crucial given that these systems are committed to eradicating many of the current global concerns. Good knowledge of users' transition patterns is a decisive contribution to the quality and operability of the service.
  arXiv  Detail & Related papers  (2022-01-03T15:47:40Z)
• Estimating the Robustness of Public Transport Systems Using Machine Learning [62.997667081978825]
  Planning public transport systems is a highly complex process involving many steps. Integrating robustness from a passenger's point of view makes the task even more challenging. In this paper, we explore a new way of such a scenario-based robustness approximation by using methods from machine learning.
  arXiv  Detail & Related papers  (2021-06-10T05:52:56Z)
• 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)
• Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing System Using Gated Graph Neural Network [79.61517670541863]
  Dockless Public Bicycle-sharing (DL-PBS) network becomes increasingly popular in many countries. redundant and low-utility stations waste public urban space and maintenance costs of DL-PBS vendors. We propose a Bicycle Station Dynamic Planning (BSDP) system to dynamically provide the optimal bicycle station layout for the DL-PBS network.
  arXiv  Detail & Related papers  (2021-01-19T02:51:12Z)
• End-to-end Interpretable Neural Motion Planner [78.69295676456085]
  We propose a neural motion planner (NMP) for learning to drive autonomously in complex urban scenarios. We design a holistic model that takes as input raw LIDAR data and a HD map and produces interpretable intermediate representations. We demonstrate the effectiveness of our approach in real-world driving data captured in several cities in North America.
  arXiv  Detail & Related papers  (2021-01-17T14:16:12Z)
• Simulating and Evaluating Rebalancing Strategies for Dockless Bike-Sharing Systems [0.0]
  Dockless bike sharing systems are revolutionizing the market for the increased flexibility they offer to users. Bike redistribution is a common approach to improve service, and there exists extensive research considering static and dynamic rebalancing strategies for dock-based systems. This paper offers an optimizing Mixed Program framework to model the effects of various bike repositioning strategies for dockless systems.
  arXiv  Detail & Related papers  (2020-04-24T07:13:56Z)

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.