We consider a wireless network where a given set of stations is continuously generating information. A single vehicle, located at a base station, is available to collect the information via wireless transfer. The wireless transfer vehicle routing problem (WTVRP) is to decide which stations should be visited in the vehicle route, how long shall the vehicle stay in each station, and how much information shall be transferred from the nearby stations to the vehicle during each stay. The goal is to collect the maximum amount of information during a time period after which the vehicle returns to the base station. The WTVRP is NP-hard. Although it can be solved to optimality for small size instances, one needs to rely on good heuristic schemes to obtain good solutions for large size instances. In this work, we consider a mathematical formulation based on the vehicle visits. Several heuristics strategies are proposed, most of them based on the mathematical model. These strategies include constructive and improvement heuristics. Computational experiments show that a strategy that combines a combinatorial greedy heuristic to design a initial vehicle route, improved by a fix-and-optimize heuristic to provide a local optimum, followed by an exchange heuristic, affords good solutions within reasonable amount of running time.

中文翻译：

---

无线网络中具有信息收集功能的车辆路线问题的启发式方法

我们考虑一个无线网络，其中给定的一组站不断产生信息。可以使用位于基站的单个车辆通过无线传输来收集信息。无线传输车辆路由问题（WTVRP）是要确定应在车辆路线中访问哪些站点，在每个站点中车辆应停留多长时间以及在每次停留期间应从附近站点向车辆传输多少信息。目标是在车辆返回基站之后的一段时间内收集最大信息量。WTVRP是NP硬式的。尽管可以将其解决为小型实例的最佳选择，但仍需要依靠良好的启发式方案来获得大型实例的良好解决方案。在这项工作中 我们考虑基于车辆访问次数的数学公式。提出了几种启发式策略，其中大多数基于数学模型。这些策略包括建设性和改进启发式。计算实验表明，结合固定贪婪启发式算法设计初始车辆路线的策略（通过固定和优化启发式算法进行改进以提供局部最优值，然后进行交换启发式算法）可以在合理的运行时间内提供良好的解决方案。