This study presents a case study of the School Bus Routing Problem (SBRP), focusing on improving the quality of student transportation services. Although numerous studies have addressed the SBRP, this study tackles a new variant driven by a negative impact policy to limit the number of continuing students facing extended travel times. We present this variant and propose a mathematical formulation along with a hybrid metaheuristic approach for it. Furthermore, we conduct comprehensive experiments to evaluate algorithms’ performance and various configurations of the negative impact policy on both artificial and real instances. Computational results confirm the effectiveness of our hybrid algorithm.