【摘要】 当前共享单车停放点经常出现供需时空失衡现象,无法满足市民的出行需求,因此,单车投放机构需要进行调度以平衡城市各共享单车投放点的供应量。为保证共享单车的调度效率,需要选择合理的调度路径,针对共享单车的调度路径优化问题开展研究:以调度车辆最少和调度成本最低为目标,构建多车场有时间窗要求的共享单车调度路径优化模型;基于禁忌搜索算法,设计模型的求解算法;以某城市大区内的摩拜单车系统为例进行案例分析。结果表明:利用此模型和算法能有效减少调度成本,提高共享单车的调度效率。更多还原

【Abstract】 At present, there is a time-space imbalance between supply and demand for the parking points of shared-bikes, which leads to the failure of citizens’ travel demands to be met. Therefore, the delivery agencies of shared-bikes need to timely dispatch and balance the supply of each shared-bike delivery point in the city. In order to ensure the scheduling efficiency of shared-bikes, it is necessary to select a reasonable scheduling path. This paper studies the optimization problem of shared-bike scheduling path. Aiming at the least dispatching vehicles and the lowest dispatching cost, it proposes the scheduling path optimization model of shared-bikes with time Windows in multiple vehicle yards. Based on tabu search algorithm, the model solving algorithm is designed. The Mobike system in a large urban area is taken as an example for case analysis. The result shows that this model and algorithm can reduce the scheduling cost and improve the scheduling efficiency of shared bicycles.更多还原