TY - JOUR ID - 4027 TI - A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths JO - Journal of Mathematical Modeling JA - JMM LA - en SN - 2345-394X AU - Abdolhosseinzadeh, Mohsen AU - Alipour, Mir Mohammad AD - Department of Mathematics, University of Bonab, Bonab, Iran AD - Department of Computer Engineering, University of Bonab, Bonab, Iran Y1 - 2020 PY - 2020 VL - 8 IS - 3 SP - 279 EP - 290 KW - Travelling salesman problem KW - discrete time Markov chain KW - approximation algorithms KW - Simulated Annealing DO - 10.22124/jmm.2020.15535.1378 N2 - 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. UR - https://jmm.guilan.ac.ir/article_4027.html L1 - https://jmm.guilan.ac.ir/article_4027_7430873ed63a7620715be6db6623dc1b.pdf ER -