Benders Decomposition Algorithms for a School Bus Routing Problem

The School Bus Routing problem is a type of routing problem that accounts for transporting students between bus stops and schools (in both directions). Despite its social and economic importance, it is an NP-hard problem and lacks exact solution methods. For this, we propose and evaluate two Benders decomposition algorithms. Evaluating them with instances from the literature shows smaller gaps and more proven optimal solutions when compared to the direct use of a branch-and-cut-based solver