基于模拟退火算法的共享单车动态调度问题研究

Dynamic Scheduling of Shared Bicycles Based on Simulated Annealing Algorithm

针对共享单车的时空分布不均衡,无法满足部分出行者需求的情况,研究共享单车动态调度问题,以减少骑行需求损失,降低调度成本。本文综合考虑车辆分布的时空变化、满足骑行需求的收益和调度成本,以总利润最大为目标,建立共享单车的动态调度模型,采用模拟退火算法对问题进行求解。算例分析表明,该模型可以有效地指导调度车辆路径的优化调整,减少骑行需求损失,提高用户满意度和共享单车运营商收益,基于模拟退火算法的求解方法表现出较好的收敛性。

In view of the uneven spatial and temporal distribution of shared bicycles,which cannot meet the needs of some travelers,this paper studies the dynamic scheduling problem of shared bicycles in order to reduce the loss of riding demand and reduce the scheduling cost.This paper comprehensively considers the spatial and temporal changes of vehicle distribution,the income and scheduling cost of meeting the riding demand,and aims to maximize the total profit.A dynamic scheduling model of shared bicycles is established,and the simulated annealing algorithm is used to solve the problem.Case analysis shows that the model can effectively guide the optimization and adjustment of dispatched vehicle paths,reduce the loss of riding demand,improve user satisfaction and the revenue of shared bicycle operators,and the solution method based on simulated annealing algorithm shows good convergence.