The waste collection task is the one that consumes most resources in the municipal solid waste management system (MSWMS). The problem can be approached by mathematically modeling it as a vehicle routing problem and using algorithms to find the optimized waste collection path. Among the algorithms, heuristic and metaheuristic algorithms are recognized to find near-optimal paths for the waste collection task given a feasible execution time. For instance, the heuristic and metaheuristic algorithms available in OR-tools have already demonstrated applicability to optimize waste collection. However, in most cases, the algorithms are explored separately. In this paper, the combination of heuristic with metaheuristic algorithms available in OR-tools was used to optimize paper, plastic, and glass waste collections. Heuristics were used to find the first solution, so the metaheuristic could continue and attempt to refine the initial solution based on the metaheuristics search mechanism. Results demonstrated potential total distance reduction in the order of 27, 39, and 52 km for paper, plastic, and glass waste collection across hybrid solutions explored.