摘要
随着城市规模的扩大及城市功能区的划分,学生的居住地与学校分离问题越来越严重,城市学生的平均上下学时间和距离不断增长,同时也引发了大量的交通拥堵问题.针对该问题提出一个快速有效的模型,解决无混载校车路线规划问题.该模型以最短路径为目标函数,列出了一系列的约束条件,最后求出一条满足所有约束条件的路径.实验结果表明:该模型在解决校车路径优化问题上能够缩短行驶距离,达到降低运营成本的目的.
With the expansion of urban scale and the division of urban functional areas, the separation of students’ schools and residences is becoming more and more serious. The average time and distance of urban students to and from school is growing,which also causes a lot of traffic congestion. Aiming at this problem,an effective and fast model is proposed to solve the problem of route planning for unmixed school buses. The model takes the shortest path as the objective function, lists a series of constraints,and finally finds a path that satisfies all constraints. The experimental results show that the model can shorten the driving distance and reduce the operating cost in solving the problem of school bus route optimization.
作者
高巍
陈泽颖
李大舟
GAO Wei;CHEN Ze-ying;LI Da-zhou(Shenyang University of Chemical Technology,Shenyang 110142,China)
出处
《沈阳化工大学学报》
CAS
2020年第4期377-384,共8页
Journal of Shenyang University of Chemical Technology
基金
辽宁省教育厅科学技术研究项目(L2016011)
辽宁省教育厅科学研究项目(LQ2017008)
辽宁省博士启动基金(201601196)。
关键词
动态规化
校车路径问题
最短路径
dynamic planning
school bus routing problem(SBRP)
shortest path