Mixed integer formulations for a routing problem with information collection in wireless networks

We study a routing-collecting problem where a system of stations is considered. A vehicle is responsible for collecting information generated continuously in the stations and to deliver it to a base station. The objective is to determine the vehicle route and the collection operations, both physical and wireless, in order to maximize the amount of information collected during a time horizon. Three mixed integer programming models are introduced and a computational study is reported to compare the performance of a solver based on each one of the models.publishe

Vehicle routing problem for information collection in wireless networks

International audienceAdvances 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

Vehicle routing problem for information collection in wireless networks

International audienceAdvances 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

Correspondencias y sus aplicaciones

En este trabajo presentamos un estudio del análisis de correspondencias que bajo ciertas hipótesis esto repercute como una extensión del análisis matemático clásico; en particular se estudia un resultado equivalente al teorema do la función implícita, cuya importancia es amplia por ejemplo cuando las restricciones de un problema de minimización forman un sistema de desigualdades. También describimos algunas condiciones impuestas a las funciones para la obtención del conjunto de puntos mínimos mediante límites de correspondencias.Tesi

Inertial-relaxed splitting for composite monotone inclusions

International audienceIn a similar spirit of the extension of the proximal point method developed by Alves et al. [2], we propose in this work an Inertial-Relaxed primal-dual splitting method to address the problem of decomposing the minimization of the sum of three convex functions, one of them being smooth, and considering a general coupling subspace. A unified setting is formalized and applied to different average maps whose corresponding fixed points are related to the solutions of the inclusion problem associated with our extended model. An interesting feature of the resulting algorithms we have designed is that they present two distinct versions with a Gauss-Seidel or a Jacobi flavor, extending in that sense former proximal ADMM methods, both including inertial and relaxation parameters. Finally we show computational experiments on a class of the fused LASSO instances of medium size