چکیده مقاله
The prize collecting Travelling salesman problem PCTSP has been considered as one of the most complicatedproblems A salesman collects a prize for each visited city andpays a penalty for each non visited city The problem is NP Hardand practical large scale instances cannot be solved by exactalgorithms within acceptable computational times The aim ofthis study is to presents a hybrid method using tabu search andsimulated annealing technique to solve PCTSP called hybridsimulation annealing HSA This proposed HSA not onlyprevents revisiting the solution but also maintains the stochasticnature Finally the proposed HSA heuristic is tested on eight setsof well known benchmark, and the preliminary results indicatethat the HSA is capable of solving real world problems,efficiently
کلیدواژهها
نویسندگان
Misagh Rahbari
Department of industrial engineering, University of kharazmi
Ali Jahed
Department of industrial engineering, Islamic Azad University South Tehran Branch
Shadi Nouhi Tehrani
Department of industrial engineering, Islamic Azad University South Tehran Branch
شیوه ارجاع
Rahbari, Misagh and Jahed, Ali and Nouhi Tehrani, Shadi,1396,A Hybrid Simulated Annealing Algorithm for the Prize Collecting Travelling Salesman Problem,3th Internatioal Conference on Industrial and Systems Engineering,Mashhad
ارائهشده در
مجموعه مقالات سومین کنفرانس بین المللی مهندسی صنایع و سیستمها (ICISE ۲۰۱۷)22 شهریور 1396 · مشهد