The invention discloses an intelligent bus scheduling method based on a hybrid heuristic algorithm. A simulated annealing algorithm and a generic algorithm are combined, and an elitism strategy and a fitness stretching function are added. Individuals with maximum fitness in a population of each generation are directly retained to a next generation, so that the individuals are protected from being damaged by crossover and mutation operation. Through the fitness stretching function, differences among the individuals are reduced at the initial stage of the algorithm, so that the diversity of the population is increased, and the generic algorithm is prevented from falling into a local optimal solution. At the later stage of the algorithm, the differences among the individuals are increased, so that the selection probability of excellent individuals is increased, and a convergence speed is increased. The intelligent bus scheduling method is high in speed; an optimized scheduling plan can be obtained within a short time under the condition of given departure time frequency; and the waiting time of passengers is shortened greatly. The departure frequency can be adjusted dynamically, so that the departure frequency is accordant with the change rule of a total passenger flow volume. The departure time intervals can be adjusted dynamically, so that the waiting time of the passengers is shortened greatly.
Intelligent bus scheduling method based on hybrid heuristic algorithm
2015-04-08
Patent
Electronic Resource
English
Bottleneck Focused Heuristic Algorithm for Hybrid Flow Shop Scheduling Problem
British Library Online Contents | 2012
|Aircraft Dynamic Scheduling Algorithm Research Based on Heuristic Column Generation Algorithm
Trans Tech Publications | 2013
|A kind of hybrid heuristic genetic algorithm with applications to job shop scheduling
British Library Online Contents | 1998
|