Discrete Optimization An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
Discrete Optimization An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
复制标题
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Güneş Erdoğana;Maria Battarrab;Roberto Wolfler Calvoc
中科院分区：
文献类型：
--
作者：
Güneş Erdoğana;Maria Battarrab;Roberto Wolfler Calvoc
自行车共享系统可以显着减少交通，污染和城市中心对停车位的需求。自行车共享系统成功的关键之一是再平衡操作的效率，其中每个站点中的自行车数量必须通过卡车通过拾取和交付操作恢复到其目标值。静态自行车再平衡问题的目的是确定一个最小的成本序列的车站将访问由一个单一的车辆以及自行车的数量收集或交付在每个站。允许多次访问一个站点，以及将站点用作临时存储。本文提出了一个精确的算法的问题和结果的计算测试的基准实例从文献。计算实验表明，最多60个站点的实例可以在2小时的计算时间内解决到最优。© 2015爱思唯尔有限公司版权所有
Bicycle sharing systems can significantly reduce traffic, pollution, and the need for parking spaces in city centers. One of the keys to success for a bicycle sharing system is the efficiency of rebalancing operations, where the number of bicycles in each station has to be restored to its target value by a truck through pickup and delivery operations. The Static Bicycle Rebalancing Problem aims to determine a minimum cost sequence of stations to be visited by a single vehicle as well as the amount of bicycles to be collected or delivered at each station. Multiple visits to a station are allowed, as well as using stations as temporary storage. This paper presents an exact algorithm for the problem and results of computational tests on benchmark instances from the literature. The computational experiments show that instances with up to 60 stations can be solved to optimality within 2 hours of computing time. © 2015 Elsevier B.V. All rights reserved.