A Study on the Integration of Demand Forecasting and Optimization Models for Enhancing the Operational Efficiency of Shared Bicycle Systems

The aim of this paper is to develop a framework for optimizing the daily redistribution of shared bicycles by integrating demand forecasting and mathematical optimization techniques. This framework addresses the operational challenges associated with balancing supply-demand dynamics across bicycle stations while minimizing costs. First, several potential demand forecasting models are constructed by combining time-series algorithms, such as Prophet and SARIMAX, in a stacking framework to predict rental and return demands. Second, an optimization model for bicycle redistribution is formulated as a capacitated vehicle routing problem with pickups and deliveries to minimize redistribution costs and improve system efficiency. Third, the significance of the demand forecasting models is evaluated based on their predictive accuracy and operational impact, allowing prioritization of effective forecasting and optimization strategies. Finally, a stepwise decision-making process for daily redistribution is established based on the prioritized results. We illustrate the proposed framework using real-life data of shared bicycle systems in metropolitan areas, showcasing its potential to enhance operational efficiency and decision-making for urban mobility services.

Authors

Publication Details

Journal
Journal of the Korean Society of Supply Chain Management
Published
2024-12-31
DOI
https://doi.org/10.25052/kscm.2024.12.24.3.61
Primary Topic
Urban Transport and Accessibility
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Study on the Integration of Demand Forecasting and Optimization Models for Enhancing the Operational Efficiency of Shared Bicycle Systems

Yanji Li, Sungmook Lim, Luo Yue
Journal of the Korean Society of Supply Chain Management
Urban Transport and Accessibility
article

A Study on the Integration of Demand Forecasting and Optimization Models for Enhancing the Operational Efficiency of Shared Bicycle Systems

Yanji Li, Sungmook Lim, Luo Yue
article en

Abstract

The aim of this paper is to develop a framework for optimizing the daily redistribution of shared bicycles by integrating demand forecasting and mathematical optimization techniques. This framework addresses the operational challenges associated with balancing supply-demand dynamics across bicycle stations while minimizing costs. First, several potential demand forecasting models are constructed by combining time-series algorithms, such as Prophet and SARIMAX, in a stacking framework to predict rental and return demands. Second, an optimization model for bicycle redistribution is formulated as a capacitated vehicle routing problem with pickups and deliveries to minimize redistribution costs and improve system efficiency. Third, the significance of the demand forecasting models is evaluated based on their predictive accuracy and operational impact, allowing prioritization of effective forecasting and optimization strategies. Finally, a stepwise decision-making process for daily redistribution is established based on the prioritized results. We illustrate the proposed framework using real-life data of shared bicycle systems in metropolitan areas, showcasing its potential to enhance operational efficiency and decision-making for urban mobility services.

Journal of the Korean Society of Supply Chain ManagementVol. 24(3)
Openalex Percentile: Top 75%
Urban Transport and Accessibility
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.