【作者】 陈少华； 左兴权； 杨鑫；

【Author】 Chen Shaohua;Zuo Xingquan;Yang Xin;School of Computer Science,Beijing University of Posts and Telecommunications;Key Laboratory of Trustworthy Distributed Computing and Service,Ministry of Education;

【机构】 北京邮电大学计算机学院； 可信分布式计算与服务教育部重点实验室；

【摘要】 公交车辆排班问题是指根据发车时刻表确定车辆发车时间,以使车辆发车时间覆盖发车时刻表中所有的时刻点,同时最小化某些性能指标。本文提出一种基于模拟退火算法的公交车辆排班方法。首先,设计了一种编码方法表示问题的解;然后,设计了解的评价方法;最后提出一种模拟退火算法来获取问题的优秀解。利用北京公交集团实际公交运营数据对该方法进行验证,实验结果表明与人工排班相比,本文方法可在短时间内生成高质量的车辆排班方案。更多还原

【Abstract】 The bus vehicle scheduling problem is to determine departure times of vehicles based on the timetable, such that the departure times of vehicles cover all the times in the timetable and meanwhile minimize some performance metrics. This paper proposes a bus vehicle scheduling method based on a simulated annealing algorithm. First, we propose a coding scheme to express a solution to the problem. Then, we design an evaluation function to evaluate the solution. Finally, a simulated annealing algorithm is used to obtain an excellent solution. This approach is verified using real-world operational data from the bus company of Beijing city, China. Experimental results show that compared with the manual scheduling method, the proposed method can generate a high quality vehicle scheduling solutions in a short time.更多还原