Optimal Regional Bus Timetables Using Improved Genetic Algorithm
Optimal Regional Bus Timetables Using Improved Genetic Algorithm
复制标题
使用改进的遗传算法优化区域公交车时刻表
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Dayong Luo
中科院分区：
文献类型：
--
作者：
Hairong Yang;Dayong Luo
公交系统时刻表的选择是调度问题的一个重要方面。针对区域公交车调度问题，提出了一种公交车时刻表优化模型。其目标是在满足交通需求、发车时间和最大（最小）间隔等运营约束的前提下，使换乘节点的换乘时间最小化。这是一个混合整数非线性规划问题，这是很难解决使用经典技术。在本文中，遗传算法（GA）进行了修改，用于解决这个问题。改进遗传算法引入了模拟退火算法，改善了遗传算法的早熟和进化速度慢的现象。最后以实际公交线路为例，验证了模型的合理性和算法的可行性。
Selection of timetables for a transit system is a vital aspect of the schedule problem. An optimal model of timetables is presented for regional bus scheduling problem. Its objective is to optimize timetables in such a way that the transfer time of passengers at the transfer nodes is minimized while the operational constraints such as the traffic demand, departure time and maximum (minimum) headway are satisfied. This is a mixed integer nonlinear programming problem, which is difficult to solve using classical techniques. In this paper, modifications are made to Genetic Algorithm (GA) used to solve the problem. The Improved Genetic Algorithm (IGA) imports the simulated annealing algorithm to improve the premature and slow evolution speed phenomenon. In the last part, taking practical bus lines as an example, the reasonable of the model and the feasibility of the algorithm are tested.