“红包车”机制下的共享单车调度问题

共享单车具有随取随放的优点,但用户的租还车使站点之间经常出现供需不平衡现象.为了有效缓解运营商调度压力,提出了一种顾客参与调度的共享单车调度方式.将某些闲置的共享单车设置为红包车,鼓励用户将红包车骑到需求旺盛的区域,用户完成调度后可以获得红包奖励.以运营商运输成本,红包奖励支出以及未满足站点需求的惩罚成本最小为目标建立了混合整数规划模型,并设计了混合禁忌搜索算法对模型进行了求解.数值实验表明:红包车机制可有效减少运营商总成本;混合禁忌搜索算法可以有效求解大规模问题.

A user-based method for the static bike repositioning problem

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.