摘要
以大学城教师接送车辆的线路优化为研究对象,针对大学教师接送站点分布分散的特点,建立多线路的校车调度方案,提出了一种利用K-means聚类算法对已有的站点位置进行区域划分,利用改进蚁群算法对每个区域的校车运行线路进行优化的方法。以杭州大学城某高校的校车线路优化为实例,验证在最适当的线路数下,得到最佳的目标值,能更好地提高校车效率。
According to the distribution characteristics of the stations, a multi-objective solution is set up to study the school bus route problems of university town;the station and route optimization of the school bus are usually a single line, but they are parallel lines of reality. A K-means clustering algorithm for zoning for the stations, an improved ant colony algorithm for school bus route optimization method, are proposed to better improve the efficiency of the school bus. A university of Hangzhou as an example, the best value in the most appropriate route can be got. Compared with the current research of single line, this method can solve practical problems.
出处
《计算机工程与应用》
CSCD
北大核心
2015年第12期246-249,254,共5页
Computer Engineering and Applications
关键词
校车
聚类算法
改进蚁群算法
线路选择
线路优化
school bus
clustering algorithm
improved ant colony algorithm
route selection
route optimization
