Transit network design by genetic algorithm with elitism
In this paper, we study the transit routing problem and present a metaheuristics framework for solving it. We introduce two different versions of Genetic Algorithm (GA) for the problem. Our algorithms allow us to concentrate on minimizing the travel time and the number of transfers simultaneously. We show the effectiveness of our schemes, by comparing our results with previously published results on a benchmark instance. We further test our algorithms on 3 real networks based on bus route network maps for real cities.
transit network genetic algorithm elitism