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â€¦ (More)

The Probabilistic Traveling Salesman Problem (PTSP) is an extension of the classical Traveling Salesman Problem (TSP). The main difference is the stochastic presence of the customers, that is, theâ€¦ (More)

2015 IEEE/ACIS 16th International Conference onâ€¦

2015

The Probabilistic Traveling Salesman Problem (PTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), the main difference is the cities are present with a probability. PTSP isâ€¦ (More)

2017 IEEE/ACIS 16th International Conference onâ€¦

2017

This paper provides a new parallel hybrid-heuristic by using the Open MPI environment for solving the Probabilistic Traveling Salesman Problem (PTSP). It is a variation of the classic Travelingâ€¦ (More)