A Hybrid Simulated Annealing Algorithm for the Prize Collecting Travelling Salesman Problem

Misagh Rahbari (1) , Ali Jahed (2) , Shadi Nouhi Tehrani (2)

1 Kharazmi University [Tehran]
2 Islamic Azad University South Tehran Branch

A salesman who travels between pairs of cities and collects a prize for each visited city and pays a penalty for each non visited city is considered as one of the most complex problems called The prize collecting Travelling salesman problem (PCTSP). The problem is NP-Hard and large-scale operations cannot be solved with exact algorithms at acceptable computational times. The purpose of this study is to provide hybrid simulation annealing (HSA) that is a hybrid method using the tabu search and simulated annealing technique to solve PCTSP. This HSA proposal not only prevents revisiting the solution but also preserves the stochastic nature. Finally the proposed HSA heuristic has been tested on eight sets of well-known benchmark, and the preliminary results indicate that the HSA is capable of solving real-world problems.

Mots clés: The prize collecting travelling salesman problem; Simulated annealing; Tabu search; Meta-heuristics methods

Domaines: Recherche opérationnelle [math.OC]

Misagh Rahbari, Ali Jahed, Shadi Nouhi Tehrani. A Hybrid Simulated Annealing Algorithm for the Prize Collecting Travelling Salesman Problem. 3rd International Conference on Industrial and Systems Engineering (ICISE 2017), Ferdowsi University of Mashhad, Sep 2017, Mashhad, Iran. ⟨hal-01962060⟩