In this work, we propose a GRASP+VNS algorithm for solving the allocation of Roadside Units (RSUs) in a Vehicular Network. Our main objective is to find the minimum set of RSUs to meet a Deployment Δ_ρ2^ρ1. The Deployment Δ_ρ2^ρ1 is a metric for specifying minimal communication guarantees from the infrastructure supporting the Vehicular Network. We compare GRASP+VNS to some baseline algorithms: (i) Delta-g; (ii) Delta-r and, (iii) the optimal value. Our results demonstrate that our approach requires up to 90% less Roadside Units to meet the QoS required by Deployment Δ_ρ2^ρ1 metric. Besides, different from the baseline algorithms, our approach find results that differ no more than 17% from the optimal values for all tested instances.