A hybrid simulated annealing algorithm for travelling salesman problem with three neighbor generation structures
Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 442
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS10_095
تاریخ نمایه سازی: 11 شهریور 1397
Abstract:
Travelling salesman problem (TSP) has been considered as one of the most complicated problems. The problem is NP-Hard and practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. The aim of this study is to presents a hybrid method using tabu search and simulated annealing technique to solve TSP called hybrid simulation annealing (HSA). The proposed HSA algorithm incorporates three neighborhood structures, called swap, insertion and reversion, to explore different possibilities of neighbor solution. This proposed HSA not only prevents revisiting the solution but also maintains the stochastic nature. Finally, the performance of the proposed HSA is examined against tabu search and simulation annealing technique, and the preliminary results indicate that the HSA is capable of solving real-world problems, efficiently
Authors
Misagh rahbari
Department of industrial engineering, University of kharazmi
Ali jahed
Department of industrial engineering, Islamic Azad University South Tehran Branch