A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
Publish place: Journal of Mathematical Modeling، Vol: 8، Issue: 3
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 42
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JMMO-8-3_005
تاریخ نمایه سازی: 19 خرداد 1403
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
Authors
Mohsen Abdolhosseinzadeh
Department of Mathematics, University of Bonab, Bonab, Iran
Mir Mohammad Alipour
Department of Computer Engineering, University of Bonab, Bonab, Iran