Tabu search for solving multiple-vehicle bike sharing system routing problem with real port distribution
Tabu search for solving multiple-vehicle bike sharing system routing problem with real port distribution
复制标题
利用真实端口分布解决多车共享单车系统路由问题的禁忌搜索
DOI：
10.1109/iceccme55909.2022.9988144
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
Ikeguchi Tohru
中科院分区：
文献类型：
--
作者：
Tsushima Honami;Sviridova Nina;Ikeguchi Tohru
自行车共享系统（BSS）是世界各大城市推出的环保交通系统之一。然而，BSS面临着一个关键的挑战：由于用户可以自由租用和归还自行车，因此各港口之间的自行车不平衡。有必要在使用车辆的港口之间恢复自行车，以克服这个问题。我们已经提出了在合理的时间范围内找到车辆的图尔斯的搜索策略。在我们以前提出的方法中，我们使用禁忌搜索，利用执行两个本地搜索：交叉交换和或选择。在数值实验中，我们使用均匀分布的端口的实例来评估我们以前的方法的性能;然而，真实的BSS端口不是均匀分布的。因此，在本文中，我们使用来自四个BSS（波士顿，华盛顿特区，纽约，芝加哥），以调查我们的方法是否是有效的非随机分布的端口的较大规模的实例（200端口）。从数值实验来看，我们提出的方法对于基于真实的BSS端口位置的实例也是有效的。
The bicycle sharing system (BSS) is one of the eco-friendly transportation systems introduced in major cities world-wide. However, BSS faces one crucial challenge: an imbalance of bicycles among the ports, because users are free to rent and return bicycles freely. It is necessary to restore the bicycles among the ports using vehicles to overcome this issue. We have already proposed search strategies for finding the tours of the vehicles in a reasonable time frame. In our previously proposed method, we used the tabu search which harnesses executing two local searches: the CROSS-exchange and the Or-opt. In the numerical experiment, we used instances with uniformly distributed ports to evaluate the performance of our previous method; however, real BSS ports are not uniformly distributed. Thus, in this paper, we use instances with real port distributions from four BSSs (Boston, Washington D.C., New York, Chicago) to investigate whether our method is effective for non-randomly distributed ports of larger-size instances (200 ports). From the numerical experiments, our proposed method is also effective for instances based on real BSS port locations.