论文标题
单站自行车重新定位问题
The one-station bike repositioning problem
论文作者
论文摘要
在自行车共享系统中，对用户的服务质量很大程度上取决于为重新定位自行车的策略。自行车重新定位问题通常非常复杂，因为它涉及不同的相互关联的决策：重新定位车辆的路由，安排访问车站的时间安排，每个车站加载或卸载的自行车数量以及访问车站的每个车辆。在本文中，我们研究了在有限时间范围内给定时间访问同一站的最佳加载/卸载车辆的问题。目的是最大程度地减少车站中自行车和自由摊位的总损失。我们将问题建模为混合整数线性编程问题，并提出一种最佳算法，该算法在时间范围内以线性时间运行。
In bike sharing systems the quality of the service to the users strongly depends on the strategy adopted to reposition the bikes. The bike repositioning problem is in general very complex as it involves different interrelated decisions: the routing of the repositioning vehicles, the scheduling of their visits to the stations, the number of bikes to load or unload for each station and for each vehicle that visits the station. In this paper we study the problem of optimally loading/unloading vehicles that visit the same station at given time instants of a finite time horizon. The goal is to minimize the total lost demand of bikes and free stands in the station. We model the problem as a mixed integer linear programming problem and present an optimal algorithm that runs in linear time in the size of the time horizon.
