Abstract—The school bus problem routing (SBRP) is an important practical problem studied in combinatorial optimization of operational research. It is formulated through a set of stops, buses, schools and garage, where from these sets, we seek to create optimized routes to reduce the operating cost of the service. This paper presents a solution to the SBRP, using the GRASP applied to a real problem. This meta-heuristic is divided into two stages: the construction of a viable solution and followed by a Local Search procedure. These two phases are repeated in each iteration. In the construction phase, a greedy and random function is used to construct an initial solution. It is also presented compared to the widely used heuristic and good results in the literature.

Index Terms—Combinatorial optimization, school bus, GRASP, SBRP, metaheuristic.

Vilson Soares de Siqueira is with Systems Development Department, Federal Institute of Tocantins, Brazil (email: vilsonsoares@ifto.edu.br).

Cite: Vilson Soares de Siqueira, Fernando Jorge Ebrahim Lima e Silva, Elvis Nascimento da Silva, Raimunda Vieira Santos da Silva, Marcelo Lisboa Rocha, "Implementation of the Metaheuristic GRASP Applied to the School Bus Routing Problem," International Journal of e-Education, e-Business, e-Management and e-Learning vol. 6, no. 2, pp. 137-145, 2016.