The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the well known Traveling Salesman Problem (TSP). This problem arises when the information about customers demand is not available at the moment of the tour generation and/or the tour re-calculating cost is too elevated. In this article, a Hybrid Algorithm combining Particle Swarm Optimization (PSO) and Simulated Annealing (SA) is proposed, in order to solve the PTSP. The PSO heuristic offers a simple structured algorithm which supplies a high level of exploration and fast convergence, compared with other evolutionary algorithms. The SA algorithm is used to improve the particle diversity and to avoid the algorithm being trapped into local optimum. Two well-known benchmarks of the literature are used and the proposed PSO-SA algorithm obtains acceptable results. In fact, the hybrid algorithm improves the performance of simple PSO algorithm for all instances.
Hybrid Algorithm, Metaheuristics, Routing Problems, Stochastic Optimization, Swarm Intelligence.
Guillermo Cabrera G., Silvana Roncagliolo D., Juan P. Riquelme, Claudio Cubillos, Ricardo Soto, "A Hybrid Particle Swarm Optimization – Simulated Annealing Algorithm for the Probabilistic Travelling Salesman Problem", Studies in Informatics and Control, ISSN 1220-1766, vol. 21(1), pp. 49-58, 2012. https://doi.org/10.24846/v21i1y201206
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).