TY - JOUR
TI - A hybrid algorithm for probabilistic traveling salesman problem
AU - Kiełkowicz, Kazimierz
AU - Kokosiński, Zbigniew
TI - A hybrid algorithm for probabilistic traveling salesman problem
AB - 
	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.
VL - 2012
IS - Automatyka Zeszyt 1-AC (25) 2012
PY - 2012
SN - 0011-4561
C1 - 2353-737X
SP - 1
EP - 1
DO - 10.4467/2353737XCT.14.008.1785
UR - https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/a-hybrid-algorithm-for-probabilistic-traveling-salesman-problem
KW - PTSP
KW - evolutionary algorithm
KW - parallel evolutionary algorithm
KW - hybrid algorithm