@article { author = {Abdolhosseinzadeh, Mohsen and Alipour, Mir Mohammad}, title = {A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths}, journal = {Journal of Mathematical Modeling}, volume = {8}, number = {3}, pages = {279-290}, year = {2020}, publisher = {University of Guilan}, issn = {2345-394X}, eissn = {2382-9869}, doi = {10.22124/jmm.2020.15535.1378}, abstract = {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.}, keywords = {Travelling salesman problem,discrete time Markov chain,approximation algorithms,Simulated Annealing}, url = {https://jmm.guilan.ac.ir/article_4027.html}, eprint = {https://jmm.guilan.ac.ir/article_4027_7430873ed63a7620715be6db6623dc1b.pdf} }