Learn More
—The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the classic Traveling Salesman Problem (TSP) in which only a subset of potential nodes needs to be visited on any given instance of the problem. The number of nodes to be visited each time is a random variable. The objective is to find an a priori tour which minimizes the expected(More)
The wireless sensor networks (WSN) represent a very promising domain. They can be used in a large variety of applications due to their easy deployment and their low cost of construction. These networks are composed of plenty of sensor nodes that are deployed in the monitoring field, and they form a multihop self-configured network by means of wireless(More)
In the probabilistic two-dimensional Bin Packing problem (2D-PBPP), one is asked to pack a random number of rectangular items, without overlap and any rotation, into the minimum number of identical square bins. In this paper we consider the re-optimization procedure used for solving probabilistic combinatorial optimization problems and an approximation of(More)
The Probabilistic Traveling Salesman Problem is in general NP-Hard, the objective of this paper is to look for particular cases which can be solved in an easy way. First we give the relation between the two problems deterministic and probabilistic. Second, we study the stability of the deterministic problem. We prove that in the small traveling salesman(More)
The wireless sensor network is enormously used in a random way in different environments to execute diverse applications and tasks. Because of its sensitivity, various research projects have been conducted with the aim of finding solutions in the presence of failures. New versions of K-means And Traveling Salesman Problem based mobility protocol, based on(More)