iterated local search algorithm with strategic oscillation for school bus routing problem with bus stop selection

The school bus routing problem (sbrp) represents a variant of the well-known vehicle routing problem. the main goal of this study is to pick up students allocated to some bus stops and generate routes, including the selected stops, in order to carry students to school. in this paper, we have proposed a simple but effective metaheuristic approach that employs two features: first, it utilizes large neighborhood structures for a deeper exploration of the search space; second, the proposed heuristic executes an efficient transition between the feasible and infeasible portions of the search space. exploration of the infeasible area is controlled by a dynamic penalty function to convert the unfeasible solution into a feasible one. two metaheuristics, called n-ils (a variant of the nearest neighbourhood with iterated local search algorithm) and i-ils (a variant of insertion with iterated local search algorithm) are proposed to solve sbrp. our experimental procedure is based on the two data sets. the results show that n-ils is able to obtain better solutions in shorter computing times. additionally, n-ils appears to be very competitive in comparison with the best existing metaheuristics suggested for sbrp.