共享单车
整数规划
计算机科学
线性规划
加速度
方案(数学)
工作(物理)
持续时间(音乐)
运输工程
运筹学
自治
实时计算
工程类
数学
算法
经典力学
机械工程
物理
文学类
数学分析
艺术
法学
政治学
作者
R. Miguel Chastre,António R. Andrade
标识
DOI:10.1016/j.cstp.2023.101071
摘要
This work presents a mathematical programming formulation for the static Bike Rebalancing Problem to meet the practical constraints faced by the operators of Bike Sharing Systems. Adaptating a Mixed Integer Linear Programming formulation, it now includes different types of vehicles and bicycles, the autonomy of each vehicle, the duration of its route and the stations that require inspection actions. An intermediate station is introduced to temporarily store bicycles, relaxing the restrictions imposed by the vehicles’ capacity. After incorporating different acceleration procedures, a Branch-and-Cut scheme is run for 30 minutes to find optimized routes for the reposition vehicle on five real instances of the Lisbon Bike Sharing System. The computed routes resulted in a 30% to 75% decrease in total length, when compared to the real routes. This decrease is mainly attributed to the integration of all the mentioned factors in one global model, encouraging its future implementation.
科研通智能强力驱动
Strongly Powered by AbleSci AI