پیوندهای مفید
آمار
| تعداد نشریات | 32 |
| تعداد شماره‌ها | 814 |
| تعداد مقالات | 7,880 |
| تعداد مشاهده مقاله | 36,688,009 |
| تعداد دریافت فایل اصل مقاله | 8,306,695 |
A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths | ||
| Journal of Mathematical Modeling | ||
| مقاله 11، دوره 8، شماره 3، شهریور 2020، صفحه 279-290 اصل مقاله (327.16 K) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22124/jmm.2020.15535.1378 | ||
| نویسندگان | ||
| Mohsen Abdolhosseinzadeh* 1؛ Mir Mohammad Alipour2 | ||
| 1Department of Mathematics, University of Bonab, Bonab, Iran | ||
| 2Department of Computer Engineering, University of Bonab, Bonab, Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژه‌ها | ||
| Travelling salesman problem؛ discrete time Markov chain؛ approximation algorithms؛ simulated annealing | ||
|
آمار تعداد مشاهده مقاله: 15,872 تعداد دریافت فایل اصل مقاله: 1,112 |
||