城市公共自行车调度优化方法研究  

Research on Dispatch Optimization of Urban Bicycle Sharing System

作　　者：刘冉[1,2,3] 戴冀峰[1,2,3] 林建新[1,2,3] 杨倩[1,2,3] 

机构地区：[1]北京建筑大学土木与交通工程学院,北京100044 [2]北京建筑大学北京市城市交通基础设施建设工程技术研究中心,北京100044 [3]北京建筑大学首都世界城市顺畅交通协同创新中心,北京100044

出　　处：《交通工程》2017年第2期1-5,26,共6页Journal of Transportation Engineering

摘　　要：目前城市公共自行车系统采用车辆调度的方法解决站点车辆和车桩不能满足使用者需求的问题,但对调度数量和路径选择的不合理往往导致调度效率偏低,以及调度资源的浪费.本文结合库存理论与车辆路径规划理论建立了库存-路径模型,通过求解站点车辆的库存上、下限,得到站点最大调度车辆数,并结合调度路径,提供调度量与路径的多种组合方案.随后利用遗传算法求解,以调度成本最小为目标,确定最终调度方案.模型直接引入站点存量限制,减少约束条件,并以实时借还数据为基础,实现了站点车辆的动态调度,提高调度效率,减少调度成本,缓解设备数量和需求数量的矛盾.At present,the urban bicycle sharing system uses dispatching to address the situation where the supply of bikes and lock piles cannot meet the demands of users. However, the unreasonable dispatching quantity and the route choice often lead to the low efficiency and the waste of the dispatching resources. Based on the inventory theory and VRP, we establish an inventory -routing model, which estimates the maximum number of bikes in each station by solving the inventory upper and lower limits. Combined with the repositioning routing,the model can provide a variety of repositioning programs. The final program is determined by minimizing the cost of repositioning with genetic algorithm. The model directly introduces the station stock limit to reduce the constraint condition, and achieves the dynamic repositioning based on the real data of the system to improve repositioning efficiency,reduce the cost and relieve the contradiction between facilities and demands.

关 键 词：公共自行车系统 库存理论 调度路径 遗传算法 

分 类 号：U491[交通运输工程—交通运输规划与管理]