Local Search Method for Multiple-Vehicle Bike Sharing System Routing Problem
Local Search Method for Multiple-Vehicle Bike Sharing System Routing Problem
复制标题
多车共享单车系统路径问题的局部搜索方法
DOI：
10.2299/jsp.22.157
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
K. Jin'no
中科院分区：
文献类型：
--
作者：
Honami Tsushima;Takafumi Matsuura;K. Jin'no
为了寻找共享单车系统中运输车辆的最短行程，提出了一个共享单车系统路径问题。在BSSRP中，一辆车恢复了车站的自行车数量。然而，在一个真实的系统中，每个站点的自行车数量的恢复是由多个车辆进行的。为了确定多辆自行车的最短行程，提出了一种多车共享系统路径问题（mBSSRP）数学优化模型。提出了求解大型mBSSRP的构造方法和局部搜索方法。数值实验结果表明，该方法能在短时间内找到较好的解。
To find the shortest tour of a transporting vehicle in a bike sharing system (BSS), a bike sharing system routing problem (BSSRP) has been proposed. In the BSSRP, a single vehicle restores the number of bicycles in stations. How-ever, in a real system, the restoration of the number of the bicycles in each station is carried out by multiple vehicles. To decide the shortest tour of the multiple vehicles, we proposed a mathematical optimization model called the multiple-vehicles bike sharing system routing problem (mBSSRP). We present a construction method and local search methods to solve the large-size mBSSRP. The result of numerical experiments shows that the proposed method can find good solutions in a short time.