Capacitated Vehicle Routing Problem is the most important variation of the classical Vehicle Routing Problem, where the goal is to find the routes for a fleet of vehicles to serve a number of customers, taking into consideration the maximum capacity of the vehicles. Due to the complexity of solving such problems, meta-heuristic algorithms are used. The Group Teaching Optimization algorithm is a recent technique used to solve continuous optimization problems. An enhanced version of the algorithm is proposed to solve the Capacitated Vehicle Routing Problem. The algorithm was tested on 14 different instances from benchmarks with known optimal solutions and compared to other techniques. The algorithm yields satisfactory solutions within lower computational time than the other techniques.