A Hybrid Partitioning Algorithm to Solve Big Instances of the Probabilistic TSP

Today, the majority of the applications related to the Probabilistic Traveling Salesman Problem(PTSP) bring us big data. The adaptation of new strategies for solving this problem of large data is of major interest. In this framework, we propose a new hybrid partitioning algorithm to solve Big Data PTSP: by combining an exact algorithm and Karp partitioning algorithm. The numerical results showed that the proposed algorithm give good solutions in a real computation time, especially when the points are uniformly distributed.