摘要
针对校车路径规划问题,基于约束条件及优化目标,考虑交通拥堵状况,建立了最小化校车数量和最小化校车行驶时间的混合整型规划模型,并用改进的蚁群算法进行求解。该算法分为2个阶段:(1)对所有站点进行区域划分,以最小化车辆数和负载均衡为目标,把所有站点划分为若干个规模较小的区域;(2)考虑交通拥堵情况,利用改进的蚁群算法进行区域内路线优化。仿真结果表明:该算法收敛速度较快,适合大型校车路径优化问题。
The purpose of this study is to solve the school bus route planning problem subjected to objectives,constraints and traffic congestion.A mixed integer programming model wasdeveloped based on the minimization ofbusnumberand travel time. The model was tested with an improved ant colony algorithm. First, all the sites were separa-ted into several small region to minimize the number of vehicles. Second,the route opt-mization problem of each regions with traffic congestion was solved by the improved ant colony algorithm.The results indicated that this algorithm was superior in fast conver-gence and suitable for large scale school bus routing optimization problem.
出处
《交通科学与工程》
2017年第1期72-77,共6页
Journal of Transport Science and Engineering
基金
国家自然科学基金项目(61272417)
关键词
校车路径问题
改进蚁群算法
多目标混合整型规划
交通拥堵因子
school bus routing problem
improved ant colony algorithm
multi-objective mixed integer programming
traffic congestion factor
