This work investigates a computational method for theoptimization of the Enabled Vehicle Routing Problem. To proposethe method, the variable neighborhood search meta-heuristic(Variable Neighborhood Search-VNS) was used. The proposedheuristic contains the implements of 5 neighborhood structures, 4of them built with deterministic methods, to explore the searchspace in order to obtain local minima. In addition to thesestrategies, a search with random factors is also presented, to try toescape from local minima. For the computational tests, 4 groupsof instances were used, with different characteristics, seeking toevaluate the heuristic in different scenarios. In the results it wasfound that the heuristic was able to obtain good results, with anerror of up to 8% of the solution.