Advances in computer network architecture add continuously new features to vehicle routing problems. In this work, the Wireless Transmission Vehicle Routing Problem (WT-VRP) is studied. It looks for a route to the vehicle responsible for collecting information from stations as well as an efficient information collection planning. The new feature added here is the possibility of picking up information via wireless transmission, without visiting physically the stations of the network. The WT-VRP has applications in underwater surveillance and environmental monitoring. We discuss three criteria for measuring the efficiency of a solution and propose a mixed integer linear programming formulation to solve the problem. Computational experiments were done to access the numerical complexity of the problem and to compare solutions under the three criteria proposed.