%0 Journal Article
%T A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
%J Journal of Mathematical Modeling
%I University of Guilan
%Z 2345-394X
%A Abdolhosseinzadeh, Mohsen
%A Alipour, Mir Mohammad
%D 2020
%\ 06/01/2020
%V 8
%N 3
%P 279-290
%! A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
%K Travelling salesman problem
%K discrete time Markov chain
%K approximation algorithms
%K Simulated Annealing
%R 10.22124/jmm.2020.15535.1378
%X The considered stochastic travelling salesman problem is defined where the costs are distributed exponentially. The costs are symmetric and they satisfy the triangular inequality. A discrete time Markov chain is established in some periods of time. A stochastic tour is created in a dynamic recursive way and the best node is detected to traverse in each period. Then, a simulated annealing based heuristic method is applied to select the best state. All the nodes should be traversed exactly once. An initial $\rho$-approximate solution is applied for some benchmark problems and the obtained solutions are improved by a simulated annealing heuristic method.
%U https://jmm.guilan.ac.ir/article_4027_7430873ed63a7620715be6db6623dc1b.pdf