School bus routing based on branch and bound approach

Congestion in the traffic is the most basic problem that most of the cities facing now a days. This problem is mainly evolved due to increase in travel demand and limited scope of increasing the infrastructure needed to hold that traffic. So from there comes the concept of vehicle routing problem and thus the problem of School Bus Routing Problem (SBRP). In the past Hungarian Algorithm was used. Evolution of technology and day by day advancements in wireless communication and algorithms has lead us to use of Branch and Bound approach to solve this problem. In this paper, we explore efficient routing algorithm for SBRP. In, this paper, Branch and Bound Routing algorithm is proposed for SBRP. The Branch and bound algorithm provide optimal solution for the smaller problems. For a group of schools it will provide an optimal solution that will help those schools to optimize the bus routes, number of buses used and thus optimizing cost. This will also help in reducing pollution as the distance travelled by buses is optimized.