Abstract
This paper investigates an extended bike-sharing rebalancing problem called the bike-sharing rebalancing problem with variable demand (BRPVD), which considers the influence of the number of bikes distributed by the operator on users’ demand. The solutions to the BRPVD aim at maximizing the profit of bike-sharing operators by making routing plans of transport vehicles and determining the target number of bikes at each station after redistribution operation. The problem is modeled as a mixed-integer non-linear programming model and is linearized into a mixed-inter linear programming model. The model is tested in cases adopting real Beijing Mobike data, revealing that the rebalancing behavior significantly impacts users’ demand, hence guiding the operator.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
