抄録
Probabilistic Travelling Salesman Problem (PTSP) is used to study routing problem under uncertainty. The PTSP is similar to the TSP with the difference that each node has a probability of requiring a visit. Optimization approach for the PTSP consists in finding optimal solution that visits all the nodes and that minimizes the expected cost of the solutions. But, this problem becomes very difficult when the numbers of the node increase. In this paper, we apply LCO and GA into the PTSP to solve this problem and their performance is illustrated based on the experimental results.
