A hybrid algorithm for probabilistic traveling salesman problem

Kazimierz Kiełkowicz,

Zbigniew Kokosiński

Abstrakt

In this paper Probabilistic Traveling Salesman Problem (PTSP) is considered and a hybrid algorithm is proposed, in which an evolutionary algorithm is combined with local optimization and parallelization techniques. Local optimization methods include 1-shift and 2-p-opt operators. Several basic variants of evolutionary and hybrid algorithms are experimentally tested and compared.

Słowa kluczowe: PTSP, evolutionary algorithm, parallel evolutionary algorithm, hybrid algorithm