Vehicle routing problem for information collection in wireless networks

Luis Flores Luyo (1) , Agostinho Agra (2) , Rosa Figueiredo (3) , Eitan Altman (4, 3) , Eladio Ocaña Anaya (1)

1 IMCA - Instituto de Matematica y Ciencias Afines
2 Universidade de Aveiro
3 LIA - Laboratoire Informatique d'Avignon
4 NEO - Network Engineering and Operations

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.

Mots clés: Vehicle Routing Problem; Wireless Sensor Networks; Delay Tolerant Networks; Integer Programming

Domaines: Recherche opérationnelle [math.OC]

Luis Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eitan Altman, Eladio Ocaña Anaya. Vehicle routing problem for information collection in wireless networks. ICORES 2019 - 8th International Conference on Operations Research and Enterprise Systems, Feb 2019, Prague, Czech Republic. ⟨hal-02176511⟩