Optimal time transfer in bus transit route network design using a genetic algorithm

In this paper we propose a new model showing how genetic algorithms can be manipulated to help optimize bus transit routing design, incorporating unique service frequency settings for each route. The main lesson is in the power that can be given to heuristic methods if problem content is exploited appropriately. In this example, seven proposed genetic operators are designed for this specific problem to facilitate the search within a reasonable amount of time. In addition, headway coordination is applied by the ranking of transfer demands at the transfer terminals. The model is applied on a benchmark network to test its efficiency, and performance results are presented. It is shown that the proposed model is more efficient than the binary-coded genetic algorithm benchmark, in which problem content cannot be utilized.