1673-159X

CN 51-1686/N

基于蚁群算法的公共自行车系统调度算法研究

Study on Scheduling Algorithm for Public Bicycle System Based on Ant Colony Algorithm

  • 摘要: 为解决公共自行车系统车辆调度问题,通过分析1d内不同时段公共自行车的借还需求情况,从成本最小化和租赁点满意度最大化2个目标出发,在平峰时段建立不带时间窗的公共自行车车辆调配路径优化模型,在高峰时段建立基于滚动时域的公共自行车车辆调配路径优化模型,并运用蚁群算法近似求解不同时段车辆调配路径。算例结果表明:平峰时优化后行驶路程比初始行驶路程减少48.5%,费用减少14.1%;高峰时优化后租赁点满意度比初始满意度高62.3%。这2种模型是合理和科学的。

     

    Abstract: For the public bicycle system vehicle scheduling problem, this paper solves the problem by analyzing public bicycle demand characteristics at different times of a day. Based on the objective of minimized costs and maximized satisfaction, two models are created, i.e., public bicycle vehicle allocation path optimization model without time window and public bicycle vehicle allocation path optimization model based on rolling horizon, and ant colony optimization is used to solve the model. Finally, the example result shows that a reduction of 48.5% and the decrease of 14.1% at flat peak are attained with the optimized route, while an increase of 62.3% at peak period is achieved with the optimized satisfaction. It shows that the models are reasonable and scientific.

     

/

返回文章
返回