Bus blocking optimization in transit planning

In this study, an approach has been developed in which public transportation services on certain routes can accommodate travel demans using a minimum number of buses. In this approach, the aim is to the buses assignment to voyages which is predetermined timetable by switching between routes. The flexibility of transition between routes allows that the vehicles to satisfy the service with fewer vehicles by reducing the minimum waiting rate at the start and end points. A mathematical model for the Bus Route Assignment (OGA) problem, which is defined in the study, and whose boundaries and constraints are specified, has been established. This model is successful to expressing the problem. The OGA problem is in the category of combinatorial optimization problems in the literature. Meta-heuristic algorithms are frequently used for large-scale problems of this kind. In this study, we used the Ant Colony Optimization algorithm, which is a meta-heuristic algorithm for the OGA problem. ACO method is adapted for problem and algorithm steps is explained. The algorithm is run for the four created scenarios. The algorithm produces successful results.