A user-based method for the static bike repositioning problem

被引：0
|
作者：
Xu G. [1 ,2 ]
Li Y. [2 ]
Jin D. [2 ]
Li J. [2 ]
机构：
[1] Tourism College, Hainan University, Haikou
[2] School of Economics and Management, Southwest Jiaotong University, Chengdu
来源：
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice | 2020年 / 40卷 / 02期
基金：
中国国家自然科学基金;
关键词：
Bike repositioning problem; Hybrid tabu search; Lucky bike; User-based;
D O I：
10.12011/1000-6788-2018-0884-11
中图分类号：
学科分类号：
摘要：
Shared bike can be retrieved and parked at any station in the bike-sharing system. One of the most important challenge is the demand for bikes is always deviated from the supply. This paper proposed a new user-based method for shared bike repositioning problem. In the proposed problem, some excess bikes are set as lucky bikes which are relocated by users to unsaturated nodes. Users can gain the monetary rewards after the completion of the relocations. A mixed integer programming model is formulated to minimize the total transportation cost, the total reward payouts and the total penalties due to unmet demand. To solve this problem, a hybrid tabu search is developed. The numerical experiments show that the user-participating mechanism can effectively reduce the total cost. The hybrid tabu search can effectively solve the large networks of the proposed problem. © 2020, Editorial Board of Journal of Systems Engineering Society of China. All right reserved.
引用
收藏
页码：426 / 436
页数：10
相关论文
共 26 条
  • [1] Li Y., Szeto W.Y., Long J., Et al., A multiple type bike repositioning problem, Transportation Research Part B: Methodological, 90, pp. 263-278, (2016)
  • [2] Di-Gaspero L., Rendl A., Urli T., A hybrid ACO+ CP for balancing bicycle sharing systems, International Workshop on Hybrid Metaheuristics, pp. 198-212, (2013)
  • [3] Di-Gaspero L., Rendl A., Urli T., Balancing bike sharing systems with constraint programming, Constraints, 21, 2, pp. 318-348, (2016)
  • [4] Raidl G.R., Hu B., Rainer-Harbach M., Et al., Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations, International Workshop on Hybrid Metaheuristics, pp. 130-143, (2013)
  • [5] Rainer-Harbach M., Papazek P., Hu B., Et al., Balancing bicycle sharing systems: A variable neighborhood search approach, European Conference on Evolutionary Computation in Combinatorial Optimization, pp. 121-132, (2013)
  • [6] Rainer-Harbach M., Papazek P., Raidl G.R., Et al., PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, Journal of Global Optimization, 63, 3, pp. 597-629, (2015)
  • [7] Benchimol M., Benchimol P., Chappert B., Et al., Balancing the stations of a self-service "bike hire" system, RAIRO-Operations Research, 45, 1, pp. 37-61, (2011)
  • [8] Chemla D., Meunier F., Calvo R.W., Bike sharing systems: Solving the static rebalancing problem, Discrete Optimization, 10, 2, pp. 120-146, (2013)
  • [9] Erdogan G., Laporte G., Calvo R.W., The static bicycle relocation problem with demand intervals, European Journal of Operational Research, 238, 2, pp. 451-457, (2014)
  • [10] Nair R., Miller-Hooks E., Hampshire R.C., Et al., Large-scale vehicle sharing systems: Analysis of V'elib, International Journal of Sustainable Transportation, 7, 1, pp. 85-106, (2013)
123